| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpssres | Structured version Visualization version GIF version | ||
| Description: Restriction of a constant function (or other Cartesian product). (Contributed by Stefan O'Rear, 24-Jan-2015.) |
| Ref | Expression |
|---|---|
| xpssres | ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-res 5650 | . . 3 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 × 𝐵) ∩ (𝐶 × V)) | |
| 2 | inxp 5795 | . . 3 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) | |
| 3 | inv1 4361 | . . . 4 ⊢ (𝐵 ∩ V) = 𝐵 | |
| 4 | 3 | xpeq2i 5665 | . . 3 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ((𝐴 ∩ 𝐶) × 𝐵) |
| 5 | 1, 2, 4 | 3eqtri 2756 | . 2 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 ∩ 𝐶) × 𝐵) |
| 6 | sseqin2 4186 | . . . 4 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐶) = 𝐶) | |
| 7 | 6 | biimpi 216 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐴 ∩ 𝐶) = 𝐶) |
| 8 | 7 | xpeq1d 5667 | . 2 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 ∩ 𝐶) × 𝐵) = (𝐶 × 𝐵)) |
| 9 | 5, 8 | eqtrid 2776 | 1 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 Vcvv 3447 ∩ cin 3913 ⊆ wss 3914 × cxp 5636 ↾ cres 5640 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-ext 2701 ax-sep 5251 ax-nul 5261 ax-pr 5387 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-sb 2066 df-clab 2708 df-cleq 2721 df-clel 2803 df-ral 3045 df-rex 3054 df-rab 3406 df-v 3449 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-nul 4297 df-if 4489 df-sn 4590 df-pr 4592 df-op 4596 df-opab 5170 df-xp 5644 df-rel 5645 df-res 5650 |
| This theorem is referenced by: fparlem3 8093 fparlem4 8094 fpwwe2lem12 10595 pwssplit3 20968 cnconst2 23170 xkoccn 23506 tmdgsum 23982 dvcmul 25847 dvcmulf 25848 ply1gsumz 33564 lbsdiflsp0 33622 dvsconst 44319 dvsid 44320 aacllem 49790 |
| Copyright terms: Public domain | W3C validator |