Proof of Theorem hlimuni
| Step | Hyp | Ref
| Expression |
| 1 | | cleq1 1107 |
. 2
⊢ (A =
if((F ⇝v A ∧ F
⇝v B), A, 0v) → (A = B ↔
if((F ⇝v A ∧ F
⇝v B), A, 0v) = B)) |
| 2 | | cleq2 1110 |
. 2
⊢ (B =
if((F ⇝v A ∧ F
⇝v B), B, 0v) → (if((F ⇝v A ∧ F
⇝v B), A, 0v) = B ↔ if((F
⇝v A ∧ F ⇝v B), A,
0v) = if((F
⇝v A ∧ F ⇝v B), B,
0v))) |
| 3 | | hlimuni.1 |
. . . 4
⊢ A
∈ V |
| 4 | | ax-hvzercl 4987 |
. . . . 5
⊢ 0v ∈
ℋ |
| 5 | 4 | elisseti 1355 |
. . . 4
⊢ 0v ∈
V |
| 6 | 3, 5 | keepel 1796 |
. . 3
⊢ if((F
⇝v A ∧ F ⇝v B), A,
0v) ∈ V |
| 7 | | hlimuni.2 |
. . . 4
⊢ B
∈ V |
| 8 | 7, 5 | keepel 1796 |
. . 3
⊢ if((F
⇝v A ∧ F ⇝v B), B,
0v) ∈ V |
| 9 | | hlimuni.3 |
. . . 4
⊢ F
∈ V |
| 10 | | nnex 4431 |
. . . . 5
⊢ ℕ ∈ V |
| 11 | | snex 1859 |
. . . . 5
⊢ {0v} ∈
V |
| 12 | 10, 11 | xpex 2488 |
. . . 4
⊢ (ℕ × {0v})
∈ V |
| 13 | 9, 12 | keepel 1796 |
. . 3
⊢ if((F
⇝v A ∧ F ⇝v B), F, (ℕ
× {0v})) ∈ V |
| 14 | | breq2 2066 |
. . . . 5
⊢ (A =
if((F ⇝v A ∧ F
⇝v B), A, 0v) → (F ⇝v A ↔ F
⇝v if((F
⇝v A ∧ F ⇝v B), A,
0v))) |
| 15 | 14 | anbi1d 469 |
. . . 4
⊢ (A =
if((F ⇝v A ∧ F
⇝v B), A, 0v) → ((F ⇝v A ∧ F
⇝v B) ↔
(F ⇝v if((F ⇝v A ∧ F
⇝v B), A, 0v) ∧ F ⇝v B))) |
| 16 | | breq2 2066 |
. . . . 5
⊢ (B =
if((F ⇝v A ∧ F
⇝v B), B, 0v) → (F ⇝v B ↔ F
⇝v if((F
⇝v A ∧ F ⇝v B), B,
0v))) |
| 17 | 16 | anbi2d 468 |
. . . 4
⊢ (B =
if((F ⇝v A ∧ F
⇝v B), B, 0v) → ((F ⇝v if((F ⇝v A ∧ F
⇝v B), A, 0v) ∧ F ⇝v B) ↔ (F
⇝v if((F
⇝v A ∧ F ⇝v B), A,
0v) ∧ F
⇝v if((F
⇝v A ∧ F ⇝v B), B,
0v)))) |
| 18 | | breq1 2065 |
. . . . 5
⊢ (F =
if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v})) →
(F ⇝v if((F ⇝v A ∧ F
⇝v B), A, 0v) ↔ if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v}))
⇝v if((F
⇝v A ∧ F ⇝v B), A,
0v))) |
| 19 | | breq1 2065 |
. . . . 5
⊢ (F =
if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v})) →
(F ⇝v if((F ⇝v A ∧ F
⇝v B), B, 0v) ↔ if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v}))
⇝v if((F
⇝v A ∧ F ⇝v B), B,
0v))) |
| 20 | 18, 19 | anbi12d 476 |
. . . 4
⊢ (F =
if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v})) →
((F ⇝v if((F ⇝v A ∧ F
⇝v B), A, 0v) ∧ F ⇝v if((F ⇝v A ∧ F
⇝v B), B, 0v)) ↔ (if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v}))
⇝v if((F
⇝v A ∧ F ⇝v B), A,
0v) ∧ if((F
⇝v A ∧ F ⇝v B), F, (ℕ
× {0v})) ⇝v if((F ⇝v A ∧ F
⇝v B), B, 0v)))) |
| 21 | | breq2 2066 |
. . . . 5
⊢ (0v = if((F ⇝v A ∧ F
⇝v B), A, 0v) → ((ℕ ×
{0v}) ⇝v 0v ↔
(ℕ × {0v}) ⇝v
if((F ⇝v A ∧ F
⇝v B), A, 0v))) |
| 22 | 21 | anbi1d 469 |
. . . 4
⊢ (0v = if((F ⇝v A ∧ F
⇝v B), A, 0v) → (((ℕ ×
{0v}) ⇝v 0v ∧
(ℕ × {0v}) ⇝v
0v) ↔ ((ℕ × {0v})
⇝v if((F
⇝v A ∧ F ⇝v B), A,
0v) ∧ (ℕ × {0v})
⇝v 0v))) |
| 23 | | breq2 2066 |
. . . . 5
⊢ (0v = if((F ⇝v A ∧ F
⇝v B), B, 0v) → ((ℕ ×
{0v}) ⇝v 0v ↔
(ℕ × {0v}) ⇝v
if((F ⇝v A ∧ F
⇝v B), B, 0v))) |
| 24 | 23 | anbi2d 468 |
. . . 4
⊢ (0v = if((F ⇝v A ∧ F
⇝v B), B, 0v) → (((ℕ ×
{0v}) ⇝v if((F ⇝v A ∧ F
⇝v B), A, 0v) ∧ (ℕ ×
{0v}) ⇝v 0v) ↔
((ℕ × {0v}) ⇝v
if((F ⇝v A ∧ F
⇝v B), A, 0v) ∧ (ℕ ×
{0v}) ⇝v if((F ⇝v A ∧ F
⇝v B), B, 0v)))) |
| 25 | | breq1 2065 |
. . . . 5
⊢ ((ℕ × {0v})
= if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v})) →
((ℕ × {0v}) ⇝v
if((F ⇝v A ∧ F
⇝v B), A, 0v) ↔ if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v}))
⇝v if((F
⇝v A ∧ F ⇝v B), A,
0v))) |
| 26 | | breq1 2065 |
. . . . 5
⊢ ((ℕ × {0v})
= if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v})) →
((ℕ × {0v}) ⇝v
if((F ⇝v A ∧ F
⇝v B), B, 0v) ↔ if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v}))
⇝v if((F
⇝v A ∧ F ⇝v B), B,
0v))) |
| 27 | 25, 26 | anbi12d 476 |
. . . 4
⊢ ((ℕ × {0v})
= if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v})) →
(((ℕ × {0v}) ⇝v
if((F ⇝v A ∧ F
⇝v B), A, 0v) ∧ (ℕ ×
{0v}) ⇝v if((F ⇝v A ∧ F
⇝v B), B, 0v)) ↔ (if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v}))
⇝v if((F
⇝v A ∧ F ⇝v B), A,
0v) ∧ if((F
⇝v A ∧ F ⇝v B), F, (ℕ
× {0v})) ⇝v if((F ⇝v A ∧ F
⇝v B), B, 0v)))) |
| 28 | | hlim0 5140 |
. . . . 5
⊢ (ℕ × {0v})
⇝v 0v |
| 29 | 28, 28 | pm3.2i 234 |
. . . 4
⊢ ((ℕ × {0v})
⇝v 0v ∧ (ℕ ×
{0v}) ⇝v
0v) |
| 30 | 15, 17, 20, 22, 24, 27, 29 | elimhyp3v 1792 |
. . 3
⊢ (if((F
⇝v A ∧ F ⇝v B), F, (ℕ
× {0v})) ⇝v if((F ⇝v A ∧ F
⇝v B), A, 0v) ∧ if((F ⇝v A ∧ F
⇝v B), F, (ℕ × {0v}))
⇝v if((F
⇝v A ∧ F ⇝v B), B,
0v)) |
| 31 | 6, 8, 13, 30 | hlimunii 5143 |
. 2
⊢ if((F
⇝v A ∧ F ⇝v B), A,
0v) = if((F
⇝v A ∧ F ⇝v B), B,
0v) |
| 32 | 1, 2, 31 | dedth2v 1785 |
1
⊢ ((F
⇝v A ∧ F ⇝v B) → A =
B) |