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

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

Proof of Theorem xpiundir
Dummy variables 𝑦 𝑤 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rexcom4 3249 . . . . 5 (∃𝑥𝐴𝑦(𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩) ↔ ∃𝑦𝑥𝐴 (𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩))
2 df-rex 3144 . . . . . 6 (∃𝑦𝐵𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩ ↔ ∃𝑦(𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩))
32rexbii 3247 . . . . 5 (∃𝑥𝐴𝑦𝐵𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩ ↔ ∃𝑥𝐴𝑦(𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩))
4 eliun 4915 . . . . . . . 8 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑦𝐵)
54anbi1i 625 . . . . . . 7 ((𝑦 𝑥𝐴 𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩) ↔ (∃𝑥𝐴 𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩))
6 r19.41v 3347 . . . . . . 7 (∃𝑥𝐴 (𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩) ↔ (∃𝑥𝐴 𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩))
75, 6bitr4i 280 . . . . . 6 ((𝑦 𝑥𝐴 𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩) ↔ ∃𝑥𝐴 (𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩))
87exbii 1844 . . . . 5 (∃𝑦(𝑦 𝑥𝐴 𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩) ↔ ∃𝑦𝑥𝐴 (𝑦𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩))
91, 3, 83bitr4ri 306 . . . 4 (∃𝑦(𝑦 𝑥𝐴 𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩) ↔ ∃𝑥𝐴𝑦𝐵𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩)
10 df-rex 3144 . . . 4 (∃𝑦 𝑥𝐴 𝐵𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩ ↔ ∃𝑦(𝑦 𝑥𝐴 𝐵 ∧ ∃𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩))
11 elxp2 5573 . . . . 5 (𝑧 ∈ (𝐵 × 𝐶) ↔ ∃𝑦𝐵𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩)
1211rexbii 3247 . . . 4 (∃𝑥𝐴 𝑧 ∈ (𝐵 × 𝐶) ↔ ∃𝑥𝐴𝑦𝐵𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩)
139, 10, 123bitr4i 305 . . 3 (∃𝑦 𝑥𝐴 𝐵𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩ ↔ ∃𝑥𝐴 𝑧 ∈ (𝐵 × 𝐶))
14 elxp2 5573 . . 3 (𝑧 ∈ ( 𝑥𝐴 𝐵 × 𝐶) ↔ ∃𝑦 𝑥𝐴 𝐵𝑤𝐶 𝑧 = ⟨𝑦, 𝑤⟩)
15 eliun 4915 . . 3 (𝑧 𝑥𝐴 (𝐵 × 𝐶) ↔ ∃𝑥𝐴 𝑧 ∈ (𝐵 × 𝐶))
1613, 14, 153bitr4i 305 . 2 (𝑧 ∈ ( 𝑥𝐴 𝐵 × 𝐶) ↔ 𝑧 𝑥𝐴 (𝐵 × 𝐶))
1716eqriv 2818 1 ( 𝑥𝐴 𝐵 × 𝐶) = 𝑥𝐴 (𝐵 × 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wa 398   = wceq 1533  wex 1776  wcel 2110  wrex 3139  cop 4566   ciun 4911   × cxp 5547
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pr 5321
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-v 3496  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-sn 4561  df-pr 4563  df-op 4567  df-iun 4913  df-opab 5121  df-xp 5555
This theorem is referenced by:  iunxpconst  5618  resiun2  5868  txbasval  22208  txtube  22242  txcmplem1  22243  ovoliunlem1  24097
  Copyright terms: Public domain W3C validator