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

Theorem f1elima 5913
Description: Membership in the image of a 1-1 map. (Contributed by Jeff Madsen, 2-Sep-2009.)
Assertion
Ref Expression
f1elima  |-  ( ( F : A -1-1-> B  /\  X  e.  A  /\  Y  C_  A )  ->  ( ( F `
 X )  e.  ( F " Y
)  <->  X  e.  Y
) )

Proof of Theorem f1elima
Dummy variable  z is distinct from all other variables.
StepHypRef Expression
1 f1fn 5544 . . . 4  |-  ( F : A -1-1-> B  ->  F  Fn  A )
2 fvelimab 5702 . . . 4  |-  ( ( F  Fn  A  /\  Y  C_  A )  -> 
( ( F `  X )  e.  ( F " Y )  <->  E. z  e.  Y  ( F `  z )  =  ( F `  X ) ) )
31, 2sylan 283 . . 3  |-  ( ( F : A -1-1-> B  /\  Y  C_  A )  ->  ( ( F `
 X )  e.  ( F " Y
)  <->  E. z  e.  Y  ( F `  z )  =  ( F `  X ) ) )
433adant2 1042 . 2  |-  ( ( F : A -1-1-> B  /\  X  e.  A  /\  Y  C_  A )  ->  ( ( F `
 X )  e.  ( F " Y
)  <->  E. z  e.  Y  ( F `  z )  =  ( F `  X ) ) )
5 ssel 3221 . . . . . . . 8  |-  ( Y 
C_  A  ->  (
z  e.  Y  -> 
z  e.  A ) )
65impac 381 . . . . . . 7  |-  ( ( Y  C_  A  /\  z  e.  Y )  ->  ( z  e.  A  /\  z  e.  Y
) )
7 f1fveq 5912 . . . . . . . . . . . 12  |-  ( ( F : A -1-1-> B  /\  ( z  e.  A  /\  X  e.  A
) )  ->  (
( F `  z
)  =  ( F `
 X )  <->  z  =  X ) )
87ancom2s 568 . . . . . . . . . . 11  |-  ( ( F : A -1-1-> B  /\  ( X  e.  A  /\  z  e.  A
) )  ->  (
( F `  z
)  =  ( F `
 X )  <->  z  =  X ) )
98biimpd 144 . . . . . . . . . 10  |-  ( ( F : A -1-1-> B  /\  ( X  e.  A  /\  z  e.  A
) )  ->  (
( F `  z
)  =  ( F `
 X )  -> 
z  =  X ) )
109anassrs 400 . . . . . . . . 9  |-  ( ( ( F : A -1-1-> B  /\  X  e.  A
)  /\  z  e.  A )  ->  (
( F `  z
)  =  ( F `
 X )  -> 
z  =  X ) )
11 eleq1 2294 . . . . . . . . . 10  |-  ( z  =  X  ->  (
z  e.  Y  <->  X  e.  Y ) )
1211biimpcd 159 . . . . . . . . 9  |-  ( z  e.  Y  ->  (
z  =  X  ->  X  e.  Y )
)
1310, 12sylan9 409 . . . . . . . 8  |-  ( ( ( ( F : A -1-1-> B  /\  X  e.  A )  /\  z  e.  A )  /\  z  e.  Y )  ->  (
( F `  z
)  =  ( F `
 X )  ->  X  e.  Y )
)
1413anasss 399 . . . . . . 7  |-  ( ( ( F : A -1-1-> B  /\  X  e.  A
)  /\  ( z  e.  A  /\  z  e.  Y ) )  -> 
( ( F `  z )  =  ( F `  X )  ->  X  e.  Y
) )
156, 14sylan2 286 . . . . . 6  |-  ( ( ( F : A -1-1-> B  /\  X  e.  A
)  /\  ( Y  C_  A  /\  z  e.  Y ) )  -> 
( ( F `  z )  =  ( F `  X )  ->  X  e.  Y
) )
1615anassrs 400 . . . . 5  |-  ( ( ( ( F : A -1-1-> B  /\  X  e.  A )  /\  Y  C_  A )  /\  z  e.  Y )  ->  (
( F `  z
)  =  ( F `
 X )  ->  X  e.  Y )
)
1716rexlimdva 2650 . . . 4  |-  ( ( ( F : A -1-1-> B  /\  X  e.  A
)  /\  Y  C_  A
)  ->  ( E. z  e.  Y  ( F `  z )  =  ( F `  X )  ->  X  e.  Y ) )
18173impa 1220 . . 3  |-  ( ( F : A -1-1-> B  /\  X  e.  A  /\  Y  C_  A )  ->  ( E. z  e.  Y  ( F `  z )  =  ( F `  X )  ->  X  e.  Y
) )
19 eqid 2231 . . . 4  |-  ( F `
 X )  =  ( F `  X
)
20 fveq2 5639 . . . . . 6  |-  ( z  =  X  ->  ( F `  z )  =  ( F `  X ) )
2120eqeq1d 2240 . . . . 5  |-  ( z  =  X  ->  (
( F `  z
)  =  ( F `
 X )  <->  ( F `  X )  =  ( F `  X ) ) )
2221rspcev 2910 . . . 4  |-  ( ( X  e.  Y  /\  ( F `  X )  =  ( F `  X ) )  ->  E. z  e.  Y  ( F `  z )  =  ( F `  X ) )
2319, 22mpan2 425 . . 3  |-  ( X  e.  Y  ->  E. z  e.  Y  ( F `  z )  =  ( F `  X ) )
2418, 23impbid1 142 . 2  |-  ( ( F : A -1-1-> B  /\  X  e.  A  /\  Y  C_  A )  ->  ( E. z  e.  Y  ( F `  z )  =  ( F `  X )  <-> 
X  e.  Y ) )
254, 24bitrd 188 1  |-  ( ( F : A -1-1-> B  /\  X  e.  A  /\  Y  C_  A )  ->  ( ( F `
 X )  e.  ( F " Y
)  <->  X  e.  Y
) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    /\ w3a 1004    = wceq 1397    e. wcel 2202   E.wrex 2511    C_ wss 3200   "cima 4728    Fn wfn 5321   -1-1->wf1 5323   ` cfv 5326
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 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-14 2205  ax-ext 2213  ax-sep 4207  ax-pow 4264  ax-pr 4299
This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ral 2515  df-rex 2516  df-v 2804  df-sbc 3032  df-un 3204  df-in 3206  df-ss 3213  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-br 4089  df-opab 4151  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fv 5334
This theorem is referenced by:  f1imass  5914  iseqf1olemnab  10762  fprodssdc  12150  ctinfom  13048  ssnnctlemct  13066
  Copyright terms: Public domain W3C validator