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

Theorem iinin2 5046
Description: Indexed intersection of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use intiin 5026 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 4469 . . . 4 (𝐴 ≠ ∅ → (∀𝑥𝐴 (𝑦𝐵𝑦𝐶) ↔ (𝑦𝐵 ∧ ∀𝑥𝐴 𝑦𝐶)))
2 elin 3922 . . . . 5 (𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦𝐶))
32ralbii 3113 . . . 4 (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ ∀𝑥𝐴 (𝑦𝐵𝑦𝐶))
4 eliin 4963 . . . . . 6 (𝑦 ∈ V → (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶))
54elv 3462 . . . . 5 (𝑦 𝑥𝐴 𝐶 ↔ ∀𝑥𝐴 𝑦𝐶)
65anbi2i 635 . . . 4 ((𝑦𝐵𝑦 𝑥𝐴 𝐶) ↔ (𝑦𝐵 ∧ ∀𝑥𝐴 𝑦𝐶))
71, 3, 63bitr4g 317 . . 3 (𝐴 ≠ ∅ → (∀𝑥𝐴 𝑦 ∈ (𝐵𝐶) ↔ (𝑦𝐵𝑦 𝑥𝐴 𝐶)))
8 eliin 4963 . . . 4 (𝑦 ∈ V → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶)))
98elv 3462 . . 3 (𝑦 𝑥𝐴 (𝐵𝐶) ↔ ∀𝑥𝐴 𝑦 ∈ (𝐵𝐶))
10 elin 3922 . . 3 (𝑦 ∈ (𝐵 𝑥𝐴 𝐶) ↔ (𝑦𝐵𝑦 𝑥𝐴 𝐶))
117, 9, 103bitr4g 317 . 2 (𝐴 ≠ ∅ → (𝑦 𝑥𝐴 (𝐵𝐶) ↔ 𝑦 ∈ (𝐵 𝑥𝐴 𝐶)))
1211eqrdv 2763 1 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2146  wne 2960  wral 3081  Vcvv 3457  cin 3905  c0 4286   ciin 4959
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2737
This proof depends on definitions:  df-bi 210  df-an 402  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-v 3459  df-dif 3909  df-in 3913  df-nul 4287  df-iin 4961
This theorem is used by:  iinin1  5047  iniin2  45904
  Copyright terms: Public domain W3C validator