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

Theorem f1ofveu 5520
Description: There is one domain element for each value of a one-to-one onto function. (Contributed by NM, 26-May-2006.)
Assertion
Ref Expression
f1ofveu  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  E! x  e.  A  ( F `  x )  =  C )
Distinct variable groups:    x, A    x, B    x, C    x, F

Proof of Theorem f1ofveu
StepHypRef Expression
1 f1ocnv 5159 . . . 4  |-  ( F : A -1-1-onto-> B  ->  `' F : B -1-1-onto-> A )
2 f1of 5146 . . . 4  |-  ( `' F : B -1-1-onto-> A  ->  `' F : B --> A )
31, 2syl 14 . . 3  |-  ( F : A -1-1-onto-> B  ->  `' F : B --> A )
4 feu 5092 . . 3  |-  ( ( `' F : B --> A  /\  C  e.  B )  ->  E! x  e.  A  <. C ,  x >.  e.  `' F )
53, 4sylan 277 . 2  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  E! x  e.  A  <. C ,  x >.  e.  `' F )
6 f1ocnvfvb 5440 . . . . . 6  |-  ( ( F : A -1-1-onto-> B  /\  x  e.  A  /\  C  e.  B )  ->  ( ( F `  x )  =  C  <-> 
( `' F `  C )  =  x ) )
763com23 1144 . . . . 5  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( F `  x )  =  C  <-> 
( `' F `  C )  =  x ) )
8 dff1o4 5154 . . . . . . 7  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
98simprbi 269 . . . . . 6  |-  ( F : A -1-1-onto-> B  ->  `' F  Fn  B )
10 fnopfvb 5236 . . . . . . 7  |-  ( ( `' F  Fn  B  /\  C  e.  B
)  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F
) )
11103adant3 958 . . . . . 6  |-  ( ( `' F  Fn  B  /\  C  e.  B  /\  x  e.  A
)  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F
) )
129, 11syl3an1 1202 . . . . 5  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F ) )
137, 12bitrd 186 . . . 4  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( F `  x )  =  C  <->  <. C ,  x >.  e.  `' F ) )
14133expa 1138 . . 3  |-  ( ( ( F : A -1-1-onto-> B  /\  C  e.  B
)  /\  x  e.  A )  ->  (
( F `  x
)  =  C  <->  <. C ,  x >.  e.  `' F
) )
1514reubidva 2536 . 2  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  ( E! x  e.  A  ( F `  x )  =  C  <-> 
E! x  e.  A  <. C ,  x >.  e.  `' F ) )
165, 15mpbird 165 1  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  E! x  e.  A  ( F `  x )  =  C )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 102    <-> wb 103    /\ w3a 919    = wceq 1284    e. wcel 1433   E!wreu 2350   <.cop 3401   `'ccnv 4362    Fn wfn 4917   -->wf 4918   -1-1-onto->wf1o 4921   ` cfv 4922
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-ral 2353  df-rex 2354  df-reu 2355  df-v 2603  df-sbc 2816  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407  df-uni 3602  df-br 3786  df-opab 3840  df-id 4048  df-xp 4369  df-rel 4370  df-cnv 4371  df-co 4372  df-dm 4373  df-rn 4374  df-res 4375  df-ima 4376  df-iota 4887  df-fun 4924  df-fn 4925  df-f 4926  df-f1 4927  df-fo 4928  df-f1o 4929  df-fv 4930
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator