Theorem inxp 4864

Description: The intersection of two cross products. Exercise 9 of [TakeutiZaring] p. 25. (The proof was shortened by Andrew Salmon, 27-Aug-2011.) (Contributed by NM, 3-Aug-1994.) (Revised by set.mm contributors, 27-Aug-2011.)

Assertion

Ref	Expression
inxp	⊢ ((A × B) ∩ (C × D)) = ((A ∩ C) × (B ∩ D))

Proof of Theorem inxp

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		inopab 4863	. . 3 ⊢ ({⟨x, y⟩ ∣ (x ∈ A ∧ y ∈ B)} ∩ {⟨x, y⟩ ∣ (x ∈ C ∧ y ∈ D)}) = {⟨x, y⟩ ∣ ((x ∈ A ∧ y ∈ B) ∧ (x ∈ C ∧ y ∈ D))}
2		an4 797	. . . . 5 ⊢ (((x ∈ A ∧ y ∈ B) ∧ (x ∈ C ∧ y ∈ D)) ↔ ((x ∈ A ∧ x ∈ C) ∧ (y ∈ B ∧ y ∈ D)))
3		elin 3220	. . . . . 6 ⊢ (x ∈ (A ∩ C) ↔ (x ∈ A ∧ x ∈ C))
4		elin 3220	. . . . . 6 ⊢ (y ∈ (B ∩ D) ↔ (y ∈ B ∧ y ∈ D))
5	3, 4	anbi12i 678	. . . . 5 ⊢ ((x ∈ (A ∩ C) ∧ y ∈ (B ∩ D)) ↔ ((x ∈ A ∧ x ∈ C) ∧ (y ∈ B ∧ y ∈ D)))
6	2, 5	bitr4i 243	. . . 4 ⊢ (((x ∈ A ∧ y ∈ B) ∧ (x ∈ C ∧ y ∈ D)) ↔ (x ∈ (A ∩ C) ∧ y ∈ (B ∩ D)))
7	6	opabbii 4627	. . 3 ⊢ {⟨x, y⟩ ∣ ((x ∈ A ∧ y ∈ B) ∧ (x ∈ C ∧ y ∈ D))} = {⟨x, y⟩ ∣ (x ∈ (A ∩ C) ∧ y ∈ (B ∩ D))}
8	1, 7	eqtri 2373	. 2 ⊢ ({⟨x, y⟩ ∣ (x ∈ A ∧ y ∈ B)} ∩ {⟨x, y⟩ ∣ (x ∈ C ∧ y ∈ D)}) = {⟨x, y⟩ ∣ (x ∈ (A ∩ C) ∧ y ∈ (B ∩ D))}
9		df-xp 4785	. . 3 ⊢ (A × B) = {⟨x, y⟩ ∣ (x ∈ A ∧ y ∈ B)}
10		df-xp 4785	. . 3 ⊢ (C × D) = {⟨x, y⟩ ∣ (x ∈ C ∧ y ∈ D)}
11	9, 10	ineq12i 3456	. 2 ⊢ ((A × B) ∩ (C × D)) = ({⟨x, y⟩ ∣ (x ∈ A ∧ y ∈ B)} ∩ {⟨x, y⟩ ∣ (x ∈ C ∧ y ∈ D)})
12		df-xp 4785	. 2 ⊢ ((A ∩ C) × (B ∩ D)) = {⟨x, y⟩ ∣ (x ∈ (A ∩ C) ∧ y ∈ (B ∩ D))}
13	8, 11, 12	3eqtr4i 2383	1 ⊢ ((A × B) ∩ (C × D)) = ((A ∩ C) × (B ∩ D))

Syntax hints:   ∧ wa 358   = wceq 1642   ∈ wcel 1710   ∩ cin 3209  {copab 4623   × cxp 4771

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-13 1712  ax-14 1714  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1925  ax-ext 2334  ax-nin 4079  ax-xp 4080  ax-cnv 4081  ax-1c 4082  ax-sset 4083  ax-si 4084  ax-ins2 4085  ax-ins3 4086  ax-typlower 4087  ax-sn 4088

This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3or 935  df-3an 936  df-nan 1288  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-eu 2208  df-mo 2209  df-clab 2340  df-cleq 2346  df-clel 2349  df-nfc 2479  df-ne 2519  df-ral 2620  df-rex 2621  df-reu 2622  df-rmo 2623  df-rab 2624  df-v 2862  df-sbc 3048  df-nin 3212  df-compl 3213  df-in 3214  df-un 3215  df-dif 3216  df-symdif 3217  df-ss 3260  df-pss 3262  df-nul 3552  df-if 3664  df-pw 3725  df-sn 3742  df-pr 3743  df-uni 3893  df-int 3928  df-opk 4059  df-1c 4137  df-pw1 4138  df-uni1 4139  df-xpk 4186  df-cnvk 4187  df-ins2k 4188  df-ins3k 4189  df-imak 4190  df-cok 4191  df-p6 4192  df-sik 4193  df-ssetk 4194  df-imagek 4195  df-idk 4196  df-iota 4340  df-0c 4378  df-addc 4379  df-nnc 4380  df-fin 4381  df-lefin 4441  df-ltfin 4442  df-ncfin 4443  df-tfin 4444  df-evenfin 4445  df-oddfin 4446  df-sfin 4447  df-spfin 4448  df-phi 4566  df-op 4567  df-proj1 4568  df-proj2 4569  df-opab 4624  df-br 4641  df-xp 4785

This theorem is referenced by:  xpindi  4865  xpindir  4866  dmxpin  4926  xpdisj1  5048  xpdisj2  5049