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

Theorem iuniin 4665
 Description: Law combining indexed union with indexed intersection. Eq. 14 in [KuratowskiMostowski] p. 109. This theorem also appears as the last example at http://en.wikipedia.org/wiki/Union%5F%28set%5Ftheory%29. (Contributed by NM, 17-Aug-2004.) (Proof shortened by Andrew Salmon, 25-Jul-2011.)
Assertion
Ref Expression
iuniin 𝑥𝐴 𝑦𝐵 𝐶 𝑦𝐵 𝑥𝐴 𝐶
Distinct variable groups:   𝑥,𝑦   𝑦,𝐴   𝑥,𝐵
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑦)   𝐶(𝑥,𝑦)

Proof of Theorem iuniin
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 r19.12 3211 . . . 4 (∃𝑥𝐴𝑦𝐵 𝑧𝐶 → ∀𝑦𝐵𝑥𝐴 𝑧𝐶)
2 vex 3354 . . . . . 6 𝑧 ∈ V
3 eliin 4659 . . . . . 6 (𝑧 ∈ V → (𝑧 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵 𝑧𝐶))
42, 3ax-mp 5 . . . . 5 (𝑧 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵 𝑧𝐶)
54rexbii 3189 . . . 4 (∃𝑥𝐴 𝑧 𝑦𝐵 𝐶 ↔ ∃𝑥𝐴𝑦𝐵 𝑧𝐶)
6 eliun 4658 . . . . 5 (𝑧 𝑥𝐴 𝐶 ↔ ∃𝑥𝐴 𝑧𝐶)
76ralbii 3129 . . . 4 (∀𝑦𝐵 𝑧 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵𝑥𝐴 𝑧𝐶)
81, 5, 73imtr4i 281 . . 3 (∃𝑥𝐴 𝑧 𝑦𝐵 𝐶 → ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶)
9 eliun 4658 . . 3 (𝑧 𝑥𝐴 𝑦𝐵 𝐶 ↔ ∃𝑥𝐴 𝑧 𝑦𝐵 𝐶)
10 eliin 4659 . . . 4 (𝑧 ∈ V → (𝑧 𝑦𝐵 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶))
112, 10ax-mp 5 . . 3 (𝑧 𝑦𝐵 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶)
128, 9, 113imtr4i 281 . 2 (𝑧 𝑥𝐴 𝑦𝐵 𝐶𝑧 𝑦𝐵 𝑥𝐴 𝐶)
1312ssriv 3756 1 𝑥𝐴 𝑦𝐵 𝐶 𝑦𝐵 𝑥𝐴 𝐶
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∈ wcel 2145  ∀wral 3061  ∃wrex 3062  Vcvv 3351   ⊆ wss 3723  ∪ ciun 4654  ∩ ciin 4655 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1870  ax-4 1885  ax-5 1991  ax-6 2057  ax-7 2093  ax-9 2154  ax-10 2174  ax-11 2190  ax-12 2203  ax-13 2408  ax-ext 2751 This theorem depends on definitions:  df-bi 197  df-an 383  df-or 837  df-tru 1634  df-ex 1853  df-nf 1858  df-sb 2050  df-clab 2758  df-cleq 2764  df-clel 2767  df-nfc 2902  df-ral 3066  df-rex 3067  df-v 3353  df-in 3730  df-ss 3737  df-iun 4656  df-iin 4657 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator