ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  inxp GIF version

Theorem inxp 4888
Description: The intersection of two cross products. Exercise 9 of [TakeutiZaring] p. 25. (Contributed by NM, 3-Aug-1994.) (Proof shortened by Andrew Salmon, 27-Aug-2011.)
Assertion
Ref Expression
inxp ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴𝐶) × (𝐵𝐷))

Proof of Theorem inxp
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 inopab 4886 . . 3 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∩ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝑦𝐷)}) = {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ (𝑥𝐶𝑦𝐷))}
2 an4 588 . . . . 5 (((𝑥𝐴𝑦𝐵) ∧ (𝑥𝐶𝑦𝐷)) ↔ ((𝑥𝐴𝑥𝐶) ∧ (𝑦𝐵𝑦𝐷)))
3 elin 3401 . . . . . 6 (𝑥 ∈ (𝐴𝐶) ↔ (𝑥𝐴𝑥𝐶))
4 elin 3401 . . . . . 6 (𝑦 ∈ (𝐵𝐷) ↔ (𝑦𝐵𝑦𝐷))
53, 4anbi12i 460 . . . . 5 ((𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷)) ↔ ((𝑥𝐴𝑥𝐶) ∧ (𝑦𝐵𝑦𝐷)))
62, 5bitr4i 187 . . . 4 (((𝑥𝐴𝑦𝐵) ∧ (𝑥𝐶𝑦𝐷)) ↔ (𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷)))
76opabbii 4176 . . 3 {⟨𝑥, 𝑦⟩ ∣ ((𝑥𝐴𝑦𝐵) ∧ (𝑥𝐶𝑦𝐷))} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷))}
81, 7eqtri 2253 . 2 ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∩ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝑦𝐷)}) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷))}
9 df-xp 4754 . . 3 (𝐴 × 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)}
10 df-xp 4754 . . 3 (𝐶 × 𝐷) = {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝑦𝐷)}
119, 10ineq12i 3419 . 2 ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ({⟨𝑥, 𝑦⟩ ∣ (𝑥𝐴𝑦𝐵)} ∩ {⟨𝑥, 𝑦⟩ ∣ (𝑥𝐶𝑦𝐷)})
12 df-xp 4754 . 2 ((𝐴𝐶) × (𝐵𝐷)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ (𝐴𝐶) ∧ 𝑦 ∈ (𝐵𝐷))}
138, 11, 123eqtr4i 2263 1 ((𝐴 × 𝐵) ∩ (𝐶 × 𝐷)) = ((𝐴𝐶) × (𝐵𝐷))
Colors of variables: wff set class
Syntax hints:  wa 104   = wceq 1398  wcel 2203  cin 3209  {copab 4169   × cxp 4746
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-14 2206  ax-ext 2214  ax-sep 4227  ax-pow 4286  ax-pr 4321
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ral 2525  df-rex 2526  df-v 2814  df-un 3214  df-in 3216  df-ss 3223  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-opab 4171  df-xp 4754  df-rel 4755
This theorem is referenced by:  xpindi  4889  xpindir  4890  dmxpin  4978  xpssres  5072  xpdisj1  5186  xpdisj2  5187  imainrect  5207  xpima1  5208  xpima2m  5209  hashxp  11186  txbas  15110  txrest  15128  metreslem  15232
  Copyright terms: Public domain W3C validator