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

Theorem dffun7 5903
 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 5904 shows that it doesn't matter which meaning we pick.) (Contributed by NM, 4-Nov-2002.)
Assertion
Ref Expression
dffun7 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦))
Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem dffun7
StepHypRef Expression
1 dffun6 5891 . 2 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))
2 moabs 2499 . . . . . 6 (∃*𝑦 𝑥𝐴𝑦 ↔ (∃𝑦 𝑥𝐴𝑦 → ∃*𝑦 𝑥𝐴𝑦))
3 vex 3198 . . . . . . . 8 𝑥 ∈ V
43eldm 5310 . . . . . . 7 (𝑥 ∈ dom 𝐴 ↔ ∃𝑦 𝑥𝐴𝑦)
54imbi1i 339 . . . . . 6 ((𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦) ↔ (∃𝑦 𝑥𝐴𝑦 → ∃*𝑦 𝑥𝐴𝑦))
62, 5bitr4i 267 . . . . 5 (∃*𝑦 𝑥𝐴𝑦 ↔ (𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦))
76albii 1745 . . . 4 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥(𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦))
8 df-ral 2914 . . . 4 (∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥(𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦))
97, 8bitr4i 267 . . 3 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦)
109anbi2i 729 . 2 ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦))
111, 10bitri 264 1 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384  ∀wal 1479  ∃wex 1702   ∈ wcel 1988  ∃*wmo 2469  ∀wral 2909   class class class wbr 4644  dom cdm 5104  Rel wrel 5109  Fun wfun 5870 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1720  ax-4 1735  ax-5 1837  ax-6 1886  ax-7 1933  ax-9 1997  ax-10 2017  ax-11 2032  ax-12 2045  ax-13 2244  ax-ext 2600  ax-sep 4772  ax-nul 4780  ax-pr 4897 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1484  df-ex 1703  df-nf 1708  df-sb 1879  df-eu 2472  df-mo 2473  df-clab 2607  df-cleq 2613  df-clel 2616  df-nfc 2751  df-ral 2914  df-rab 2918  df-v 3197  df-dif 3570  df-un 3572  df-in 3574  df-ss 3581  df-nul 3908  df-if 4078  df-sn 4169  df-pr 4171  df-op 4175  df-br 4645  df-opab 4704  df-id 5014  df-cnv 5112  df-co 5113  df-dm 5114  df-fun 5878 This theorem is referenced by:  dffun8  5904  dffun9  5905  brdom5  9336  imasaddfnlem  16169  imasvscafn  16178  funressnfv  40971
 Copyright terms: Public domain W3C validator