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

Theorem dffun7 5553
 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 5554 shows that it doesn't matter which meaning we pick.) (Contributed by NM, 4-Nov-2002.)
Assertion
Ref Expression
dffun7
Distinct variable group:   ,,

Proof of Theorem dffun7
StepHypRef Expression
1 dffun6 5542 . 2
2 moabs 2297 . . . . . 6
3 vex 3081 . . . . . . . 8
43eldm 5146 . . . . . . 7
54imbi1i 325 . . . . . 6
62, 5bitr4i 252 . . . . 5
76albii 1611 . . . 4
8 df-ral 2804 . . . 4
97, 8bitr4i 252 . . 3
109anbi2i 694 . 2
111, 10bitri 249 1
 Colors of variables: wff setvar class Syntax hints:   wi 4   wb 184   wa 369  wal 1368  wex 1587   wcel 1758  wmo 2263  wral 2799   class class class wbr 4401   cdm 4949   wrel 4954   wfun 5521 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1592  ax-4 1603  ax-5 1671  ax-6 1710  ax-7 1730  ax-9 1762  ax-10 1777  ax-11 1782  ax-12 1794  ax-13 1955  ax-ext 2432  ax-sep 4522  ax-nul 4530  ax-pr 4640 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 967  df-tru 1373  df-ex 1588  df-nf 1591  df-sb 1703  df-eu 2266  df-mo 2267  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2650  df-ral 2804  df-rab 2808  df-v 3080  df-dif 3440  df-un 3442  df-in 3444  df-ss 3451  df-nul 3747  df-if 3901  df-sn 3987  df-pr 3989  df-op 3993  df-br 4402  df-opab 4460  df-id 4745  df-cnv 4957  df-co 4958  df-dm 4959  df-fun 5529 This theorem is referenced by:  dffun8  5554  dffun9  5555  brdom5  8808  imasaddfnlem  14586  imasvscafn  14595  funressnfv  30183
 Copyright terms: Public domain W3C validator