Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  inixp Unicode version

Theorem inixp 26399
Description: Intersection of Cartesian products over the same base set. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
inixp  |-  ( X_ x  e.  A  B  i^i  X_ x  e.  A  C )  =  X_ x  e.  A  ( B  i^i  C )
Distinct variable group:    x, A
Allowed substitution hints:    B( x)    C( x)

Proof of Theorem inixp
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 an4 797 . . . 4  |-  ( ( ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B )  /\  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  C
) )  <->  ( (
f  Fn  A  /\  f  Fn  A )  /\  ( A. x  e.  A  ( f `  x )  e.  B  /\  A. x  e.  A  ( f `  x
)  e.  C ) ) )
2 anidm 625 . . . . 5  |-  ( ( f  Fn  A  /\  f  Fn  A )  <->  f  Fn  A )
3 r19.26 2675 . . . . . 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 ) )
4 elin 3358 . . . . . . . 8  |-  ( ( f `  x )  e.  ( B  i^i  C )  <->  ( ( f `
 x )  e.  B  /\  ( f `
 x )  e.  C ) )
54bicomi 193 . . . . . . 7  |-  ( ( ( f `  x
)  e.  B  /\  ( f `  x
)  e.  C )  <-> 
( f `  x
)  e.  ( B  i^i  C ) )
65ralbii 2567 . . . . . 6  |-  ( A. x  e.  A  (
( f `  x
)  e.  B  /\  ( f `  x
)  e.  C )  <->  A. x  e.  A  ( f `  x
)  e.  ( B  i^i  C ) )
73, 6bitr3i 242 . . . . 5  |-  ( ( A. x  e.  A  ( f `  x
)  e.  B  /\  A. x  e.  A  ( f `  x )  e.  C )  <->  A. x  e.  A  ( f `  x )  e.  ( B  i^i  C ) )
82, 7anbi12i 678 . . . 4  |-  ( ( ( f  Fn  A  /\  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  i^i  C ) ) )
91, 8bitri 240 . . 3  |-  ( ( ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B )  /\  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  C
) )  <->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  ( B  i^i  C ) ) )
10 vex 2791 . . . . 5  |-  f  e. 
_V
1110elixp 6823 . . . 4  |-  ( f  e.  X_ x  e.  A  B 
<->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B ) )
1210elixp 6823 . . . 4  |-  ( f  e.  X_ x  e.  A  C 
<->  ( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  C ) )
1311, 12anbi12i 678 . . 3  |-  ( ( 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 ) ) )
1410elixp 6823 . . 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 ) ) )
159, 13, 143bitr4i 268 . 2  |-  ( ( f  e.  X_ x  e.  A  B  /\  f  e.  X_ x  e.  A  C )  <->  f  e.  X_ x  e.  A  ( B  i^i  C ) )
1615ineqri 3362 1  |-  ( X_ x  e.  A  B  i^i  X_ x  e.  A  C )  =  X_ x  e.  A  ( B  i^i  C )
Colors of variables: wff set class
Syntax hints:    /\ wa 358    = wceq 1623    e. wcel 1684   A.wral 2543    i^i cin 3151    Fn wfn 5250   ` cfv 5255   X_cixp 6817
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1533  ax-5 1544  ax-17 1603  ax-9 1635  ax-8 1643  ax-6 1703  ax-7 1708  ax-11 1715  ax-12 1866  ax-ext 2264
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1310  df-ex 1529  df-nf 1532  df-sb 1630  df-clab 2270  df-cleq 2276  df-clel 2279  df-nfc 2408  df-ral 2548  df-rex 2549  df-rab 2552  df-v 2790  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3456  df-if 3566  df-sn 3646  df-pr 3647  df-op 3649  df-uni 3828  df-br 4024  df-opab 4078  df-rel 4696  df-cnv 4697  df-co 4698  df-dm 4699  df-iota 5219  df-fun 5257  df-fn 5258  df-fv 5263  df-ixp 6818
  Copyright terms: Public domain W3C validator