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

Theorem rexima 5905
Description: Existential quantification under an image in terms of the base set. (Contributed by Stefan O'Rear, 21-Jan-2015.)
Hypothesis
Ref Expression
rexima.x  |-  ( x  =  ( F `  y )  ->  ( ph 
<->  ps ) )
Assertion
Ref Expression
rexima  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( E. x  e.  ( F " B
) ph  <->  E. y  e.  B  ps ) )
Distinct variable groups:    ph, y    ps, x    x, F, y    x, B, y    x, A, y
Allowed substitution hints:    ph( x)    ps( y)

Proof of Theorem rexima
StepHypRef Expression
1 ssel2 3223 . . . 4  |-  ( ( B  C_  A  /\  y  e.  B )  ->  y  e.  A )
2 funfvex 5665 . . . . 5  |-  ( ( Fun  F  /\  y  e.  dom  F )  -> 
( F `  y
)  e.  _V )
32funfni 5439 . . . 4  |-  ( ( F  Fn  A  /\  y  e.  A )  ->  ( F `  y
)  e.  _V )
41, 3sylan2 286 . . 3  |-  ( ( F  Fn  A  /\  ( B  C_  A  /\  y  e.  B )
)  ->  ( F `  y )  e.  _V )
54anassrs 400 . 2  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  y  e.  B
)  ->  ( F `  y )  e.  _V )
6 fvelimab 5711 . . 3  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( x  e.  ( F " B )  <->  E. y  e.  B  ( F `  y )  =  x ) )
7 eqcom 2233 . . . 4  |-  ( ( F `  y )  =  x  <->  x  =  ( F `  y ) )
87rexbii 2540 . . 3  |-  ( E. y  e.  B  ( F `  y )  =  x  <->  E. y  e.  B  x  =  ( F `  y ) )
96, 8bitrdi 196 . 2  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( x  e.  ( F " B )  <->  E. y  e.  B  x  =  ( F `  y ) ) )
10 rexima.x . . 3  |-  ( x  =  ( F `  y )  ->  ( ph 
<->  ps ) )
1110adantl 277 . 2  |-  ( ( ( F  Fn  A  /\  B  C_  A )  /\  x  =  ( F `  y ) )  ->  ( ph  <->  ps ) )
125, 9, 11rexxfr2d 4568 1  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( E. x  e.  ( F " B
) ph  <->  E. y  e.  B  ps ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1398    e. wcel 2202   E.wrex 2512   _Vcvv 2803    C_ wss 3201   "cima 4734    Fn wfn 5328   ` cfv 5333
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-14 2205  ax-ext 2213  ax-sep 4212  ax-pow 4270  ax-pr 4305
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2364  df-ral 2516  df-rex 2517  df-v 2805  df-sbc 3033  df-un 3205  df-in 3207  df-ss 3214  df-pw 3658  df-sn 3679  df-pr 3680  df-op 3682  df-uni 3899  df-br 4094  df-opab 4156  df-id 4396  df-xp 4737  df-rel 4738  df-cnv 4739  df-co 4740  df-dm 4741  df-rn 4742  df-res 4743  df-ima 4744  df-iota 5293  df-fun 5335  df-fn 5336  df-fv 5341
This theorem is referenced by:  supisolem  7250
  Copyright terms: Public domain W3C validator