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

Theorem xpcom 5334
Description: Composition of two cross products. (Contributed by Jim Kingdon, 20-Dec-2018.)
Assertion
Ref Expression
xpcom (∃𝑥 𝑥 ∈ 𝐵 → ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐶))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐶

Proof of Theorem xpcom
Dummy variables 𝑎 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 ibar 301 . . . 4 (∃𝑥 𝑥 ∈ 𝐵 → ((𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶) ↔ (∃𝑥 𝑥 ∈ 𝐵 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶))))
2 ancom 266 . . . . . . . 8 ((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ↔ (𝑥 ∈ 𝐵 ∧ 𝑎 ∈ 𝐴))
32anbi1i 462 . . . . . . 7 (((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑎 ∈ 𝐴) ∧ (𝑥 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)))
4 brxp 4805 . . . . . . . 8 (𝑎(𝐴 × 𝐵)𝑥 ↔ (𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵))
5 brxp 4805 . . . . . . . 8 (𝑥(𝐵 × 𝐶)𝑐 ↔ (𝑥 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶))
64, 5anbi12i 464 . . . . . . 7 ((𝑎(𝐴 × 𝐵)𝑥 ∧ 𝑥(𝐵 × 𝐶)𝑐) ↔ ((𝑎 ∈ 𝐴 ∧ 𝑥 ∈ 𝐵) ∧ (𝑥 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)))
7 anandi 598 . . . . . . 7 ((𝑥 ∈ 𝐵 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ↔ ((𝑥 ∈ 𝐵 ∧ 𝑎 ∈ 𝐴) ∧ (𝑥 ∈ 𝐵 ∧ 𝑐 ∈ 𝐶)))
83, 6, 73bitr4i 212 . . . . . 6 ((𝑎(𝐴 × 𝐵)𝑥 ∧ 𝑥(𝐵 × 𝐶)𝑐) ↔ (𝑥 ∈ 𝐵 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)))
98exbii 1658 . . . . 5 (∃𝑥(𝑎(𝐴 × 𝐵)𝑥 ∧ 𝑥(𝐵 × 𝐶)𝑐) ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)))
10 19.41v 1958 . . . . 5 (∃𝑥(𝑥 ∈ 𝐵 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ↔ (∃𝑥 𝑥 ∈ 𝐵 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)))
119, 10bitr2i 185 . . . 4 ((∃𝑥 𝑥 ∈ 𝐵 ∧ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)) ↔ ∃𝑥(𝑎(𝐴 × 𝐵)𝑥 ∧ 𝑥(𝐵 × 𝐶)𝑐))
121, 11bitr2di 197 . . 3 (∃𝑥 𝑥 ∈ 𝐵 → (∃𝑥(𝑎(𝐴 × 𝐵)𝑥 ∧ 𝑥(𝐵 × 𝐶)𝑐) ↔ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)))
1312opabbidv 4197 . 2 (∃𝑥 𝑥 ∈ 𝐵 → {⟨𝑎, 𝑐⟩ ∣ ∃𝑥(𝑎(𝐴 × 𝐵)𝑥 ∧ 𝑥(𝐵 × 𝐶)𝑐)} = {⟨𝑎, 𝑐⟩ ∣ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)})
14 df-co 4783 . 2 ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = {⟨𝑎, 𝑐⟩ ∣ ∃𝑥(𝑎(𝐴 × 𝐵)𝑥 ∧ 𝑥(𝐵 × 𝐶)𝑐)}
15 df-xp 4780 . 2 (𝐴 × 𝐶) = {⟨𝑎, 𝑐⟩ ∣ (𝑎 ∈ 𝐴 ∧ 𝑐 ∈ 𝐶)}
1613, 14, 153eqtr4g 2296 1 (∃𝑥 𝑥 ∈ 𝐵 → ((𝐵 × 𝐶) ∘ (𝐴 × 𝐵)) = (𝐴 × 𝐶))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402  ∃wex 1545   ∈ wcel 2209   class class class wbr 4130  {copab 4191   × cxp 4772   ∘ ccom 4778
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-co 4783
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator