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

Theorem elixp2 6914
Description: Membership in an infinite Cartesian product. See df-ixp 6911 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 5425 . . . . 5  |-  ( f  =  F  ->  (
f  Fn  A  <->  F  Fn  A ) )
2 fveq1 5647 . . . . . . 7  |-  ( f  =  F  ->  (
f `  x )  =  ( F `  x ) )
32eleq1d 2300 . . . . . 6  |-  ( f  =  F  ->  (
( f `  x
)  e.  B  <->  ( F `  x )  e.  B
) )
43ralbidv 2533 . . . . 5  |-  ( f  =  F  ->  ( A. x  e.  A  ( f `  x
)  e.  B  <->  A. x  e.  A  ( F `  x )  e.  B
) )
51, 4anbi12d 473 . . . 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 6912 . . . 4  |-  X_ x  e.  A  B  =  { f  |  ( f  Fn  A  /\  A. x  e.  A  ( f `  x )  e.  B ) }
75, 6elab2g 2954 . . 3  |-  ( F  e.  _V  ->  ( F  e.  X_ x  e.  A  B  <->  ( F  Fn  A  /\  A. x  e.  A  ( F `  x )  e.  B
) ) )
87pm5.32i 454 . 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 2815 . . 3  |-  ( F  e.  X_ x  e.  A  B  ->  F  e.  _V )
109pm4.71ri 392 . 2  |-  ( F  e.  X_ x  e.  A  B 
<->  ( F  e.  _V  /\  F  e.  X_ x  e.  A  B )
)
11 3anass 1009 . 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 212 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:    /\ wa 104    <-> wb 105    /\ w3a 1005    = wceq 1398    e. wcel 2202   A.wral 2511   _Vcvv 2803    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:  fvixp  6915  ixpfn  6916  elixp  6917  ixpf  6932  resixp  6945  mptelixpg  6946  prdsbasprj  13445  xpsfrnel  13507  xpscf  13510  depindlem2  16448
  Copyright terms: Public domain W3C validator