Theorem funcnv 6610

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 6609 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 3472	. . . . . . 7 ⊢ 𝑥 ∈ V
2		vex 3472	. . . . . . 7 ⊢ 𝑦 ∈ V
3	1, 2	brelrn 5934	. . . . . 6 ⊢ (𝑥𝐴𝑦 → 𝑦 ∈ ran 𝐴)
4	3	pm4.71ri 560	. . . . 5 ⊢ (𝑥𝐴𝑦 ↔ (𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦))
5	4	mobii 2536	. . . 4 ⊢ (∃*𝑥 𝑥𝐴𝑦 ↔ ∃*𝑥(𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦))
6		moanimv 2609	. . . 4 ⊢ (∃*𝑥(𝑦 ∈ ran 𝐴 ∧ 𝑥𝐴𝑦) ↔ (𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
7	5, 6	bitri 275	. . 3 ⊢ (∃*𝑥 𝑥𝐴𝑦 ↔ (𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
8	7	albii 1813	. 2 ⊢ (∀𝑦∃*𝑥 𝑥𝐴𝑦 ↔ ∀𝑦(𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
9		funcnv2 6609	. 2 ⊢ (Fun ◡𝐴 ↔ ∀𝑦∃*𝑥 𝑥𝐴𝑦)
10		df-ral 3056	. 2 ⊢ (∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦 ↔ ∀𝑦(𝑦 ∈ ran 𝐴 → ∃*𝑥 𝑥𝐴𝑦))
11	8, 9, 10	3bitr4i 303	1 ⊢ (Fun ◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395  ∀wal 1531   ∈ wcel 2098  ∃*wmo 2526  ∀wral 3055   class class class wbr 5141  ^◡ccnv 5668  ran crn 5670  Fun wfun 6530

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-mo 2528  df-clab 2704  df-cleq 2718  df-clel 2804  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-br 5142  df-opab 5204  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-fun 6538

This theorem is referenced by:  funcnv3  6611  fncnv  6614