HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem fofun 3673
Description: An onto mapping is a function.
Assertion
Ref Expression
fofun |- (F:A-onto->B -> Fun F)

Proof of Theorem fofun
StepHypRef Expression
1 fof 3672 . 2 |- (F:A-onto->B -> F:A-->B)
2 ffun 3629 . 2 |- (F:A-->B -> Fun F)
31, 2syl 10 1 |- (F:A-onto->B -> Fun F)
Colors of variables: wff set class
Syntax hints:   -> wi 3  Fun wfun 3176  -->wf 3178  -onto->wfo 3180
This theorem is referenced by:  fornex 3679  cbvfo 3885  fodomfiOLD 4566  fodom 4798  brdom3 4801  ruclem10 7519  ruclem11 7520  bcthlem3 8001  grprn 8056  subgres 8117  vafval 8222  smfval 8224  vsfval 8254  domval 10655  codval 10656  idval 10657  cmpval 10658
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-12 968  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-in 2051  df-ss 2053  df-fn 3193  df-f 3194  df-fo 3196
Copyright terms: Public domain