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

Theorem iuniin 4719
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 3242 . . . 4 (∃𝑥𝐴𝑦𝐵 𝑧𝐶 → ∀𝑦𝐵𝑥𝐴 𝑧𝐶)
2 vex 3386 . . . . . 6 𝑧 ∈ V
3 eliin 4713 . . . . . 6 (𝑧 ∈ V → (𝑧 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵 𝑧𝐶))
42, 3ax-mp 5 . . . . 5 (𝑧 𝑦𝐵 𝐶 ↔ ∀𝑦𝐵 𝑧𝐶)
54rexbii 3220 . . . 4 (∃𝑥𝐴 𝑧 𝑦𝐵 𝐶 ↔ ∃𝑥𝐴𝑦𝐵 𝑧𝐶)
6 eliun 4712 . . . . 5 (𝑧 𝑥𝐴 𝐶 ↔ ∃𝑥𝐴 𝑧𝐶)
76ralbii 3159 . . . 4 (∀𝑦𝐵 𝑧 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵𝑥𝐴 𝑧𝐶)
81, 5, 73imtr4i 284 . . 3 (∃𝑥𝐴 𝑧 𝑦𝐵 𝐶 → ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶)
9 eliun 4712 . . 3 (𝑧 𝑥𝐴 𝑦𝐵 𝐶 ↔ ∃𝑥𝐴 𝑧 𝑦𝐵 𝐶)
10 eliin 4713 . . . 4 (𝑧 ∈ V → (𝑧 𝑦𝐵 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶))
112, 10ax-mp 5 . . 3 (𝑧 𝑦𝐵 𝑥𝐴 𝐶 ↔ ∀𝑦𝐵 𝑧 𝑥𝐴 𝐶)
128, 9, 113imtr4i 284 . 2 (𝑧 𝑥𝐴 𝑦𝐵 𝐶𝑧 𝑦𝐵 𝑥𝐴 𝐶)
1312ssriv 3800 1 𝑥𝐴 𝑦𝐵 𝐶 𝑦𝐵 𝑥𝐴 𝐶
Colors of variables: wff setvar class
Syntax hints:  wb 198  wcel 2157  wral 3087  wrex 3088  Vcvv 3383  wss 3767   ciun 4708   ciin 4709
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-9 2166  ax-10 2185  ax-11 2200  ax-12 2213  ax-13 2354  ax-ext 2775
This theorem depends on definitions:  df-bi 199  df-an 386  df-or 875  df-tru 1657  df-ex 1876  df-nf 1880  df-sb 2065  df-clab 2784  df-cleq 2790  df-clel 2793  df-nfc 2928  df-ral 3092  df-rex 3093  df-v 3385  df-in 3774  df-ss 3781  df-iun 4710  df-iin 4711
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator