| 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.) Avoid ax-10 2146, ax-12 2184. (Revised by SN, 5-May-2025.) |
| Ref | Expression |
|---|---|
| inxp | ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relinxp 5763 | . 2 ⊢ Rel ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) | |
| 2 | relxp 5642 | . 2 ⊢ Rel ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) | |
| 3 | an4 656 | . . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))) | |
| 4 | opelxp 5660 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
| 5 | opelxp 5660 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐶 × 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) | |
| 6 | 4, 5 | anbi12i 628 | . . . 4 ⊢ ((〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ∧ 〈𝑥, 𝑦〉 ∈ (𝐶 × 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
| 7 | elin 3917 | . . . . 5 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶)) | |
| 8 | elin 3917 | . . . . 5 ⊢ (𝑦 ∈ (𝐵 ∩ 𝐷) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷)) | |
| 9 | 7, 8 | anbi12i 628 | . . . 4 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))) |
| 10 | 3, 6, 9 | 3bitr4i 303 | . . 3 ⊢ ((〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ∧ 〈𝑥, 𝑦〉 ∈ (𝐶 × 𝐷)) ↔ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))) |
| 11 | elin 3917 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ∧ 〈𝑥, 𝑦〉 ∈ (𝐶 × 𝐷))) | |
| 12 | opelxp 5660 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) ↔ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))) | |
| 13 | 10, 11, 12 | 3bitr4i 303 | . 2 ⊢ (〈𝑥, 𝑦〉 ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ 〈𝑥, 𝑦〉 ∈ ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷))) |
| 14 | 1, 2, 13 | eqrelriiv 5739 | 1 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∩ cin 3900 〈cop 4586 × cxp 5622 |
| 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 2115 ax-9 2123 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| 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 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3061 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-opab 5161 df-xp 5630 df-rel 5631 |
| This theorem is referenced by: xpindi 5782 xpindir 5783 dmxpin 5880 xpssres 5977 xpdisj1 6119 xpdisj2 6120 imainrect 6139 xpima 6140 cnvrescnv 6153 curry1 8046 curry2 8049 fpar 8058 marypha1lem 9336 fpwwe2lem12 10553 hashxplem 14356 sscres 17747 gsumxp 19905 pjfval 21661 pjpm 21663 txbas 23511 txcls 23548 txrest 23575 trust 24173 ressuss 24206 trcfilu 24237 metreslem 24306 ressxms 24469 ressms 24470 mbfmcst 34416 0rrv 34608 poimirlem26 37843 |
| Copyright terms: Public domain | W3C validator |