| 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 5636 | . . 3 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 × 𝐵) ∩ (𝐶 × V)) | |
| 2 | inxp 5780 | . . 3 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) | |
| 3 | inv1 4339 | . . . 4 ⊢ (𝐵 ∩ V) = 𝐵 | |
| 4 | 3 | xpeq2i 5651 | . . 3 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ((𝐴 ∩ 𝐶) × 𝐵) |
| 5 | 1, 2, 4 | 3eqtri 2764 | . 2 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 ∩ 𝐶) × 𝐵) |
| 6 | sseqin2 4164 | . . . 4 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐴 ∩ 𝐶) = 𝐶) | |
| 7 | 6 | biimpi 216 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐴 ∩ 𝐶) = 𝐶) |
| 8 | 7 | xpeq1d 5653 | . 2 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 ∩ 𝐶) × 𝐵) = (𝐶 × 𝐵)) |
| 9 | 5, 8 | eqtrid 2784 | 1 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 Vcvv 3430 ∩ cin 3889 ⊆ wss 3890 × cxp 5622 ↾ cres 5626 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5231 ax-pr 5370 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-opab 5149 df-xp 5630 df-rel 5631 df-res 5636 |
| This theorem is referenced by: fparlem3 8057 fparlem4 8058 fpwwe2lem12 10556 pwssplit3 21048 cnconst2 23258 xkoccn 23594 tmdgsum 24070 dvcmul 25921 dvcmulf 25922 ply1gsumz 33674 lbsdiflsp0 33786 dvsconst 44775 dvsid 44776 aacllem 50288 |
| Copyright terms: Public domain | W3C validator |