| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xpssres | GIF version | ||
| Description: Restriction of a constant function (or other cross product). (Contributed by Stefan O'Rear, 24-Jan-2015.) |
| Ref | Expression |
|---|---|
| xpssres | ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 4694 | . . 3 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 × 𝐵) ∩ (𝐶 × V)) | |
| 2 | inxp 4819 | . . 3 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) | |
| 3 | incom 3369 | . . . 4 ⊢ (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴) | |
| 4 | inv1 3501 | . . . 4 ⊢ (𝐵 ∩ V) = 𝐵 | |
| 5 | 3, 4 | xpeq12i 4704 | . . 3 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ((𝐶 ∩ 𝐴) × 𝐵) |
| 6 | 1, 2, 5 | 3eqtri 2231 | . 2 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐶 ∩ 𝐴) × 𝐵) |
| 7 | df-ss 3183 | . . . 4 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐶 ∩ 𝐴) = 𝐶) | |
| 8 | 7 | biimpi 120 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐶 ∩ 𝐴) = 𝐶) |
| 9 | 8 | xpeq1d 4705 | . 2 ⊢ (𝐶 ⊆ 𝐴 → ((𝐶 ∩ 𝐴) × 𝐵) = (𝐶 × 𝐵)) |
| 10 | 6, 9 | eqtrid 2251 | 1 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 Vcvv 2773 ∩ cin 3169 ⊆ wss 3170 × cxp 4680 ↾ cres 4684 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-14 2180 ax-ext 2188 ax-sep 4169 ax-pow 4225 ax-pr 4260 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ral 2490 df-rex 2491 df-v 2775 df-un 3174 df-in 3176 df-ss 3183 df-pw 3622 df-sn 3643 df-pr 3644 df-op 3646 df-opab 4113 df-xp 4688 df-rel 4689 df-res 4694 |
| This theorem is referenced by: cnconst2 14775 |
| Copyright terms: Public domain | W3C validator |