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

Theorem iuncom4 4963
Description: Commutation of union with indexed union. (Contributed by Mario Carneiro, 18-Jan-2014.)
Assertion
Ref Expression
iuncom4 𝑥𝐴 𝐵 = 𝑥𝐴 𝐵

Proof of Theorem iuncom4
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-rex 3089 . . . . . . 7 (∃𝑧𝐵 𝑦𝑧 ↔ ∃𝑧(𝑧𝐵𝑦𝑧))
21rexbii 3111 . . . . . 6 (∃𝑥𝐴𝑧𝐵 𝑦𝑧 ↔ ∃𝑥𝐴𝑧(𝑧𝐵𝑦𝑧))
3 rexcom4 3291 . . . . . 6 (∃𝑥𝐴𝑧(𝑧𝐵𝑦𝑧) ↔ ∃𝑧𝑥𝐴 (𝑧𝐵𝑦𝑧))
42, 3bitri 278 . . . . 5 (∃𝑥𝐴𝑧𝐵 𝑦𝑧 ↔ ∃𝑧𝑥𝐴 (𝑧𝐵𝑦𝑧))
5 r19.41v 3194 . . . . . 6 (∃𝑥𝐴 (𝑧𝐵𝑦𝑧) ↔ (∃𝑥𝐴 𝑧𝐵𝑦𝑧))
65exbii 1881 . . . . 5 (∃𝑧𝑥𝐴 (𝑧𝐵𝑦𝑧) ↔ ∃𝑧(∃𝑥𝐴 𝑧𝐵𝑦𝑧))
74, 6bitri 278 . . . 4 (∃𝑥𝐴𝑧𝐵 𝑦𝑧 ↔ ∃𝑧(∃𝑥𝐴 𝑧𝐵𝑦𝑧))
8 eluni2 4874 . . . . 5 (𝑦 𝐵 ↔ ∃𝑧𝐵 𝑦𝑧)
98rexbii 3111 . . . 4 (∃𝑥𝐴 𝑦 𝐵 ↔ ∃𝑥𝐴𝑧𝐵 𝑦𝑧)
10 df-rex 3089 . . . . 5 (∃𝑧 𝑥𝐴 𝐵𝑦𝑧 ↔ ∃𝑧(𝑧 𝑥𝐴 𝐵𝑦𝑧))
11 eliun 4958 . . . . . . 7 (𝑧 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑧𝐵)
1211anbi1i 636 . . . . . 6 ((𝑧 𝑥𝐴 𝐵𝑦𝑧) ↔ (∃𝑥𝐴 𝑧𝐵𝑦𝑧))
1312exbii 1881 . . . . 5 (∃𝑧(𝑧 𝑥𝐴 𝐵𝑦𝑧) ↔ ∃𝑧(∃𝑥𝐴 𝑧𝐵𝑦𝑧))
1410, 13bitri 278 . . . 4 (∃𝑧 𝑥𝐴 𝐵𝑦𝑧 ↔ ∃𝑧(∃𝑥𝐴 𝑧𝐵𝑦𝑧))
157, 9, 143bitr4i 306 . . 3 (∃𝑥𝐴 𝑦 𝐵 ↔ ∃𝑧 𝑥𝐴 𝐵𝑦𝑧)
16 eliun 4958 . . 3 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑥𝐴 𝑦 𝐵)
17 eluni2 4874 . . 3 (𝑦 𝑥𝐴 𝐵 ↔ ∃𝑧 𝑥𝐴 𝐵𝑦𝑧)
1815, 16, 173bitr4i 306 . 2 (𝑦 𝑥𝐴 𝐵𝑦 𝑥𝐴 𝐵)
1918eqriv 2759 1 𝑥𝐴 𝐵 = 𝑥𝐴 𝐵
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wex 1812  wcel 2145  wrex 3088   cuni 4870   ciun 4954
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 2734
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-rex 3089  df-v 3455  df-uni 4871  df-iun 4956
This theorem is used by:  ituniiun  10427  tgidm  23206  txcmplem2  23869
  Copyright terms: Public domain W3C validator