Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > inxp | Structured version Visualization version GIF version |
Description: The intersection of two Cartesian products. Exercise 9 of [TakeutiZaring] p. 25. (Contributed by NM, 3-Aug-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.) |
Ref | Expression |
---|---|
inxp | ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | inopab 5701 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)} ∩ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)}) = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))} | |
2 | an4 654 | . . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))) | |
3 | elin 4169 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶)) | |
4 | elin 4169 | . . . . . 6 ⊢ (𝑦 ∈ (𝐵 ∩ 𝐷) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷)) | |
5 | 3, 4 | anbi12i 628 | . . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))) |
6 | 2, 5 | bitr4i 280 | . . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) ↔ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))) |
7 | 6 | opabbii 5133 | . . 3 ⊢ {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))} |
8 | 1, 7 | eqtri 2844 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)} ∩ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)}) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))} |
9 | df-xp 5561 | . . 3 ⊢ (𝐴 × 𝐵) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)} | |
10 | df-xp 5561 | . . 3 ⊢ (𝐶 × 𝐷) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)} | |
11 | 9, 10 | ineq12i 4187 | . 2 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)} ∩ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)}) |
12 | df-xp 5561 | . 2 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))} | |
13 | 8, 11, 12 | 3eqtr4i 2854 | 1 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 398 = wceq 1537 ∈ wcel 2114 ∩ cin 3935 {copab 5128 × cxp 5553 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-sep 5203 ax-nul 5210 ax-pr 5330 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-rab 3147 df-v 3496 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-sn 4568 df-pr 4570 df-op 4574 df-opab 5129 df-xp 5561 df-rel 5562 |
This theorem is referenced by: xpindi 5704 xpindir 5705 dmxpin 5801 xpssres 5889 xpdisj1 6018 xpdisj2 6019 imainrect 6038 xpima 6039 cnvrescnv 6052 curry1 7799 curry2 7802 fpar 7811 marypha1lem 8897 fpwwe2lem13 10064 hashxplem 13795 sscres 17093 gsumxp 19096 pjfval 20850 pjpm 20852 txbas 22175 txcls 22212 txrest 22239 trust 22838 ressuss 22872 trcfilu 22903 metreslem 22972 ressxms 23135 ressms 23136 mbfmcst 31517 0rrv 31709 poimirlem26 34933 |
Copyright terms: Public domain | W3C validator |