| 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 5655 | . . 3 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 × 𝐵) ∩ (𝐶 × V)) | |
| 2 | inxp 5800 | . . 3 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) | |
| 3 | inv1 4349 | . . . 4 ⊢ (𝐵 ∩ V) = 𝐵 | |
| 4 | 3 | xpeq2i 5670 | . . 3 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ((𝐴 ∩ 𝐶) × 𝐵) |
| 5 | 1, 2, 4 | 3eqtri 2788 | . 2 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 ∩ 𝐶) × 𝐵) |
| 6 | sseqin2 4173 | . . . 4 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐶) = 𝐶) | |
| 7 | 6 | biimpi 218 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐴 ∩ 𝐶) = 𝐶) |
| 8 | 7 | xpeq1d 5672 | . 2 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 ∩ 𝐶) × 𝐵) = (𝐶 × 𝐵)) |
| 9 | 5, 8 | eqtrid 2808 | 1 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1559 Vcvv 3453 ∩ cin 3901 ⊆ wss 3902 × cxp 5641 ↾ cres 5645 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-ext 2733 ax-sep 5243 ax-pr 5387 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-sn 4580 df-pr 4582 df-op 4586 df-opab 5160 df-xp 5649 df-rel 5650 df-res 5655 |
| This theorem is referenced by: fparlem3 8086 fparlem4 8087 fpwwe2lem12 10593 pwssplit3 21115 cnconst2 23330 xkoccn 23666 tmdgsum 24142 dvcmul 25993 dvcmulf 25994 ply1gsumz 33755 lbsdiflsp0 33883 dvsconst 44866 dvsid 44867 aacllem 50382 |
| Copyright terms: Public domain | W3C validator |