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

Theorem rexima 5801
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 3178 . . . 4  |-  ( ( B  C_  A  /\  y  e.  B )  ->  y  e.  A )
2 funfvex 5575 . . . . 5  |-  ( ( Fun  F  /\  y  e.  dom  F )  -> 
( F `  y
)  e.  _V )
32funfni 5358 . . . 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 5617 . . 3  |-  ( ( F  Fn  A  /\  B  C_  A )  -> 
( x  e.  ( F " B )  <->  E. y  e.  B  ( F `  y )  =  x ) )
7 eqcom 2198 . . . 4  |-  ( ( F `  y )  =  x  <->  x  =  ( F `  y ) )
87rexbii 2504 . . 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 4500 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 1364    e. wcel 2167   E.wrex 2476   _Vcvv 2763    C_ wss 3157   "cima 4666    Fn wfn 5253   ` cfv 5258
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 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4151  ax-pow 4207  ax-pr 4242
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-sbc 2990  df-un 3161  df-in 3163  df-ss 3170  df-pw 3607  df-sn 3628  df-pr 3629  df-op 3631  df-uni 3840  df-br 4034  df-opab 4095  df-id 4328  df-xp 4669  df-rel 4670  df-cnv 4671  df-co 4672  df-dm 4673  df-rn 4674  df-res 4675  df-ima 4676  df-iota 5219  df-fun 5260  df-fn 5261  df-fv 5266
This theorem is referenced by:  supisolem  7074
  Copyright terms: Public domain W3C validator