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

Theorem iunxpf 5822
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 2914 . . . 4 Ⅎ𝑦 𝑤 ∈ 𝐶
3 iunxpf.2 . . . . 5 Ⅎ𝑧𝐶
43nfcri 2914 . . . 4 Ⅎ𝑧 𝑤 ∈ 𝐶
5 iunxpf.3 . . . . 5 Ⅎ𝑥𝐷
65nfcri 2914 . . . 4 Ⅎ𝑥 𝑤 ∈ 𝐷
7 iunxpf.4 . . . . 5 (𝑥 = ⟨𝑦, 𝑧⟩ → 𝐶 = 𝐷)
87eleq2d 2846 . . . 4 (𝑥 = ⟨𝑦, 𝑧⟩ → (𝑤 ∈ 𝐶 ↔ 𝑤 ∈ 𝐷))
92, 4, 6, 8rexxpf 5821 . . 3 (∃𝑥 ∈ (𝐴 × 𝐵)𝑤 ∈ 𝐶 ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑤 ∈ 𝐷)
10 eliun 4954 . . 3 (𝑤 ∈ ∪ 𝑥 ∈ (𝐴 × 𝐵)𝐶 ↔ ∃𝑥 ∈ (𝐴 × 𝐵)𝑤 ∈ 𝐶)
11 eliun 4954 . . . 4 (𝑤 ∈ ∪ 𝑦 ∈ 𝐴 ∪ 𝑧 ∈ 𝐵 𝐷 ↔ ∃𝑦 ∈ 𝐴 𝑤 ∈ ∪ 𝑧 ∈ 𝐵 𝐷)
12 eliun 4954 . . . . 5 (𝑤 ∈ ∪ 𝑧 ∈ 𝐵 𝐷 ↔ ∃𝑧 ∈ 𝐵 𝑤 ∈ 𝐷)
1312rexbii 3109 . . . 4 (∃𝑦 ∈ 𝐴 𝑤 ∈ ∪ 𝑧 ∈ 𝐵 𝐷 ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑤 ∈ 𝐷)
1411, 13bitri 278 . . 3 (𝑤 ∈ ∪ 𝑦 ∈ 𝐴 ∪ 𝑧 ∈ 𝐵 𝐷 ↔ ∃𝑦 ∈ 𝐴 ∃𝑧 ∈ 𝐵 𝑤 ∈ 𝐷)
159, 10, 143bitr4i 306 . 2 (𝑤 ∈ ∪ 𝑥 ∈ (𝐴 × 𝐵)𝐶 ↔ 𝑤 ∈ ∪ 𝑦 ∈ 𝐴 ∪ 𝑧 ∈ 𝐵 𝐷)
1615eqriv 2757 1 ∪ 𝑥 ∈ (𝐴 × 𝐵)𝐶 = ∪ 𝑦 ∈ 𝐴 ∪ 𝑧 ∈ 𝐵 𝐷
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2907  ∃wrex 3086  ⟨cop 4589  ∪ ciun 4950   × cxp 5645
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-pr 5390
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 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-iun 4952  df-opab 5167  df-xp 5653  df-rel 5654
This theorem is used by:  dfmpo  8096  pzriprnglem11  21758
  Copyright terms: Public domain W3C validator