| 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 5628 | . . 3 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 × 𝐵) ∩ (𝐶 × V)) | |
| 2 | inxp 5771 | . . 3 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) | |
| 3 | inv1 4348 | . . . 4 ⊢ (𝐵 ∩ V) = 𝐵 | |
| 4 | 3 | xpeq2i 5643 | . . 3 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ((𝐴 ∩ 𝐶) × 𝐵) |
| 5 | 1, 2, 4 | 3eqtri 2758 | . 2 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 ∩ 𝐶) × 𝐵) |
| 6 | sseqin2 4173 | . . . 4 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐶) = 𝐶) | |
| 7 | 6 | biimpi 216 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐴 ∩ 𝐶) = 𝐶) |
| 8 | 7 | xpeq1d 5645 | . 2 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 ∩ 𝐶) × 𝐵) = (𝐶 × 𝐵)) |
| 9 | 5, 8 | eqtrid 2778 | 1 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 Vcvv 3436 ∩ cin 3901 ⊆ wss 3902 × cxp 5614 ↾ cres 5618 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-ext 2703 ax-sep 5234 ax-nul 5244 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2068 df-clab 2710 df-cleq 2723 df-clel 2806 df-ral 3048 df-rex 3057 df-rab 3396 df-v 3438 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4476 df-sn 4577 df-pr 4579 df-op 4583 df-opab 5154 df-xp 5622 df-rel 5623 df-res 5628 |
| This theorem is referenced by: fparlem3 8044 fparlem4 8045 fpwwe2lem12 10533 pwssplit3 20996 cnconst2 23199 xkoccn 23535 tmdgsum 24011 dvcmul 25875 dvcmulf 25876 ply1gsumz 33557 lbsdiflsp0 33637 dvsconst 44369 dvsid 44370 aacllem 49839 |
| Copyright terms: Public domain | W3C validator |