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

Theorem iuniin 4467
 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 3045 . . . 4 (∃𝑥𝐴𝑦𝐵 𝑧𝐶 → ∀𝑦𝐵𝑥𝐴 𝑧𝐶)
2 vex 3176 . . . . . 6 𝑧 ∈ V
3 eliin 4461 . . . . . 6 (𝑧 ∈ V → (𝑧 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵 𝑧𝐶))
42, 3ax-mp 5 . . . . 5 (𝑧 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵 𝑧𝐶)
54rexbii 3023 . . . 4 (∃𝑥𝐴 𝑧 𝑦𝐵 𝐶 ↔ ∃𝑥𝐴𝑦𝐵 𝑧𝐶)
6 eliun 4460 . . . . 5 (𝑧 𝑥𝐴 𝐶 ↔ ∃𝑥𝐴 𝑧𝐶)
76ralbii 2963 . . . 4 (∀𝑦𝐵 𝑧 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵𝑥𝐴 𝑧𝐶)
81, 5, 73imtr4i 280 . . 3 (∃𝑥𝐴 𝑧 𝑦𝐵 𝐶 → ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶)
9 eliun 4460 . . 3 (𝑧 𝑥𝐴 𝑦𝐵 𝐶 ↔ ∃𝑥𝐴 𝑧 𝑦𝐵 𝐶)
10 eliin 4461 . . . 4 (𝑧 ∈ V → (𝑧 𝑦𝐵 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶))
112, 10ax-mp 5 . . 3 (𝑧 𝑦𝐵 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶)
128, 9, 113imtr4i 280 . 2 (𝑧 𝑥𝐴 𝑦𝐵 𝐶𝑧 𝑦𝐵 𝑥𝐴 𝐶)
1312ssriv 3572 1 𝑥𝐴 𝑦𝐵 𝐶 𝑦𝐵 𝑥𝐴 𝐶
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 195   ∈ wcel 1977  ∀wral 2896  ∃wrex 2897  Vcvv 3173   ⊆ wss 3540  ∪ ciun 4455  ∩ ciin 4456 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ral 2901  df-rex 2902  df-v 3175  df-in 3547  df-ss 3554  df-iun 4457  df-iin 4458 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator