MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  svrelfun Unicode version

Theorem svrelfun 5251
Description: A single-valued relation is a function. (See fun2cnv 5250 for "single-valued.") Definition 6.4(4) of [TakeutiZaring] p. 24. (Contributed by NM, 17-Jan-2006.)
Assertion
Ref Expression
svrelfun  |-  ( Fun 
A  <->  ( Rel  A  /\  Fun  `' `' A
) )

Proof of Theorem svrelfun
StepHypRef Expression
1 dffun6 5209 . 2  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x E* y  x A y ) )
2 fun2cnv 5250 . . 3  |-  ( Fun  `' `' A  <->  A. x E* y  x A y )
32anbi2i 678 . 2  |-  ( ( Rel  A  /\  Fun  `' `' A )  <->  ( Rel  A  /\  A. x E* y  x A y ) )
41, 3bitr4i 245 1  |-  ( Fun 
A  <->  ( Rel  A  /\  Fun  `' `' A
) )
Colors of variables: wff set class
Syntax hints:    <-> wb 178    /\ wa 360   A.wal 1532   E*wmo 2119   class class class wbr 3997   `'ccnv 4660   Rel wrel 4666   Fun wfun 4667
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-5 1533  ax-6 1534  ax-7 1535  ax-gen 1536  ax-8 1623  ax-11 1624  ax-14 1626  ax-17 1628  ax-12o 1664  ax-10 1678  ax-9 1684  ax-4 1692  ax-16 1927  ax-ext 2239  ax-sep 4115  ax-nul 4123  ax-pr 4186
This theorem depends on definitions:  df-bi 179  df-or 361  df-an 362  df-3an 941  df-tru 1315  df-ex 1538  df-nf 1540  df-sb 1884  df-eu 2122  df-mo 2123  df-clab 2245  df-cleq 2251  df-clel 2254  df-nfc 2383  df-ne 2423  df-ral 2523  df-rex 2524  df-rab 2527  df-v 2765  df-dif 3130  df-un 3132  df-in 3134  df-ss 3141  df-nul 3431  df-if 3540  df-sn 3620  df-pr 3621  df-op 3623  df-br 3998  df-opab 4052  df-id 4281  df-xp 4675  df-rel 4676  df-cnv 4677  df-co 4678  df-fun 4683
  Copyright terms: Public domain W3C validator