Proof of Theorem resabs1
| Step | Hyp | Ref
| Expression |
| 1 | | sseqin2 1656 |
. . . . . 6
⊢ (B
⊆ C ↔ (C ∩ B) =
B) |
| 2 | | xpeq1 2440 |
. . . . . 6
⊢ ((C
∩ B) = B → ((C
∩ B) × V) = (B × V)) |
| 3 | 1, 2 | sylbi 174 |
. . . . 5
⊢ (B
⊆ C → ((C ∩ B)
× V) = (B ×
V)) |
| 4 | | inxp 2496 |
. . . . . 6
⊢ ((C
× V) ∩ (B ×
V)) = ((C ∩ B) × (V ∩ V)) |
| 5 | | inidm 1649 |
. . . . . . 7
⊢ (V ∩ V) =
V |
| 6 | | xpeq2 2441 |
. . . . . . 7
⊢ ((V ∩ V) = V
→ ((C ∩ B) × (V ∩ V)) = ((C ∩ B)
× V)) |
| 7 | 5, 6 | ax-mp 6 |
. . . . . 6
⊢ ((C
∩ B) × (V ∩ V))
= ((C ∩ B) × V) |
| 8 | 4, 7 | eqtr2 1120 |
. . . . 5
⊢ ((C
∩ B) × V) = ((C × V) ∩ (B × V)) |
| 9 | 3, 8 | syl5reqr 1139 |
. . . 4
⊢ (B
⊆ C → (B × V) = ((C × V) ∩ (B × V))) |
| 10 | 9 | ineq2d 1645 |
. . 3
⊢ (B
⊆ C → (A ∩ (B
× V)) = (A ∩ ((C × V) ∩ (B × V)))) |
| 11 | | inass 1650 |
. . 3
⊢ ((A
∩ (C × V)) ∩ (B × V)) = (A ∩ ((C
× V) ∩ (B ×
V))) |
| 12 | 10, 11 | syl6reqr 1143 |
. 2
⊢ (B
⊆ C → ((A ∩ (C
× V)) ∩ (B ×
V)) = (A ∩ (B × V))) |
| 13 | | df-res 2430 |
. . 3
⊢ ((A
↾ C) ↾ B) = ((A ↾
C) ∩ (B × V)) |
| 14 | | df-res 2430 |
. . . 4
⊢ (A
↾ C) = (A ∩ (C
× V)) |
| 15 | 14 | ineq1i 1641 |
. . 3
⊢ ((A
↾ C) ∩ (B × V)) = ((A ∩ (C
× V)) ∩ (B ×
V)) |
| 16 | 13, 15 | eqtr 1119 |
. 2
⊢ ((A
↾ C) ↾ B) = ((A ∩
(C × V)) ∩ (B × V)) |
| 17 | | df-res 2430 |
. 2
⊢ (A
↾ B) = (A ∩ (B
× V)) |
| 18 | 12, 16, 17 | 3eqtr4g 1147 |
1
⊢ (B
⊆ C → ((A ↾ C)
↾ B) = (A ↾ B)) |