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 5601 | . . 3 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 × 𝐵) ∩ (𝐶 × V)) | |
2 | inxp 5741 | . . 3 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) | |
3 | inv1 4328 | . . . 4 ⊢ (𝐵 ∩ V) = 𝐵 | |
4 | 3 | xpeq2i 5616 | . . 3 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ((𝐴 ∩ 𝐶) × 𝐵) |
5 | 1, 2, 4 | 3eqtri 2770 | . 2 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 ∩ 𝐶) × 𝐵) |
6 | sseqin2 4149 | . . . 4 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐶) = 𝐶) | |
7 | 6 | biimpi 215 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐴 ∩ 𝐶) = 𝐶) |
8 | 7 | xpeq1d 5618 | . 2 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 ∩ 𝐶) × 𝐵) = (𝐶 × 𝐵)) |
9 | 5, 8 | eqtrid 2790 | 1 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 Vcvv 3432 ∩ cin 3886 ⊆ wss 3887 × cxp 5587 ↾ cres 5591 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-12 2171 ax-ext 2709 ax-sep 5223 ax-nul 5230 ax-pr 5352 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-opab 5137 df-xp 5595 df-rel 5596 df-res 5601 |
This theorem is referenced by: fparlem3 7954 fparlem4 7955 fpwwe2lem12 10398 pwssplit3 20323 cnconst2 22434 xkoccn 22770 tmdgsum 23246 dvcmul 25108 dvcmulf 25109 lbsdiflsp0 31707 dvsconst 41948 dvsid 41949 aacllem 46505 |
Copyright terms: Public domain | W3C validator |