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

Theorem xpcogend 13561
Description: The most interesting case of the composition of two cross products. (Contributed by RP, 24-Dec-2019.)
Hypothesis
Ref Expression
xpcogend.1 (𝜑 → (𝐵𝐶) ≠ ∅)
Assertion
Ref Expression
xpcogend (𝜑 → ((𝐶 × 𝐷) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐷))

Proof of Theorem xpcogend
Dummy variables 𝑥 𝑧 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xpcogend.1 . . . . . 6 (𝜑 → (𝐵𝐶) ≠ ∅)
2 n0 3890 . . . . . . 7 ((𝐵𝐶) ≠ ∅ ↔ ∃𝑦 𝑦 ∈ (𝐵𝐶))
3 elin 3758 . . . . . . . 8 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦𝐶))
43exbii 1764 . . . . . . 7 (∃𝑦 𝑦 ∈ (𝐵𝐶) ↔ ∃𝑦(𝑦𝐵𝑦𝐶))
52, 4bitri 263 . . . . . 6 ((𝐵𝐶) ≠ ∅ ↔ ∃𝑦(𝑦𝐵𝑦𝐶))
61, 5sylib 207 . . . . 5 (𝜑 → ∃𝑦(𝑦𝐵𝑦𝐶))
76biantrud 527 . . . 4 (𝜑 → ((𝑥𝐴𝑧𝐷) ↔ ((𝑥𝐴𝑧𝐷) ∧ ∃𝑦(𝑦𝐵𝑦𝐶))))
8 brxp 5071 . . . . . . 7 (𝑥(𝐴 × 𝐵)𝑦 ↔ (𝑥𝐴𝑦𝐵))
9 brxp 5071 . . . . . . . 8 (𝑦(𝐶 × 𝐷)𝑧 ↔ (𝑦𝐶𝑧𝐷))
10 ancom 465 . . . . . . . 8 ((𝑦𝐶𝑧𝐷) ↔ (𝑧𝐷𝑦𝐶))
119, 10bitri 263 . . . . . . 7 (𝑦(𝐶 × 𝐷)𝑧 ↔ (𝑧𝐷𝑦𝐶))
128, 11anbi12i 729 . . . . . 6 ((𝑥(𝐴 × 𝐵)𝑦𝑦(𝐶 × 𝐷)𝑧) ↔ ((𝑥𝐴𝑦𝐵) ∧ (𝑧𝐷𝑦𝐶)))
1312exbii 1764 . . . . 5 (∃𝑦(𝑥(𝐴 × 𝐵)𝑦𝑦(𝐶 × 𝐷)𝑧) ↔ ∃𝑦((𝑥𝐴𝑦𝐵) ∧ (𝑧𝐷𝑦𝐶)))
14 an4 861 . . . . . 6 (((𝑥𝐴𝑦𝐵) ∧ (𝑧𝐷𝑦𝐶)) ↔ ((𝑥𝐴𝑧𝐷) ∧ (𝑦𝐵𝑦𝐶)))
1514exbii 1764 . . . . 5 (∃𝑦((𝑥𝐴𝑦𝐵) ∧ (𝑧𝐷𝑦𝐶)) ↔ ∃𝑦((𝑥𝐴𝑧𝐷) ∧ (𝑦𝐵𝑦𝐶)))
16 19.42v 1905 . . . . 5 (∃𝑦((𝑥𝐴𝑧𝐷) ∧ (𝑦𝐵𝑦𝐶)) ↔ ((𝑥𝐴𝑧𝐷) ∧ ∃𝑦(𝑦𝐵𝑦𝐶)))
1713, 15, 163bitri 285 . . . 4 (∃𝑦(𝑥(𝐴 × 𝐵)𝑦𝑦(𝐶 × 𝐷)𝑧) ↔ ((𝑥𝐴𝑧𝐷) ∧ ∃𝑦(𝑦𝐵𝑦𝐶)))
187, 17syl6rbbr 278 . . 3 (𝜑 → (∃𝑦(𝑥(𝐴 × 𝐵)𝑦𝑦(𝐶 × 𝐷)𝑧) ↔ (𝑥𝐴𝑧𝐷)))
1918opabbidv 4648 . 2 (𝜑 → {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦𝑦(𝐶 × 𝐷)𝑧)} = {⟨𝑥, 𝑧⟩ ∣ (𝑥𝐴𝑧𝐷)})
20 df-co 5047 . 2 ((𝐶 × 𝐷) ∘ (𝐴 × 𝐵)) = {⟨𝑥, 𝑧⟩ ∣ ∃𝑦(𝑥(𝐴 × 𝐵)𝑦𝑦(𝐶 × 𝐷)𝑧)}
21 df-xp 5044 . 2 (𝐴 × 𝐷) = {⟨𝑥, 𝑧⟩ ∣ (𝑥𝐴𝑧𝐷)}
2219, 20, 213eqtr4g 2669 1 (𝜑 → ((𝐶 × 𝐷) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐷))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383   = wceq 1475  wex 1695  wcel 1977  wne 2780  cin 3539  c0 3874   class class class wbr 4583  {copab 4642   × cxp 5036  ccom 5042
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pr 4833
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-opab 4644  df-xp 5044  df-co 5047
This theorem is referenced by:  xpcoidgend  13562
  Copyright terms: Public domain W3C validator