| 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 2152, ax-12 2189. (Revised by SN, 5-May-2025.) |
| Ref | Expression |
|---|---|
| inxp | ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relinxp 5764 | . 2 ⊢ Rel ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) | |
| 2 | relxp 5643 | . 2 ⊢ Rel ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) | |
| 3 | an4 662 | . . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))) | |
| 4 | opelxp 5661 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) | |
| 5 | opelxp 5661 | . . . . 5 ⊢ (〈𝑥, 𝑦〉 ∈ (𝐶 × 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) | |
| 6 | 4, 5 | anbi12i 634 | . . . 4 ⊢ ((〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ∧ 〈𝑥, 𝑦〉 ∈ (𝐶 × 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))) |
| 7 | elin 3906 | . . . . 5 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶)) | |
| 8 | elin 3906 | . . . . 5 ⊢ (𝑦 ∈ (𝐵 ∩ 𝐷) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷)) | |
| 9 | 7, 8 | anbi12i 634 | . . . 4 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))) |
| 10 | 3, 6, 9 | 3bitr4i 304 | . . 3 ⊢ ((〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ∧ 〈𝑥, 𝑦〉 ∈ (𝐶 × 𝐷)) ↔ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))) |
| 11 | elin 3906 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ (〈𝑥, 𝑦〉 ∈ (𝐴 × 𝐵) ∧ 〈𝑥, 𝑦〉 ∈ (𝐶 × 𝐷))) | |
| 12 | opelxp 5661 | . . 3 ⊢ (〈𝑥, 𝑦〉 ∈ ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) ↔ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷))) | |
| 13 | 10, 11, 12 | 3bitr4i 304 | . 2 ⊢ (〈𝑥, 𝑦〉 ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ 〈𝑥, 𝑦〉 ∈ ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷))) |
| 14 | 1, 2, 13 | eqrelriiv 5740 | 1 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∩ cin 3889 〈cop 4568 × cxp 5623 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-ext 2712 ax-sep 5225 ax-pr 5369 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-ral 3055 df-rex 3065 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-opab 5142 df-xp 5631 df-rel 5632 |
| This theorem is referenced by: xpindi 5782 xpindir 5783 dmxpin 5880 xpssres 5977 xpdisj1 6119 xpdisj2 6120 imainrect 6139 xpima 6140 cnvrescnv 6153 curry1 8050 curry2 8053 fpar 8062 marypha1lem 9343 fpwwe2lem12 10563 hashxplem 14393 sscres 17788 gsumxp 19949 pjfval 21688 pjpm 21690 txbas 23557 txcls 23594 txrest 23621 trust 24219 ressuss 24252 trcfilu 24283 metreslem 24352 ressxms 24515 ressms 24516 mbfmcst 34450 0rrv 34642 poimirlem26 38020 |
| Copyright terms: Public domain | W3C validator |