![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > xpssres | GIF version |
Description: Restriction of a constant function (or other cross product). (Contributed by Stefan O'Rear, 24-Jan-2015.) |
Ref | Expression |
---|---|
xpssres | ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-res 4671 | . . 3 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐴 × 𝐵) ∩ (𝐶 × V)) | |
2 | inxp 4796 | . . 3 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × V)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) | |
3 | incom 3351 | . . . 4 ⊢ (𝐴 ∩ 𝐶) = (𝐶 ∩ 𝐴) | |
4 | inv1 3483 | . . . 4 ⊢ (𝐵 ∩ V) = 𝐵 | |
5 | 3, 4 | xpeq12i 4681 | . . 3 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ V)) = ((𝐶 ∩ 𝐴) × 𝐵) |
6 | 1, 2, 5 | 3eqtri 2218 | . 2 ⊢ ((𝐴 × 𝐵) ↾ 𝐶) = ((𝐶 ∩ 𝐴) × 𝐵) |
7 | df-ss 3166 | . . . 4 ⊢ (𝐶 ⊆ 𝐴 ↔ (𝐶 ∩ 𝐴) = 𝐶) | |
8 | 7 | biimpi 120 | . . 3 ⊢ (𝐶 ⊆ 𝐴 → (𝐶 ∩ 𝐴) = 𝐶) |
9 | 8 | xpeq1d 4682 | . 2 ⊢ (𝐶 ⊆ 𝐴 → ((𝐶 ∩ 𝐴) × 𝐵) = (𝐶 × 𝐵)) |
10 | 6, 9 | eqtrid 2238 | 1 ⊢ (𝐶 ⊆ 𝐴 → ((𝐴 × 𝐵) ↾ 𝐶) = (𝐶 × 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1364 Vcvv 2760 ∩ cin 3152 ⊆ wss 3153 × cxp 4657 ↾ cres 4661 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-nf 1472 df-sb 1774 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ral 2477 df-rex 2478 df-v 2762 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-opab 4091 df-xp 4665 df-rel 4666 df-res 4671 |
This theorem is referenced by: cnconst2 14401 |
Copyright terms: Public domain | W3C validator |