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

Theorem dffun6 5391
Description: Alternate definition of a function using "at most one" notation. (Contributed by NM, 9-Mar-1995.)
Assertion
Ref Expression
dffun6  |-  ( Fun 
F  <->  ( Rel  F  /\  A. x E* y  x F y ) )
Distinct variable group:    x, y, F

Proof of Theorem dffun6
StepHypRef Expression
1 nfcv 2392 . 2  |-  F/_ x F
2 nfcv 2392 . 2  |-  F/_ y F
31, 2dffun6f 5390 1  |-  ( Fun 
F  <->  ( Rel  F  /\  A. x E* y  x F y ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    /\ wa 104    <-> wb 105   A.wal 1400   E*wmo 2087   class class class wbr 4130   Rel wrel 4779   Fun wfun 5371
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-id 4438  df-cnv 4782  df-co 4783  df-fun 5379
This theorem is used by:  funmo  5392  dffun7  5404  fununfun  5424  funcnvsn  5426  funcnv2  5441  svrelfun  5446  fnres  5500  nfunsn  5733  shftfn  11589  dvfgg  15789
  Copyright terms: Public domain W3C validator