Theorem dffun8 6576

Description: Alternate definition of a function. One possibility for the definition of a function in [Enderton] p. 42. Compare dffun7 6575. (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 6575	. 2 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥 ∈ dom 𝐴∃*𝑦 𝑥𝐴𝑦))
2		moeu 2611	. . . . 5 ⊢ (∃*𝑦 𝑥𝐴𝑦 ↔ (∃𝑦 𝑥𝐴𝑦 → ∃!𝑦 𝑥𝐴𝑦))
3		vex 3457	. . . . . . 7 ⊢ 𝑥 ∈ V
4	3	eldm 5886	. . . . . 6 ⊢ (𝑥 ∈ dom 𝐴 ↔ ∃𝑦 𝑥𝐴𝑦)
5		pm5.5 364	. . . . . 6 ⊢ (∃𝑦 𝑥𝐴𝑦 → ((∃𝑦 𝑥𝐴𝑦 → ∃!𝑦 𝑥𝐴𝑦) ↔ ∃!𝑦 𝑥𝐴𝑦))
6	4, 5	sylbi 220	. . . . 5 ⊢ (𝑥 ∈ dom 𝐴 → ((∃𝑦 𝑥𝐴𝑦 → ∃!𝑦 𝑥𝐴𝑦) ↔ ∃!𝑦 𝑥𝐴𝑦))
7	2, 6	bitrid 286	. . . 4 ⊢ (𝑥 ∈ dom 𝐴 → (∃*𝑦 𝑥𝐴𝑦 ↔ ∃!𝑦 𝑥𝐴𝑦))
8	7	ralbiia 3109	. . 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 1811   ∈ wcel 2146  ∃*wmo 2565  ∃!weu 2596  ∀wral 3079   class class class wbr 5105  dom cdm 5654  Rel wrel 5659  Fun wfun 6540

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735  ax-sep 5251  ax-pr 5394

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-br 5106  df-opab 5170  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-fun 6548

This theorem is used by:  dfdfat2  48337