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

Theorem dffun7 5404
Description: Alternate definition of a function. One possibility for the definition of a function in [Enderton] p. 42. (Enderton's definition is ambiguous because "there is only one" could mean either "there is at most one" or "there is exactly one". However, dffun8 5405 shows that it does not matter which meaning we pick.) (Contributed by NM, 4-Nov-2002.)
Assertion
Ref Expression
dffun7  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x  e.  dom  A E* y  x A y ) )
Distinct variable group:    x, y, A

Proof of Theorem dffun7
StepHypRef Expression
1 dffun6 5391 . 2  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x E* y  x A y ) )
2 moabs 2136 . . . . . 6  |-  ( E* y  x A y  <-> 
( E. y  x A y  ->  E* y  x A y ) )
3 vex 2824 . . . . . . . 8  |-  x  e. 
_V
43eldm 4978 . . . . . . 7  |-  ( x  e.  dom  A  <->  E. y  x A y )
54imbi1i 238 . . . . . 6  |-  ( ( x  e.  dom  A  ->  E* y  x A y )  <->  ( E. y  x A y  ->  E* y  x A
y ) )
62, 5bitr4i 187 . . . . 5  |-  ( E* y  x A y  <-> 
( x  e.  dom  A  ->  E* y  x A y ) )
76albii 1523 . . . 4  |-  ( A. x E* y  x A y  <->  A. x ( x  e.  dom  A  ->  E* y  x A
y ) )
8 df-ral 2533 . . . 4  |-  ( A. x  e.  dom  A E* y  x A y  <->  A. x
( x  e.  dom  A  ->  E* y  x A y ) )
97, 8bitr4i 187 . . 3  |-  ( A. x E* y  x A y  <->  A. x  e.  dom  A E* y  x A y )
109anbi2i 461 . 2  |-  ( ( Rel  A  /\  A. x E* y  x A y )  <->  ( Rel  A  /\  A. x  e. 
dom  A E* y  x A y ) )
111, 10bitri 184 1  |-  ( Fun 
A  <->  ( Rel  A  /\  A. x  e.  dom  A E* y  x A y ) )
Colors of variables:    wff set class
This proof depends on syntax axioms:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1400   E.wex 1545   E*wmo 2087    e. wcel 2209   A.wral 2528   class class class wbr 4130   dom cdm 4774   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-dm 4784  df-fun 5379
This theorem is used by:  dffun8  5405  dffun9  5406  funco  5417  funimaexglem  5464  frecuzrdgtcl  10849  frecuzrdgfunlem  10856  imasaddfnlemg  13635
  Copyright terms: Public domain W3C validator