ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  iinin2m Unicode version

Theorem iinin2m 3746
Description: Indexed intersection of intersection. Compare to Theorem "Distributive laws" in [Enderton] p. 30. (Contributed by Jim Kingdon, 17-Aug-2018.)
Assertion
Ref Expression
iinin2m  |-  ( E. x  x  e.  A  -> 
|^|_ x  e.  A  ( B  i^i  C )  =  ( B  i^i  |^|_
x  e.  A  C
) )
Distinct variable groups:    x, A    x, B
Allowed substitution hint:    C( x)

Proof of Theorem iinin2m
Dummy variable  y is distinct from all other variables.
StepHypRef Expression
1 r19.28mv 3334 . . . 4  |-  ( E. x  x  e.  A  ->  ( A. x  e.  A  ( y  e.  B  /\  y  e.  C )  <->  ( y  e.  B  /\  A. x  e.  A  y  e.  C ) ) )
2 elin 3155 . . . . 5  |-  ( y  e.  ( B  i^i  C )  <->  ( y  e.  B  /\  y  e.  C ) )
32ralbii 2372 . . . 4  |-  ( A. x  e.  A  y  e.  ( B  i^i  C
)  <->  A. x  e.  A  ( y  e.  B  /\  y  e.  C
) )
4 vex 2604 . . . . . 6  |-  y  e. 
_V
5 eliin 3683 . . . . . 6  |-  ( y  e.  _V  ->  (
y  e.  |^|_ x  e.  A  C  <->  A. x  e.  A  y  e.  C ) )
64, 5ax-mp 7 . . . . 5  |-  ( y  e.  |^|_ x  e.  A  C 
<-> 
A. x  e.  A  y  e.  C )
76anbi2i 444 . . . 4  |-  ( ( y  e.  B  /\  y  e.  |^|_ x  e.  A  C )  <->  ( y  e.  B  /\  A. x  e.  A  y  e.  C ) )
81, 3, 73bitr4g 221 . . 3  |-  ( E. x  x  e.  A  ->  ( A. x  e.  A  y  e.  ( B  i^i  C )  <-> 
( y  e.  B  /\  y  e.  |^|_ x  e.  A  C )
) )
9 eliin 3683 . . . 4  |-  ( y  e.  _V  ->  (
y  e.  |^|_ x  e.  A  ( B  i^i  C )  <->  A. x  e.  A  y  e.  ( B  i^i  C ) ) )
104, 9ax-mp 7 . . 3  |-  ( y  e.  |^|_ x  e.  A  ( B  i^i  C )  <->  A. x  e.  A  y  e.  ( B  i^i  C ) )
11 elin 3155 . . 3  |-  ( y  e.  ( B  i^i  |^|_
x  e.  A  C
)  <->  ( y  e.  B  /\  y  e. 
|^|_ x  e.  A  C ) )
128, 10, 113bitr4g 221 . 2  |-  ( E. x  x  e.  A  ->  ( y  e.  |^|_ x  e.  A  ( B  i^i  C )  <->  y  e.  ( B  i^i  |^|_ x  e.  A  C )
) )
1312eqrdv 2079 1  |-  ( E. x  x  e.  A  -> 
|^|_ x  e.  A  ( B  i^i  C )  =  ( B  i^i  |^|_
x  e.  A  C
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    = wceq 1284   E.wex 1421    e. wcel 1433   A.wral 2348   _Vcvv 2601    i^i cin 2972   |^|_ciin 3679
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063
This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-v 2603  df-in 2979  df-iin 3681
This theorem is referenced by:  iinin1m  3747
  Copyright terms: Public domain W3C validator