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

Theorem iunxpf 5832
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 2918 . . . 4 Ⅎ𝑦 𝑤 ∈ 𝐶
3 iunxpf.2 . . . . 5 Ⅎ𝑧𝐶
43nfcri 2918 . . . 4 Ⅎ𝑧 𝑤 ∈ 𝐶
5 iunxpf.3 . . . . 5 Ⅎ𝑥𝐷
65nfcri 2918 . . . 4 Ⅎ𝑥 𝑤 ∈ 𝐷
7 iunxpf.4 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → 𝐶 = 𝐷)
87eleq2d 2850 . . . 4 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑤 ∈ 𝐶 ↔ 𝑤 ∈ 𝐷))
92, 4, 6, 8rexxpf 5831 . . 3 (∃𝑥 ∈ (𝐴 × 𝐵)𝑤 ∈ 𝐶 ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑤 ∈ 𝐷)
10 eliun 4958 . . 3 (𝑤 ∈ ∪ 𝑥 ∈ (𝐴 × 𝐵)𝐶 ↔ ∃𝑥 ∈ (𝐴 × 𝐵)𝑤 ∈ 𝐶)
11 eliun 4958 . . . 4 (𝑤 ∈ ∪ 𝑦 ∈ 𝐴 ∪ 𝑧 ∈ 𝐵 𝐷 ↔ ∃𝑦 ∈ 𝐴 𝑤 ∈ ∪ 𝑧 ∈ 𝐵 𝐷)
12 eliun 4958 . . . . 5 (𝑤 ∈ ∪ 𝑧 ∈ 𝐵 𝐷 ↔ ∃𝑧 ∈ 𝐵 𝑤 ∈ 𝐷)
1312rexbii 3113 . . . 4 (∃𝑦 ∈ 𝐴 𝑤 ∈ ∪ 𝑧 ∈ 𝐵 𝐷 ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑤 ∈ 𝐷)
1411, 13bitri 278 . . 3 (𝑤 ∈ ∪ 𝑦 ∈ 𝐴 ∪ 𝑧 ∈ 𝐵 𝐷 ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑤 ∈ 𝐷)
159, 10, 143bitr4i 306 . 2 (𝑤 ∈ ∪ 𝑥 ∈ (𝐴 × 𝐵)𝐶 ↔ 𝑤 ∈ ∪ 𝑦 ∈ 𝐴 ∪ 𝑧 ∈ 𝐵 𝐷)
1615eqriv 2760 1 ∪ 𝑥 ∈ (𝐴 × 𝐵)𝐶 = ∪ 𝑦 ∈ 𝐴 ∪ 𝑧 ∈ 𝐵 𝐷
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2147  Ⅎwnfc 2911  ∃wrex 3090  ⟨cop 4838  ∪ ciun 4954   × cxp 5653
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-iun 4956  df-opab 5171  df-xp 5661  df-rel 5662
This theorem is used by:  dfmpo  8140  pzriprnglem11  21827
  Copyright terms: Public domain W3C validator