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

Theorem inxp 5816
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 2178, ax-12 2215. (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 5799 . 2 Rel ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷))
2 relxp 5677 . 2 Rel ((𝐴𝐶) × (𝐵𝐷))
3 an4 669 . . . 4 (((𝑥𝐴𝑦𝐵) ∧ (𝑥𝐶𝑦𝐷)) ↔ ((𝑥𝐴𝑥𝐶) ∧ (𝑦𝐵𝑦𝐷)))
4 opelxp 5695 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥𝐴𝑦𝐵))
5 opelxp 5695 . . . . 5 (⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷) ↔ (𝑥𝐶𝑦𝐷))
64, 5anbi12i 640 . . . 4 ((⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)) ↔ ((𝑥𝐴𝑦𝐵) ∧ (𝑥𝐶𝑦𝐷)))
7 elin 3918 . . . . 5 (𝑥 ∈ (𝐴𝐶) ↔ (𝑥𝐴𝑥𝐶))
8 elin 3918 . . . . 5 (𝑦 ∈ (𝐵𝐷) ↔ (𝑦𝐵𝑦𝐷))
97, 8anbi12i 640 . . . 4 ((𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷)) ↔ ((𝑥𝐴𝑥𝐶) ∧ (𝑦𝐵𝑦𝐷)))
103, 6, 93bitr4i 306 . . 3 ((⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)) ↔ (𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷)))
11 elin 3918 . . 3 (⟨𝑥, 𝑦⟩ ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)))
12 opelxp 5695 . . 3 (⟨𝑥, 𝑦⟩ ∈ ((𝐴𝐶) × (𝐵𝐷)) ↔ (𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷)))
1310, 11, 123bitr4i 306 . 2 (⟨𝑥, 𝑦⟩ ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ ⟨𝑥, 𝑦⟩ ∈ ((𝐴𝐶) × (𝐵𝐷)))
141, 2, 13eqrelriiv 5774 1 ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴𝐶) × (𝐵𝐷))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wcel 2145  cin 3901  cop 4593   × cxp 5657
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 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402
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 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-opab 5172  df-xp 5665  df-rel 5666
This theorem is used by:  xpindi  5817  xpindir  5818  dmxpin  5919  xpssres  6015  xpdisj1  6157  xpdisj2  6158  imainrect  6178  xpima  6179  cnvrescnv  6193  curry1  8105  curry2  8108  fpar  8117  marypha1lem  9407  fpwwe2lem12  10655  hashxplem  14502  sscres  17918  gsumxp  20109  pjfval  21925  pjpm  21927  txbas  23799  txcls  23836  txrest  23863  trust  24461  ressuss  24494  trcfilu  24525  metreslem  24594  ressxms  24757  ressms  24758  mbfmcst  34778  0rrv  34970  poimirlem26  38403
  Copyright terms: Public domain W3C validator