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

Theorem iunxpf 5833
Description: Indexed union on a Cartesian product equals a double indexed union. The hypothesis specifies an implicit substitution. (Contributed by NM, 19-Dec-2008.)
Hypotheses
Ref Expression
iunxpf.1 𝑦𝐶
iunxpf.2 𝑧𝐶
iunxpf.3 𝑥𝐷
iunxpf.4 (𝑥 = ⟨𝑦, 𝑧⟩ → 𝐶 = 𝐷)
Assertion
Ref Expression
iunxpf 𝑥 ∈ (𝐴 × 𝐵)𝐶 = 𝑦𝐴 𝑧𝐵 𝐷
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑧,𝐵,𝑦
Allowed substitution hints:   𝐴(𝑧)   𝐶(𝑥, 𝑦, 𝑧)   𝐷(𝑥, 𝑦, 𝑧)

Proof of Theorem iunxpf
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 iunxpf.1 . . . . 5 𝑦𝐶
21nfcri 2916 . . . 4 𝑦 𝑤𝐶
3 iunxpf.2 . . . . 5 𝑧𝐶
43nfcri 2916 . . . 4 𝑧 𝑤𝐶
5 iunxpf.3 . . . . 5 𝑥𝐷
65nfcri 2916 . . . 4 𝑥 𝑤𝐷
7 iunxpf.4 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → 𝐶 = 𝐷)
87eleq2d 2848 . . . 4 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑤𝐶𝑤𝐷))
92, 4, 6, 8rexxpf 5832 . . 3 (∃𝑥 ∈ (𝐴 × 𝐵)𝑤𝐶 ↔ ∃𝑦𝐴𝑧𝐵 𝑤𝐷)
10 eliun 4959 . . 3 (𝑤 𝑥 ∈ (𝐴 × 𝐵)𝐶 ↔ ∃𝑥 ∈ (𝐴 × 𝐵)𝑤𝐶)
11 eliun 4959 . . . 4 (𝑤 𝑦𝐴 𝑧𝐵 𝐷 ↔ ∃𝑦𝐴 𝑤 𝑧𝐵 𝐷)
12 eliun 4959 . . . . 5 (𝑤 𝑧𝐵 𝐷 ↔ ∃𝑧𝐵 𝑤𝐷)
1312rexbii 3111 . . . 4 (∃𝑦𝐴 𝑤 𝑧𝐵 𝐷 ↔ ∃𝑦𝐴𝑧𝐵 𝑤𝐷)
1411, 13bitri 278 . . 3 (𝑤 𝑦𝐴 𝑧𝐵 𝐷 ↔ ∃𝑦𝐴𝑧𝐵 𝑤𝐷)
159, 10, 143bitr4i 306 . 2 (𝑤 𝑥 ∈ (𝐴 × 𝐵)𝐶𝑤 𝑦𝐴 𝑧𝐵 𝐷)
1615eqriv 2759 1 𝑥 ∈ (𝐴 × 𝐵)𝐶 = 𝑦𝐴 𝑧𝐵 𝐷
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1569  wcel 2142  wnfc 2909  wrex 3088  cop 4594   ciun 4955   × cxp 5658
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pr 5403
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-sn 4589  df-pr 4591  df-op 4595  df-iun 4957  df-opab 5173  df-xp 5666  df-rel 5667
This theorem is used by:  dfmpo  8095  pzriprnglem11  21652
  Copyright terms: Public domain W3C validator