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

Theorem f1ofveu 5907
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 5514 . . . 4  |-  ( F : A -1-1-onto-> B  ->  `' F : B -1-1-onto-> A )
2 f1of 5501 . . . 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 5437 . . 3  |-  ( ( `' F : B --> A  /\  C  e.  B )  ->  E! x  e.  A  <. C ,  x >.  e.  `' F )
53, 4sylan 283 . 2  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B )  ->  E! x  e.  A  <. C ,  x >.  e.  `' F )
6 f1ocnvfvb 5824 . . . . . 6  |-  ( ( F : A -1-1-onto-> B  /\  x  e.  A  /\  C  e.  B )  ->  ( ( F `  x )  =  C  <-> 
( `' F `  C )  =  x ) )
763com23 1211 . . . . 5  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( F `  x )  =  C  <-> 
( `' F `  C )  =  x ) )
8 dff1o4 5509 . . . . . . 7  |-  ( F : A -1-1-onto-> B  <->  ( F  Fn  A  /\  `' F  Fn  B ) )
98simprbi 275 . . . . . 6  |-  ( F : A -1-1-onto-> B  ->  `' F  Fn  B )
10 fnopfvb 5599 . . . . . . 7  |-  ( ( `' F  Fn  B  /\  C  e.  B
)  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F
) )
11103adant3 1019 . . . . . 6  |-  ( ( `' F  Fn  B  /\  C  e.  B  /\  x  e.  A
)  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F
) )
129, 11syl3an1 1282 . . . . 5  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( `' F `  C )  =  x  <->  <. C ,  x >.  e.  `' F ) )
137, 12bitrd 188 . . . 4  |-  ( ( F : A -1-1-onto-> B  /\  C  e.  B  /\  x  e.  A )  ->  ( ( F `  x )  =  C  <->  <. C ,  x >.  e.  `' F ) )
14133expa 1205 . . 3  |-  ( ( ( F : A -1-1-onto-> B  /\  C  e.  B
)  /\  x  e.  A )  ->  (
( F `  x
)  =  C  <->  <. C ,  x >.  e.  `' F
) )
1514reubidva 2677 . 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 167 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 104    <-> wb 105    /\ w3a 980    = wceq 1364    e. wcel 2164   E!wreu 2474   <.cop 3622   `'ccnv 4659    Fn wfn 5250   -->wf 5251   -1-1-onto->wf1o 5254   ` cfv 5255
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 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-14 2167  ax-ext 2175  ax-sep 4148  ax-pow 4204  ax-pr 4239
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-reu 2479  df-v 2762  df-sbc 2987  df-un 3158  df-in 3160  df-ss 3167  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-br 4031  df-opab 4092  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263
This theorem is referenced by:  1arith2  12509
  Copyright terms: Public domain W3C validator