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

Theorem ixpin 6935
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 594 . . . 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 3392 . . . . . . 7  |-  ( ( f `  x )  e.  ( B  i^i  C )  <->  ( ( f `
 x )  e.  B  /\  ( f `
 x )  e.  C ) )
32ralbii 2539 . . . . . 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 2660 . . . . . 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 2806 . . . . . 6  |-  f  e. 
_V
87elixp 6917 . . . . 5  |-  ( f  e.  X_ x  e.  A  B 
<->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B ) )
97elixp 6917 . . . . 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 6917 . . 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 3392 . . 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 2228 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 1398    e. wcel 2202   A.wral 2511    i^i cin 3200    Fn wfn 5328   ` cfv 5333   X_cixp 6910
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-ext 2213
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-un 3205  df-in 3207  df-ss 3214  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341  df-ixp 6911
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator