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

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

Proof of Theorem iinin1
StepHypRef Expression
1 iinin2 5007 . 2 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶))
2 incom 4135 . . . 4 (𝐶𝐵) = (𝐵𝐶)
32a1i 11 . . 3 (𝑥𝐴 → (𝐶𝐵) = (𝐵𝐶))
43iineq2i 4946 . 2 𝑥𝐴 (𝐶𝐵) = 𝑥𝐴 (𝐵𝐶)
5 incom 4135 . 2 ( 𝑥𝐴 𝐶𝐵) = (𝐵 𝑥𝐴 𝐶)
61, 4, 53eqtr4g 2803 1 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐶𝐵) = ( 𝑥𝐴 𝐶𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1539  wcel 2106  wne 2943  cin 3886  c0 4256   ciin 4925
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-12 2171  ax-ext 2709
This theorem depends on definitions:  df-bi 206  df-an 397  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-ne 2944  df-ral 3069  df-rab 3073  df-v 3434  df-dif 3890  df-in 3894  df-nul 4257  df-iin 4927
This theorem is referenced by:  firest  17143  iniin1  42674
  Copyright terms: Public domain W3C validator