Theorem inxp 5820

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 2176, ax-12 2213. (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.

Step	Hyp	Ref	Expression
1		relinxp 5803	. 2 ⊢ Rel ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷))
2		relxp 5681	. 2 ⊢ Rel ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷))
3		an4 668	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷)))
4		opelxp 5699	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))
5		opelxp 5699	. . . . 5 ⊢ (⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷))
6	4, 5	anbi12i 639	. . . 4 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ (𝑥 ∈ 𝐶 ∧ 𝑦 ∈ 𝐷)))
7		elin 3922	. . . . 5 ⊢ (𝑥 ∈ (𝐴 ∩ 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶))
8		elin 3922	. . . . 5 ⊢ (𝑦 ∈ (𝐵 ∩ 𝐷) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷))
9	7, 8	anbi12i 639	. . . 4 ⊢ ((𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷)) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐶) ∧ (𝑦 ∈ 𝐵 ∧ 𝑦 ∈ 𝐷)))
10	3, 6, 9	3bitr4i 306	. . 3 ⊢ ((⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)) ↔ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷)))
11		elin 3922	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ (⟨𝑥, 𝑦⟩ ∈ (𝐴 × 𝐵) ∧ ⟨𝑥, 𝑦⟩ ∈ (𝐶 × 𝐷)))
12		opelxp 5699	. . 3 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)) ↔ (𝑥 ∈ (𝐴 ∩ 𝐶) ∧ 𝑦 ∈ (𝐵 ∩ 𝐷)))
13	10, 11, 12	3bitr4i 306	. 2 ⊢ (⟨𝑥, 𝑦⟩ ∈ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) ↔ ⟨𝑥, 𝑦⟩ ∈ ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷)))
14	1, 2, 13	eqrelriiv 5778	1 ⊢ ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴 ∩ 𝐶) × (𝐵 ∩ 𝐷))

Syntax hints:   ∧ wa 400   = wceq 1570   ∈ wcel 2143   ∩ cin 3905  ⟨cop 4596   × cxp 5661

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5258  ax-pr 5406

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-sn 4591  df-pr 4593  df-op 4597  df-opab 5175  df-xp 5669  df-rel 5670

This theorem is referenced by:  xpindi  5821  xpindir  5822  dmxpin  5923  xpssres  6019  xpdisj1  6160  xpdisj2  6161  imainrect  6181  xpima  6182  cnvrescnv  6196  curry1  8100  curry2  8103  fpar  8112  marypha1lem  9394  fpwwe2lem12  10628  hashxplem  14472  sscres  17881  gsumxp  20047  pjfval  21837  pjpm  21839  txbas  23705  txcls  23742  txrest  23769  trust  24367  ressuss  24400  trcfilu  24431  metreslem  24500  ressxms  24663  ressms  24664  mbfmcst  34627  0rrv  34819  poimirlem26  38275