MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  inxp Structured version   Visualization version   GIF version

Theorem inxp 5823
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 2179, ax-12 2216. (Revised by SN, 5-May-2025.)
Assertion
Ref Expression
inxp ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴𝐶) × (𝐵𝐷))

Proof of Theorem inxp
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 relinxp 5806 . 2 Rel ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷))
2 relxp 5684 . 2 Rel ((𝐴𝐶) × (𝐵𝐷))
3 an4 669 . . . 4 (((𝑥𝐴𝑦𝐵) ∧ (𝑥𝐶𝑦𝐷)) ↔ ((𝑥𝐴𝑥𝐶) ∧ (𝑦𝐵𝑦𝐷)))
4 opelxp 5702 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
5 opelxp 5702 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷) ↔ (𝑥𝐶𝑦𝐷))
64, 5anbi12i 640 . . . 4 ((⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)) ↔ ((𝑥𝐴𝑦𝐵) ∧ (𝑥𝐶𝑦𝐷)))
7 elin 3924 . . . . 5 (𝑥 ∈ (𝐴𝐶) ↔ (𝑥𝐴𝑥𝐶))
8 elin 3924 . . . . 5 (𝑦 ∈ (𝐵𝐷) ↔ (𝑦𝐵𝑦𝐷))
97, 8anbi12i 640 . . . 4 ((𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷)) ↔ ((𝑥𝐴𝑥𝐶) ∧ (𝑦𝐵𝑦𝐷)))
103, 6, 93bitr4i 306 . . 3 ((⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)) ↔ (𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷)))
11 elin 3924 . . 3 (⟨𝑥, 𝑦⟩ ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)))
12 opelxp 5702 . . 3 (⟨𝑥, 𝑦⟩ ∈ ((𝐴𝐶) × (𝐵𝐷)) ↔ (𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷)))
1310, 11, 123bitr4i 306 . 2 (⟨𝑥, 𝑦⟩ ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ ⟨𝑥, 𝑦⟩ ∈ ((𝐴𝐶) × (𝐵𝐷)))
141, 2, 13eqrelriiv 5781 1 ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴𝐶) × (𝐵𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wcel 2146  cin 3907  cop 4600   × cxp 5664
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738  ax-sep 5262  ax-pr 5409
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-opab 5179  df-xp 5672  df-rel 5673
This theorem is used by:  xpindi  5824  xpindir  5825  dmxpin  5926  xpssres  6022  xpdisj1  6163  xpdisj2  6164  imainrect  6184  xpima  6185  cnvrescnv  6199  curry1  8108  curry2  8111  fpar  8120  marypha1lem  9403  fpwwe2lem12  10645  hashxplem  14490  sscres  17905  gsumxp  20077  pjfval  21893  pjpm  21895  txbas  23761  txcls  23798  txrest  23825  trust  24423  ressuss  24456  trcfilu  24487  metreslem  24556  ressxms  24719  ressms  24720  mbfmcst  34681  0rrv  34873  poimirlem26  38338
  Copyright terms: Public domain W3C validator