Theorem funcnv 6561

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 6560 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 5891	. . . . . 6 ⊢ (𝑥𝐴𝑦 → 𝑦 ∈ ran 𝐴)
4	3	pm4.71ri 565	. . . . 5 ⊢ (𝑥𝐴𝑦 ↔ (𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦))
5	4	mobii 2552	. . . 4 ⊢ (∃*𝑥 𝑥𝐴𝑦 ↔ ∃*𝑥(𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦))
6		moanimv 2623	. . . 4 ⊢ (∃*𝑥(𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦) ↔ (𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
7	5, 6	bitri 276	. . 3 ⊢ (∃*𝑥 𝑥𝐴𝑦 ↔ (𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
8	7	albii 1826	. 2 ⊢ (∀𝑦∃*𝑥 𝑥𝐴𝑦 ↔ ∀𝑦(𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
9		funcnv2 6560	. 2 ⊢ (Fun ◡𝐴 ↔ ∀𝑦∃*𝑥 𝑥𝐴𝑦)
10		df-ral 3055	. 2 ⊢ (∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦 ↔ ∀𝑦(𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
11	8, 9, 10	3bitr4i 304	1 ⊢ (Fun ◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396  ∀wal 1545   ∈ wcel 2119  ∃*wmo 2541  ∀wral 3054   class class class wbr 5079  ^◡ccnv 5624  ran crn 5626  Fun wfun 6486

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2712  ax-sep 5225  ax-pr 5369

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-mo 2543  df-clab 2719  df-cleq 2732  df-clel 2815  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-br 5080  df-opab 5142  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-fun 6494

This theorem is referenced by:  funcnv3  6562  fncnv  6565