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

Theorem fofun 3679
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 3678 . 2 |- (F:A-onto->B -> F:A-->B)
2 ffun 3635 . 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 3182  -->wf 3184  -onto->wfo 3186
This theorem is referenced by:  fornex 3685  cbvfo 3891  fodomfi 4575  fodomfiOLD 4576  fodom 4808  brdom3 4811  ruclem10 7520  ruclem11 7521  bcthlem3 7998  grprn 8053  subgres 8113  vafval 8218  smfval 8220  vsfval 8250  domval 10626  codval 10627  idval 10628  cmpval 10629
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-12 970  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 983  df-sb 1174  df-clab 1467  df-cleq 1472  df-clel 1475  df-in 2054  df-ss 2056  df-fn 3199  df-f 3200  df-fo 3202
Copyright terms: Public domain