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

Theorem iinin2 5003
Description: Indexed intersection of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use intiin 4985 to recover Enderton's theorem. (Contributed by Mario Carneiro, 19-Mar-2015.)
Assertion
Ref Expression
iinin2 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐶(𝑥)

Proof of Theorem iinin2
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 r19.28zv 4428 . . . 4 (𝐴 ≠ ∅ → (∀𝑥𝐴 (𝑦𝐵𝑦𝐶) ↔ (𝑦𝐵 ∧ ∀𝑥𝐴 𝑦𝐶)))
2 elin 3899 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦𝐶))
32ralbii 3090 . . . 4 (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 (𝑦𝐵𝑦𝐶))
4 eliin 4926 . . . . . 6 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶))
54elv 3428 . . . . 5 (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶)
65anbi2i 622 . . . 4 ((𝑦𝐵𝑦 𝑥𝐴 𝐶) ↔ (𝑦𝐵 ∧ ∀𝑥𝐴 𝑦𝐶))
71, 3, 63bitr4g 313 . . 3 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦 𝑥𝐴 𝐶)))
8 eliin 4926 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶)))
98elv 3428 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶))
10 elin 3899 . . 3 (𝑦 ∈ (𝐵 𝑥𝐴 𝐶) ↔ (𝑦𝐵𝑦 𝑥𝐴 𝐶))
117, 9, 103bitr4g 313 . 2 (𝐴 ≠ ∅ → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ (𝐵 𝑥𝐴 𝐶)))
1211eqrdv 2736 1 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395   = wceq 1539  wcel 2108  wne 2942  wral 3063  Vcvv 3422  cin 3882  c0 4253   ciin 4922
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-12 2173  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 396  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-clab 2716  df-cleq 2730  df-clel 2817  df-ne 2943  df-ral 3068  df-v 3424  df-dif 3886  df-in 3890  df-nul 4254  df-iin 4924
This theorem is referenced by:  iinin1  5004  iniin2  42564
  Copyright terms: Public domain W3C validator