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

Theorem iinun2 5076
Description: Indexed intersection of union. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use intiin 5062 to recover Enderton's theorem. (Contributed by NM, 19-Aug-2004.)
Assertion
Ref Expression
iinun2 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶)
Distinct variable group:   𝑥,𝐵
Allowed substitution hints:   𝐴(𝑥)   𝐶(𝑥)

Proof of Theorem iinun2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 r19.32v 3192 . . . 4 (∀𝑥𝐴 (𝑦𝐵𝑦𝐶) ↔ (𝑦𝐵 ∨ ∀𝑥𝐴 𝑦𝐶))
2 elun 4148 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦𝐶))
32ralbii 3094 . . . 4 (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 (𝑦𝐵𝑦𝐶))
4 eliin 5002 . . . . . 6 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶))
54elv 3481 . . . . 5 (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶)
65orbi2i 912 . . . 4 ((𝑦𝐵𝑦 𝑥𝐴 𝐶) ↔ (𝑦𝐵 ∨ ∀𝑥𝐴 𝑦𝐶))
71, 3, 63bitr4i 303 . . 3 (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦 𝑥𝐴 𝐶))
8 eliin 5002 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶)))
98elv 3481 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶))
10 elun 4148 . . 3 (𝑦 ∈ (𝐵 𝑥𝐴 𝐶) ↔ (𝑦𝐵𝑦 𝑥𝐴 𝐶))
117, 9, 103bitr4i 303 . 2 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ (𝐵 𝑥𝐴 𝐶))
1211eqriv 2730 1 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wo 846   = wceq 1542  wcel 2107  wral 3062  Vcvv 3475  cun 3946   ciin 4998
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-ext 2704
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-tru 1545  df-ex 1783  df-sb 2069  df-clab 2711  df-cleq 2725  df-clel 2811  df-ral 3063  df-v 3477  df-un 3953  df-iin 5000
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator