![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > inxp | Structured version Visualization version GIF version |
Description: 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 5790 | . . 3 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)} ∩ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)}) = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))} | |
2 | an4 654 | . . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))) | |
3 | elin 3929 | . . . . . 6 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶)) | |
4 | elin 3929 | . . . . . 6 ⊢ (𝑦 ∈ (𝐵 ∩ 𝐷) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷)) | |
5 | 3, 4 | anbi12i 627 | . . . . 5 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))) |
6 | 2, 5 | bitr4i 277 | . . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) ↔ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))) |
7 | 6 | opabbii 5177 | . . 3 ⊢ {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))} |
8 | 1, 7 | eqtri 2759 | . 2 ⊢ ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)} ∩ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)}) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))} |
9 | df-xp 5644 | . . 3 ⊢ (𝐴 × 𝐵) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)} | |
10 | df-xp 5644 | . . 3 ⊢ (𝐶 × 𝐷) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)} | |
11 | 9, 10 | ineq12i 4175 | . 2 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ({〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)} ∩ {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)}) |
12 | df-xp 5644 | . 2 ⊢ ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))} | |
13 | 8, 11, 12 | 3eqtr4i 2769 | 1 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∩ cin 3912 {copab 5172 × cxp 5636 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-12 2171 ax-ext 2702 ax-sep 5261 ax-nul 5268 ax-pr 5389 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-rab 3406 df-v 3448 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-opab 5173 df-xp 5644 df-rel 5645 |
This theorem is referenced by: xpindi 5794 xpindir 5795 dmxpin 5891 xpssres 5979 xpdisj1 6118 xpdisj2 6119 imainrect 6138 xpima 6139 cnvrescnv 6152 curry1 8041 curry2 8044 fpar 8053 marypha1lem 9378 fpwwe2lem12 10587 hashxplem 14343 sscres 17720 gsumxp 19767 pjfval 21149 pjpm 21151 txbas 22955 txcls 22992 txrest 23019 trust 23618 ressuss 23651 trcfilu 23683 metreslem 23752 ressxms 23918 ressms 23919 mbfmcst 32948 0rrv 33140 poimirlem26 36177 |
Copyright terms: Public domain | W3C validator |