Theorem dffun8 6568

Description: Alternate definition of a function. One possibility for the definition of a function in [Enderton] p. 42. Compare dffun7 6567. (Contributed by NM, 4-Nov-2002.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)

Assertion

Ref	Expression
dffun8	⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃!𝑦 𝑥𝐴𝑦))

Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem dffun8

Step	Hyp	Ref	Expression
1		dffun7 6567	. 2 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦))
2		moeu 2613	. . . . 5 ⊢ (∃*𝑦 𝑥𝐴𝑦 ↔ (∃𝑦 𝑥𝐴𝑦 → ∃!𝑦 𝑥𝐴𝑦))
3		vex 3461	. . . . . . 7 ⊢ 𝑥 ∈ V
4	3	eldm 5892	. . . . . 6 ⊢ (𝑥 ∈ dom 𝐴 ↔ ∃𝑦 𝑥𝐴𝑦)
5		pm5.5 364	. . . . . 6 ⊢ (∃𝑦 𝑥𝐴𝑦 → ((∃𝑦 𝑥𝐴𝑦 → ∃!𝑦 𝑥𝐴𝑦) ↔ ∃!𝑦 𝑥𝐴𝑦))
6	4, 5	sylbi 220	. . . . 5 ⊢ (𝑥 ∈ dom 𝐴 → ((∃𝑦 𝑥𝐴𝑦 → ∃!𝑦 𝑥𝐴𝑦) ↔ ∃!𝑦 𝑥𝐴𝑦))
7	2, 6	bitrid 286	. . . 4 ⊢ (𝑥 ∈ dom 𝐴 → (∃*𝑦 𝑥𝐴𝑦 ↔ ∃!𝑦 𝑥𝐴𝑦))
8	7	ralbiia 3111	. . 3 ⊢ (∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑥 ∈ dom 𝐴∃!𝑦 𝑥𝐴𝑦)
9	8	anbi2i 635	. 2 ⊢ ((Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃!𝑦 𝑥𝐴𝑦))
10	1, 9	bitri 278	1 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃!𝑦 𝑥𝐴𝑦))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∃wex 1812   ∈ wcel 2146  ∃*wmo 2567  ∃!weu 2598  ∀wral 3081   class class class wbr 5111  dom cdm 5663  Rel wrel 5668  Fun wfun 6534

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-fun 6542

This theorem is used by:  dfdfat2  47925