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

Theorem dffun7 6445
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 6446 shows that it does not 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 6433 . 2 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))
2 moabs 2543 . . . . . 6 (∃*𝑦 𝑥𝐴𝑦 ↔ (∃𝑦 𝑥𝐴𝑦 → ∃*𝑦 𝑥𝐴𝑦))
3 vex 3426 . . . . . . . 8 𝑥 ∈ V
43eldm 5798 . . . . . . 7 (𝑥 ∈ dom 𝐴 ↔ ∃𝑦 𝑥𝐴𝑦)
54imbi1i 349 . . . . . 6 ((𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦) ↔ (∃𝑦 𝑥𝐴𝑦 → ∃*𝑦 𝑥𝐴𝑦))
62, 5bitr4i 277 . . . . 5 (∃*𝑦 𝑥𝐴𝑦 ↔ (𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦))
76albii 1823 . . . 4 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥(𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦))
8 df-ral 3068 . . . 4 (∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥(𝑥 ∈ dom 𝐴 → ∃*𝑦 𝑥𝐴𝑦))
97, 8bitr4i 277 . . 3 (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦)
109anbi2i 622 . 2 ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦))
111, 10bitri 274 1 (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  wal 1537  wex 1783  wcel 2108  ∃*wmo 2538  wral 3063   class class class wbr 5070  dom cdm 5580  Rel wrel 5585  Fun wfun 6412
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pr 5347
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ral 3068  df-rab 3072  df-v 3424  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-sn 4559  df-pr 4561  df-op 4565  df-br 5071  df-opab 5133  df-id 5480  df-cnv 5588  df-co 5589  df-dm 5590  df-fun 6420
This theorem is referenced by:  dffun8  6446  dffun9  6447  brdom5  10216  imasaddfnlem  17156  imasvscafn  17165  funressnfv  44424
  Copyright terms: Public domain W3C validator