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

Theorem ixpin 6749
Description: The intersection of two infinite Cartesian products. (Contributed by Mario Carneiro, 3-Feb-2015.)
Assertion
Ref Expression
ixpin  |-  X_ x  e.  A  ( B  i^i  C )  =  (
X_ x  e.  A  B  i^i  X_ x  e.  A  C )
Distinct variable group:    x, A
Allowed substitution hints:    B( x)    C( x)

Proof of Theorem ixpin
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 anandi 590 . . . 4  |-  ( ( f  Fn  A  /\  ( A. x  e.  A  ( f `  x
)  e.  B  /\  A. x  e.  A  ( f `  x )  e.  C ) )  <-> 
( ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B
)  /\  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  C
) ) )
2 elin 3333 . . . . . . 7  |-  ( ( f `  x )  e.  ( B  i^i  C )  <->  ( ( f `
 x )  e.  B  /\  ( f `
 x )  e.  C ) )
32ralbii 2496 . . . . . 6  |-  ( A. x  e.  A  (
f `  x )  e.  ( B  i^i  C
)  <->  A. x  e.  A  ( ( f `  x )  e.  B  /\  ( f `  x
)  e.  C ) )
4 r19.26 2616 . . . . . 6  |-  ( A. x  e.  A  (
( f `  x
)  e.  B  /\  ( f `  x
)  e.  C )  <-> 
( A. x  e.  A  ( f `  x )  e.  B  /\  A. x  e.  A  ( f `  x
)  e.  C ) )
53, 4bitri 184 . . . . 5  |-  ( A. x  e.  A  (
f `  x )  e.  ( B  i^i  C
)  <->  ( A. x  e.  A  ( f `  x )  e.  B  /\  A. x  e.  A  ( f `  x
)  e.  C ) )
65anbi2i 457 . . . 4  |-  ( ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  ( B  i^i  C ) )  <->  ( f  Fn  A  /\  ( A. x  e.  A  ( f `  x
)  e.  B  /\  A. x  e.  A  ( f `  x )  e.  C ) ) )
7 vex 2755 . . . . . 6  |-  f  e. 
_V
87elixp 6731 . . . . 5  |-  ( f  e.  X_ x  e.  A  B 
<->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B ) )
97elixp 6731 . . . . 5  |-  ( f  e.  X_ x  e.  A  C 
<->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  C ) )
108, 9anbi12i 460 . . . 4  |-  ( ( f  e.  X_ x  e.  A  B  /\  f  e.  X_ x  e.  A  C )  <->  ( (
f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B )  /\  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  C ) ) )
111, 6, 103bitr4i 212 . . 3  |-  ( ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  ( B  i^i  C ) )  <->  ( f  e.  X_ x  e.  A  B  /\  f  e.  X_ x  e.  A  C
) )
127elixp 6731 . . 3  |-  ( f  e.  X_ x  e.  A  ( B  i^i  C )  <-> 
( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  ( B  i^i  C ) ) )
13 elin 3333 . . 3  |-  ( f  e.  ( X_ x  e.  A  B  i^i  X_ x  e.  A  C
)  <->  ( f  e.  X_ x  e.  A  B  /\  f  e.  X_ x  e.  A  C
) )
1411, 12, 133bitr4i 212 . 2  |-  ( f  e.  X_ x  e.  A  ( B  i^i  C )  <-> 
f  e.  ( X_ x  e.  A  B  i^i  X_ x  e.  A  C ) )
1514eqriv 2186 1  |-  X_ x  e.  A  ( B  i^i  C )  =  (
X_ x  e.  A  B  i^i  X_ x  e.  A  C )
Colors of variables: wff set class
Syntax hints:    /\ wa 104    = wceq 1364    e. wcel 2160   A.wral 2468    i^i cin 3143    Fn wfn 5230   ` cfv 5235   X_cixp 6724
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2171
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2176  df-cleq 2182  df-clel 2185  df-nfc 2321  df-ral 2473  df-rex 2474  df-v 2754  df-un 3148  df-in 3150  df-ss 3157  df-sn 3613  df-pr 3614  df-op 3616  df-uni 3825  df-br 4019  df-opab 4080  df-rel 4651  df-cnv 4652  df-co 4653  df-dm 4654  df-iota 5196  df-fun 5237  df-fn 5238  df-fv 5243  df-ixp 6725
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator