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

Theorem iunxiun 5057
Description: Separate an indexed union in the index of an indexed union. (Contributed by Mario Carneiro, 5-Dec-2016.)
Assertion
Ref Expression
iunxiun ∪ 𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵𝐶 = ∪ 𝑦 ∈ 𝐴 ∪ 𝑥 ∈ 𝐵 𝐶
Distinct variable groups:   𝑥,𝑦   𝑥,𝐴   𝑦,𝐶
Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑥, 𝑦)   𝐶(𝑥)

Proof of Theorem iunxiun
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eliun 4955 . . . . . . . 8 (𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵 ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ 𝐵)
21anbi1i 636 . . . . . . 7 ((𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵 ∧ 𝑧 ∈ 𝐶) ↔ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
3 r19.41v 3193 . . . . . . 7 (∃𝑦 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ↔ (∃𝑦 ∈ 𝐴 𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
42, 3bitr4i 281 . . . . . 6 ((𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵 ∧ 𝑧 ∈ 𝐶) ↔ ∃𝑦 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
54exbii 1881 . . . . 5 (∃𝑥(𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵 ∧ 𝑧 ∈ 𝐶) ↔ ∃𝑥∃𝑦 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
6 rexcom4 3290 . . . . 5 (∃𝑦 ∈ 𝐴 ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶) ↔ ∃𝑥∃𝑦 ∈ 𝐴 (𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
75, 6bitr4i 281 . . . 4 (∃𝑥(𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵 ∧ 𝑧 ∈ 𝐶) ↔ ∃𝑦 ∈ 𝐴 ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
8 df-rex 3088 . . . 4 (∃𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵𝑧 ∈ 𝐶 ↔ ∃𝑥(𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵 ∧ 𝑧 ∈ 𝐶))
9 eliun 4955 . . . . . 6 (𝑧 ∈ ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∃𝑥 ∈ 𝐵 𝑧 ∈ 𝐶)
10 df-rex 3088 . . . . . 6 (∃𝑥 ∈ 𝐵 𝑧 ∈ 𝐶 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
119, 10bitri 278 . . . . 5 (𝑧 ∈ ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
1211rexbii 3110 . . . 4 (∃𝑦 ∈ 𝐴 𝑧 ∈ ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∃𝑦 ∈ 𝐴 ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝑧 ∈ 𝐶))
137, 8, 123bitr4i 306 . . 3 (∃𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵𝑧 ∈ 𝐶 ↔ ∃𝑦 ∈ 𝐴 𝑧 ∈ ∪ 𝑥 ∈ 𝐵 𝐶)
14 eliun 4955 . . 3 (𝑧 ∈ ∪ 𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵𝐶 ↔ ∃𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵𝑧 ∈ 𝐶)
15 eliun 4955 . . 3 (𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ∪ 𝑥 ∈ 𝐵 𝐶 ↔ ∃𝑦 ∈ 𝐴 𝑧 ∈ ∪ 𝑥 ∈ 𝐵 𝐶)
1613, 14, 153bitr4i 306 . 2 (𝑧 ∈ ∪ 𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵𝐶 ↔ 𝑧 ∈ ∪ 𝑦 ∈ 𝐴 ∪ 𝑥 ∈ 𝐵 𝐶)
1716eqriv 2758 1 ∪ 𝑥 ∈ ∪ 𝑦 ∈ 𝐴 𝐵𝐶 = ∪ 𝑦 ∈ 𝐴 ∪ 𝑥 ∈ 𝐵 𝐶
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∃wrex 3087  ∪ ciun 4951
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-11 2194  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-rex 3088  df-v 3453  df-iun 4953
This theorem is used by:  ttciun  37272
  Copyright terms: Public domain W3C validator