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

Theorem iinin1 4906
 Description: Indexed intersection of intersection. Generalization of half of theorem "Distributive laws" in [Enderton] p. 30. Use intiin 4888 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 4905 . 2 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐵𝐶) = (𝐵 𝑥𝐴 𝐶))
2 incom 4105 . . . 4 (𝐶𝐵) = (𝐵𝐶)
32a1i 11 . . 3 (𝑥𝐴 → (𝐶𝐵) = (𝐵𝐶))
43iineq2i 4852 . 2 𝑥𝐴 (𝐶𝐵) = 𝑥𝐴 (𝐵𝐶)
5 incom 4105 . 2 ( 𝑥𝐴 𝐶𝐵) = (𝐵 𝑥𝐴 𝐶)
61, 4, 53eqtr4g 2858 1 (𝐴 ≠ ∅ → 𝑥𝐴 (𝐶𝐵) = ( 𝑥𝐴 𝐶𝐵))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   = wceq 1525   ∈ wcel 2083   ≠ wne 2986   ∩ cin 3864  ∅c0 4217  ∩ ciin 4832 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1781  ax-4 1795  ax-5 1892  ax-6 1951  ax-7 1996  ax-8 2085  ax-9 2093  ax-10 2114  ax-11 2128  ax-12 2143  ax-ext 2771 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 843  df-tru 1528  df-ex 1766  df-nf 1770  df-sb 2045  df-clab 2778  df-cleq 2790  df-clel 2865  df-nfc 2937  df-ne 2987  df-ral 3112  df-v 3442  df-dif 3868  df-in 3872  df-nul 4218  df-iin 4834 This theorem is referenced by:  firest  16539  iniin1  40952
 Copyright terms: Public domain W3C validator