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

Theorem ixpin 6617
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 579 . . . 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 3259 . . . . . . 7  |-  ( ( f `  x )  e.  ( B  i^i  C )  <->  ( ( f `
 x )  e.  B  /\  ( f `
 x )  e.  C ) )
32ralbii 2441 . . . . . 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 2558 . . . . . 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 183 . . . . 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 452 . . . 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 2689 . . . . . 6  |-  f  e. 
_V
87elixp 6599 . . . . 5  |-  ( f  e.  X_ x  e.  A  B 
<->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B ) )
97elixp 6599 . . . . 5  |-  ( f  e.  X_ x  e.  A  C 
<->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  C ) )
108, 9anbi12i 455 . . . 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 211 . . 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 6599 . . 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 3259 . . 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 211 . 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 2136 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 103    = wceq 1331    e. wcel 1480   A.wral 2416    i^i cin 3070    Fn wfn 5118   ` cfv 5123   X_cixp 6592
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-nf 1437  df-sb 1736  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ral 2421  df-rex 2422  df-v 2688  df-un 3075  df-in 3077  df-ss 3084  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-iota 5088  df-fun 5125  df-fn 5126  df-fv 5131  df-ixp 6593
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator