Proof of Theorem spansncvt
| Step | Hyp | Ref
| Expression |
| 1 | | psseq1 1559 |
. . . 4
⊢ (A =
if(A ∈ Cℋ ,
A, ℋ ) → (A ⊂ B ↔
if(A ∈ Cℋ ,
A, ℋ ) ⊂ B)) |
| 2 | | opreq1 3006 |
. . . . 5
⊢ (A =
if(A ∈ Cℋ ,
A, ℋ ) → (A ∨ℋ (span ‘{C})) = (if(A
∈ Cℋ , A,
ℋ ) ∨ℋ (span ‘{C}))) |
| 3 | 2 | sseq2d 1528 |
. . . 4
⊢ (A =
if(A ∈ Cℋ ,
A, ℋ ) → (B ⊆ (A
∨ℋ (span ‘{C}))
↔ B ⊆ (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C})))) |
| 4 | 1, 3 | anbi12d 476 |
. . 3
⊢ (A =
if(A ∈ Cℋ ,
A, ℋ ) → ((A ⊂ B ∧
B ⊆ (A ∨ℋ (span ‘{C}))) ↔ (if(A ∈ Cℋ , A, ℋ ) ⊂ B ∧ B
⊆ (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{C}))))) |
| 5 | 2 | cleq2d 1112 |
. . 3
⊢ (A =
if(A ∈ Cℋ ,
A, ℋ ) → (B = (A
∨ℋ (span ‘{C}))
↔ B = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C})))) |
| 6 | 4, 5 | imbi12d 474 |
. 2
⊢ (A =
if(A ∈ Cℋ ,
A, ℋ ) → (((A ⊂ B ∧
B ⊆ (A ∨ℋ (span ‘{C}))) → B =
(A ∨ℋ (span
‘{C}))) ↔ ((if(A ∈ Cℋ , A, ℋ ) ⊂ B ∧ B
⊆ (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{C})))
→ B = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C}))))) |
| 7 | | psseq2 1560 |
. . . 4
⊢ (B =
if(B ∈ Cℋ ,
B, ℋ ) → (if(A ∈ Cℋ , A, ℋ ) ⊂ B ↔ if(A
∈ Cℋ , A,
ℋ ) ⊂ if(B ∈
Cℋ , B, ℋ
))) |
| 8 | | sseq1 1521 |
. . . 4
⊢ (B =
if(B ∈ Cℋ ,
B, ℋ ) → (B ⊆ (if(A
∈ Cℋ , A,
ℋ ) ∨ℋ (span ‘{C})) ↔ if(B
∈ Cℋ , B,
ℋ ) ⊆ (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{C})))) |
| 9 | 7, 8 | anbi12d 476 |
. . 3
⊢ (B =
if(B ∈ Cℋ ,
B, ℋ ) → ((if(A ∈ Cℋ , A, ℋ ) ⊂ B ∧ B
⊆ (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{C})))
↔ (if(A ∈
Cℋ , A, ℋ )
⊂ if(B ∈
Cℋ , B, ℋ )
∧ if(B ∈
Cℋ , B, ℋ )
⊆ (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{C}))))) |
| 10 | | cleq1 1107 |
. . 3
⊢ (B =
if(B ∈ Cℋ ,
B, ℋ ) → (B = (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{C}))
↔ if(B ∈
Cℋ , B, ℋ ) =
(if(A ∈ Cℋ ,
A, ℋ ) ∨ℋ (span
‘{C})))) |
| 11 | 9, 10 | imbi12d 474 |
. 2
⊢ (B =
if(B ∈ Cℋ ,
B, ℋ ) → (((if(A ∈ Cℋ , A, ℋ ) ⊂ B ∧ B
⊆ (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{C})))
→ B = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C}))) ↔ ((if(A ∈ Cℋ , A, ℋ ) ⊂ if(B ∈ Cℋ , B, ℋ ) ∧ if(B ∈ Cℋ , B, ℋ ) ⊆ (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C}))) → if(B ∈ Cℋ , B, ℋ ) = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C}))))) |
| 12 | | sneq 1816 |
. . . . . . 7
⊢ (C =
if(C ∈ ℋ , C, 0v) → {C} = {if(C
∈ ℋ , C,
0v)}) |
| 13 | 12 | fveq2d 2836 |
. . . . . 6
⊢ (C =
if(C ∈ ℋ , C, 0v) → (span
‘{C}) = (span ‘{if(C ∈ ℋ , C, 0v)})) |
| 14 | 13 | opreq2d 3013 |
. . . . 5
⊢ (C =
if(C ∈ ℋ , C, 0v) → (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C})) = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{if(C ∈ ℋ , C, 0v)}))) |
| 15 | 14 | sseq2d 1528 |
. . . 4
⊢ (C =
if(C ∈ ℋ , C, 0v) → (if(B ∈ Cℋ , B, ℋ ) ⊆ (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C})) ↔ if(B ∈ Cℋ , B, ℋ ) ⊆ (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{if(C ∈ ℋ , C, 0v)})))) |
| 16 | 15 | anbi2d 468 |
. . 3
⊢ (C =
if(C ∈ ℋ , C, 0v) → ((if(A ∈ Cℋ , A, ℋ ) ⊂ if(B ∈ Cℋ , B, ℋ ) ∧ if(B ∈ Cℋ , B, ℋ ) ⊆ (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C}))) ↔ (if(A ∈ Cℋ , A, ℋ ) ⊂ if(B ∈ Cℋ , B, ℋ ) ∧ if(B ∈ Cℋ , B, ℋ ) ⊆ (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{if(C ∈ ℋ , C, 0v)}))))) |
| 17 | 14 | cleq2d 1112 |
. . 3
⊢ (C =
if(C ∈ ℋ , C, 0v) → (if(B ∈ Cℋ , B, ℋ ) = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C})) ↔ if(B ∈ Cℋ , B, ℋ ) = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{if(C ∈ ℋ , C, 0v)})))) |
| 18 | 16, 17 | imbi12d 474 |
. 2
⊢ (C =
if(C ∈ ℋ , C, 0v) → (((if(A ∈ Cℋ , A, ℋ ) ⊂ if(B ∈ Cℋ , B, ℋ ) ∧ if(B ∈ Cℋ , B, ℋ ) ⊆ (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C}))) → if(B ∈ Cℋ , B, ℋ ) = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{C}))) ↔ ((if(A ∈ Cℋ , A, ℋ ) ⊂ if(B ∈ Cℋ , B, ℋ ) ∧ if(B ∈ Cℋ , B, ℋ ) ⊆ (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{if(C ∈ ℋ , C, 0v)}))) → if(B ∈ Cℋ , B, ℋ ) = (if(A ∈ Cℋ , A, ℋ ) ∨ℋ (span
‘{if(C ∈ ℋ , C, 0v)}))))) |
| 19 | | helch 5151 |
. . . 4
⊢ ℋ ∈
Cℋ |
| 20 | 19 | elimel 1793 |
. . 3
⊢ if(A
∈ Cℋ , A,
ℋ ) ∈ Cℋ |
| 21 | 19 | elimel 1793 |
. . 3
⊢ if(B
∈ Cℋ , B,
ℋ ) ∈ Cℋ |
| 22 | | ax-hvzercl 4987 |
. . . 4
⊢ 0v ∈
ℋ |
| 23 | 22 | elimel 1793 |
. . 3
⊢ if(C
∈ ℋ , C, 0v)
∈ ℋ |
| 24 | 20, 21, 23 | spansncv 5542 |
. 2
⊢ ((if(A
∈ Cℋ , A,
ℋ ) ⊂ if(B ∈
Cℋ , B, ℋ )
∧ if(B ∈
Cℋ , B, ℋ )
⊆ (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{if(C
∈ ℋ , C,
0v)}))) → if(B
∈ Cℋ , B,
ℋ ) = (if(A ∈
Cℋ , A, ℋ )
∨ℋ (span ‘{if(C
∈ ℋ , C,
0v)}))) |
| 25 | 6, 11, 18, 24 | dedth3h 1788 |
1
⊢ ((A
∈ Cℋ ∧ B
∈ Cℋ ∧ C
∈ ℋ ) → ((A ⊂ B ∧ B
⊆ (A ∨ℋ (span
‘{C}))) → B = (A
∨ℋ (span ‘{C})))) |