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

Theorem dffunmo 3517
Description: Alternate definition of a function using "at most one" notation.
Assertion
Ref Expression
dffunmo |- (Fun A <-> (Rel A /\ A.xE*y xAy))
Distinct variable group:   x,y,A

Proof of Theorem dffunmo
StepHypRef Expression
1 ax-17 968 . 2 |- (z e. A -> A.x z e. A)
2 ax-17 968 . 2 |- (z e. A -> A.y z e. A)
31, 2dffunmof 3516 1 |- (Fun A <-> (Rel A /\ A.xE*y xAy))
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223  A.wal 951   e. wcel 955  E*wmo 1374   class class class wbr 2609  Rel wrel 3165  Fun wfun 3166
This theorem is referenced by:  funmo 3518  dffun6 3525  funco 3536  funcnv2 3542  svrelfun 3546  funin 3552  fconst 3643  f11 3649  dff2 3802  brdom3 4773
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 959  ax-gen 960  ax-8 961  ax-10 963  ax-11 964  ax-12 965  ax-13 966  ax-14 967  ax-17 968  ax-4 970  ax-5o 972  ax-6o 975  ax-9o 1119  ax-10o 1136  ax-16 1206  ax-11o 1213  ax-ext 1452  ax-sep 2693  ax-pow 2732  ax-pr 2769
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 978  df-sb 1168  df-eu 1375  df-mo 1376  df-clab 1457  df-cleq 1462  df-clel 1465  df-ne 1579  df-v 1803  df-dif 2039  df-un 2040  df-in 2041  df-ss 2043  df-nul 2271  df-pw 2392  df-sn 2402  df-pr 2403  df-op 2406  df-br 2610  df-opab 2657  df-id 2824  df-cnv 3176  df-co 3177  df-fun 3182
Copyright terms: Public domain