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

Theorem xpiundi 5589
 Description: Distributive law for Cartesian product over indexed union. (Contributed by Mario Carneiro, 27-Apr-2014.)
Assertion
Ref Expression
xpiundi (𝐶 × 𝑥𝐴 𝐵) = 𝑥𝐴 (𝐶 × 𝐵)
Distinct variable group:   𝑥,𝐶
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem xpiundi
Dummy variables 𝑦 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rexcom 3274 . . . 4 (∃𝑤𝐶𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩ ↔ ∃𝑥𝐴𝑤𝐶𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩)
2 eliun 4885 . . . . . . . 8 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑦𝐵)
32anbi1i 627 . . . . . . 7 ((𝑦 𝑥𝐴 𝐵𝑧 = ⟨𝑤, 𝑦⟩) ↔ (∃𝑥𝐴 𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩))
43exbii 1850 . . . . . 6 (∃𝑦(𝑦 𝑥𝐴 𝐵𝑧 = ⟨𝑤, 𝑦⟩) ↔ ∃𝑦(∃𝑥𝐴 𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩))
5 df-rex 3077 . . . . . 6 (∃𝑦 𝑥𝐴 𝐵𝑧 = ⟨𝑤, 𝑦⟩ ↔ ∃𝑦(𝑦 𝑥𝐴 𝐵𝑧 = ⟨𝑤, 𝑦⟩))
6 df-rex 3077 . . . . . . . 8 (∃𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩ ↔ ∃𝑦(𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩))
76rexbii 3176 . . . . . . 7 (∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩ ↔ ∃𝑥𝐴𝑦(𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩))
8 rexcom4 3178 . . . . . . 7 (∃𝑥𝐴𝑦(𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩) ↔ ∃𝑦𝑥𝐴 (𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩))
9 r19.41v 3266 . . . . . . . 8 (∃𝑥𝐴 (𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩) ↔ (∃𝑥𝐴 𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩))
109exbii 1850 . . . . . . 7 (∃𝑦𝑥𝐴 (𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩) ↔ ∃𝑦(∃𝑥𝐴 𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩))
117, 8, 103bitri 301 . . . . . 6 (∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩ ↔ ∃𝑦(∃𝑥𝐴 𝑦𝐵𝑧 = ⟨𝑤, 𝑦⟩))
124, 5, 113bitr4i 307 . . . . 5 (∃𝑦 𝑥𝐴 𝐵𝑧 = ⟨𝑤, 𝑦⟩ ↔ ∃𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩)
1312rexbii 3176 . . . 4 (∃𝑤𝐶𝑦 𝑥𝐴 𝐵𝑧 = ⟨𝑤, 𝑦⟩ ↔ ∃𝑤𝐶𝑥𝐴𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩)
14 elxp2 5546 . . . . 5 (𝑧 ∈ (𝐶 × 𝐵) ↔ ∃𝑤𝐶𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩)
1514rexbii 3176 . . . 4 (∃𝑥𝐴 𝑧 ∈ (𝐶 × 𝐵) ↔ ∃𝑥𝐴𝑤𝐶𝑦𝐵 𝑧 = ⟨𝑤, 𝑦⟩)
161, 13, 153bitr4i 307 . . 3 (∃𝑤𝐶𝑦 𝑥𝐴 𝐵𝑧 = ⟨𝑤, 𝑦⟩ ↔ ∃𝑥𝐴 𝑧 ∈ (𝐶 × 𝐵))
17 elxp2 5546 . . 3 (𝑧 ∈ (𝐶 × 𝑥𝐴 𝐵) ↔ ∃𝑤𝐶𝑦 𝑥𝐴 𝐵𝑧 = ⟨𝑤, 𝑦⟩)
18 eliun 4885 . . 3 (𝑧 𝑥𝐴 (𝐶 × 𝐵) ↔ ∃𝑥𝐴 𝑧 ∈ (𝐶 × 𝐵))
1916, 17, 183bitr4i 307 . 2 (𝑧 ∈ (𝐶 × 𝑥𝐴 𝐵) ↔ 𝑧 𝑥𝐴 (𝐶 × 𝐵))
2019eqriv 2756 1 (𝐶 × 𝑥𝐴 𝐵) = 𝑥𝐴 (𝐶 × 𝐵)
 Colors of variables: wff setvar class Syntax hints:   ∧ wa 400   = wceq 1539  ∃wex 1782   ∈ wcel 2112  ∃wrex 3072  ⟨cop 4526  ∪ ciun 4881   × cxp 5520 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-11 2159  ax-ext 2730  ax-sep 5167  ax-nul 5174  ax-pr 5296 This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-ex 1783  df-sb 2071  df-clab 2737  df-cleq 2751  df-clel 2831  df-ral 3076  df-rex 3077  df-v 3412  df-dif 3862  df-un 3864  df-nul 4227  df-if 4419  df-sn 4521  df-pr 4523  df-op 4527  df-iun 4883  df-opab 5093  df-xp 5528 This theorem is referenced by:  xpexgALT  7684  txbasval  22296  txcmplem2  22332  xkoinjcn  22377  cvmlift2lem12  32782
 Copyright terms: Public domain W3C validator