Theorem funcnv 6503

Description: The converse of a class is a function iff the class is single-rooted, which means that for any 𝑦 in the range of 𝐴 there is at most one 𝑥 such that 𝑥𝐴𝑦. Definition of single-rooted in [Enderton] p. 43. See funcnv2 6502 for a simpler version. (Contributed by NM, 13-Aug-2004.)

Assertion

Ref	Expression
funcnv	⊢ (Fun ◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)

Distinct variable group:   𝑥,𝑦,𝐴

Proof of Theorem funcnv

Step	Hyp	Ref	Expression
1		vex 3436	. . . . . . 7 ⊢ 𝑥 ∈ V
2		vex 3436	. . . . . . 7 ⊢ 𝑦 ∈ V
3	1, 2	brelrn 5851	. . . . . 6 ⊢ (𝑥𝐴𝑦 → 𝑦 ∈ ran 𝐴)
4	3	pm4.71ri 561	. . . . 5 ⊢ (𝑥𝐴𝑦 ↔ (𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦))
5	4	mobii 2548	. . . 4 ⊢ (∃*𝑥 𝑥𝐴𝑦 ↔ ∃*𝑥(𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦))
6		moanimv 2621	. . . 4 ⊢ (∃*𝑥(𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦) ↔ (𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
7	5, 6	bitri 274	. . 3 ⊢ (∃*𝑥 𝑥𝐴𝑦 ↔ (𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
8	7	albii 1822	. 2 ⊢ (∀𝑦∃*𝑥 𝑥𝐴𝑦 ↔ ∀𝑦(𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
9		funcnv2 6502	. 2 ⊢ (Fun ◡𝐴 ↔ ∀𝑦∃*𝑥 𝑥𝐴𝑦)
10		df-ral 3069	. 2 ⊢ (∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦 ↔ ∀𝑦(𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
11	8, 9, 10	3bitr4i 303	1 ⊢ (Fun ◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396  ∀wal 1537   ∈ wcel 2106  ∃*wmo 2538  ∀wral 3064   class class class wbr 5074  ^◡ccnv 5588  ran crn 5590  Fun wfun 6427

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pr 5352

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-sn 4562  df-pr 4564  df-op 4568  df-br 5075  df-opab 5137  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-fun 6435

This theorem is referenced by:  funcnv3  6504  fncnv  6507