MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  elixp2 Unicode version

Theorem elixp2 6908
Description: Membership in an infinite Cartesian product. See df-ixp 6906 for discussion of the notation. (Contributed by NM, 28-Sep-2006.)
Assertion
Ref Expression
elixp2  |-  ( F  e.  X_ x  e.  A  B 
<->  ( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B ) )
Distinct variable groups:    x, A    x, F
Allowed substitution hint:    B( x)

Proof of Theorem elixp2
Dummy variable  f is distinct from all other variables.
StepHypRef Expression
1 fneq1 5415 . . . . 5  |-  ( f  =  F  ->  (
f  Fn  A  <->  F  Fn  A ) )
2 fveq1 5607 . . . . . . 7  |-  ( f  =  F  ->  (
f `  x )  =  ( F `  x ) )
32eleq1d 2424 . . . . . 6  |-  ( f  =  F  ->  (
( f `  x
)  e.  B  <->  ( F `  x )  e.  B
) )
43ralbidv 2639 . . . . 5  |-  ( f  =  F  ->  ( A. x  e.  A  ( f `  x
)  e.  B  <->  A. x  e.  A  ( F `  x )  e.  B
) )
51, 4anbi12d 691 . . . 4  |-  ( f  =  F  ->  (
( f  Fn  A  /\  A. x  e.  A  ( f `  x
)  e.  B )  <-> 
( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B ) ) )
6 dfixp 6907 . . . 4  |-  X_ x  e.  A  B  =  { f  |  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B ) }
75, 6elab2g 2992 . . 3  |-  ( F  e.  _V  ->  ( F  e.  X_ x  e.  A  B  <->  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B
) ) )
87pm5.32i 618 . 2  |-  ( ( F  e.  _V  /\  F  e.  X_ x  e.  A  B )  <->  ( F  e.  _V  /\  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B ) ) )
9 elex 2872 . . 3  |-  ( F  e.  X_ x  e.  A  B  ->  F  e.  _V )
109pm4.71ri 614 . 2  |-  ( F  e.  X_ x  e.  A  B 
<->  ( F  e.  _V  /\  F  e.  X_ x  e.  A  B )
)
11 3anass 938 . 2  |-  ( ( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B )  <->  ( F  e.  _V  /\  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B ) ) )
128, 10, 113bitr4i 268 1  |-  ( F  e.  X_ x  e.  A  B 
<->  ( F  e.  _V  /\  F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B ) )
Colors of variables: wff set class
Syntax hints:    <-> wb 176    /\ wa 358    /\ w3a 934    = wceq 1642    e. wcel 1710   A.wral 2619   _Vcvv 2864    Fn wfn 5332   ` cfv 5337   X_cixp 6905
This theorem is referenced by:  fvixp  6909  ixpfn  6910  elixp  6911  ixpf  6926  resixp  6939  undifixp  6940  mptelixpg  6941  prdsbasprj  13470  xpsfrnel  13564  isssc  13796  isfuncd  13838  funcres2b  13870  dprdw  15344  kelac1  26484
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1546  ax-5 1557  ax-17 1616  ax-9 1654  ax-8 1675  ax-6 1729  ax-7 1734  ax-11 1746  ax-12 1930  ax-ext 2339
This theorem depends on definitions:  df-bi 177  df-or 359  df-an 360  df-3an 936  df-tru 1319  df-ex 1542  df-nf 1545  df-sb 1649  df-clab 2345  df-cleq 2351  df-clel 2354  df-nfc 2483  df-ral 2624  df-rex 2625  df-rab 2628  df-v 2866  df-dif 3231  df-un 3233  df-in 3235  df-ss 3242  df-nul 3532  df-if 3642  df-sn 3722  df-pr 3723  df-op 3725  df-uni 3909  df-br 4105  df-opab 4159  df-rel 4778  df-cnv 4779  df-co 4780  df-dm 4781  df-iota 5301  df-fun 5339  df-fn 5340  df-fv 5345  df-ixp 6906
  Copyright terms: Public domain W3C validator