funcnv3 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > funcnv3		Structured version Visualization version GIF version

Theorem funcnv3 6488

Description: A condition showing a class is single-rooted. (See funcnv 6487). (Contributed by NM, 26-May-2006.)

**Assertion**
Ref	Expression
funcnv3	⊢ (Fun ^◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦)

Distinct variable group: 𝑥,𝑦,𝐴

**Proof of Theorem funcnv3**
Step	Hyp	Ref	Expression
1		dfrn2 5786	. . . . . 6 ⊢ ran 𝐴 = {𝑦 ∣ ∃𝑥 𝑥𝐴𝑦}
2	1	abeq2i 2874	. . . . 5 ⊢ (𝑦 ∈ ran 𝐴 ↔ ∃𝑥 𝑥𝐴𝑦)
3	2	biimpi 215	. . . 4 ⊢ (𝑦 ∈ ran 𝐴 → ∃𝑥 𝑥𝐴𝑦)
4	3	biantrurd 532	. . 3 ⊢ (𝑦 ∈ ran 𝐴 → (∃𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃𝑥 𝑥𝐴𝑦)))
5	4	ralbiia 3089	. 2 ⊢ (∀𝑦 ∈ ran 𝐴∃𝑥 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃𝑥 𝑥𝐴𝑦))
6		funcnv 6487	. 2 ⊢ (Fun ^◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)
7		df-reu 3070	. . . 4 ⊢ (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴 ∧ 𝑥𝐴𝑦))
8		vex 3426	. . . . . . 7 ⊢ 𝑥 ∈ V
9		vex 3426	. . . . . . 7 ⊢ 𝑦 ∈ V
10	8, 9	breldm 5806	. . . . . 6 ⊢ (𝑥𝐴𝑦 → 𝑥 ∈ dom 𝐴)
11	10	pm4.71ri 560	. . . . 5 ⊢ (𝑥𝐴𝑦 ↔ (𝑥 ∈ dom 𝐴 ∧ 𝑥𝐴𝑦))
12	11	eubii 2585	. . . 4 ⊢ (∃!𝑥 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴 ∧ 𝑥𝐴𝑦))
13		df-eu 2569	. . . 4 ⊢ (∃!𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
14	7, 12, 13	3bitr2i 298	. . 3 ⊢ (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
15	14	ralbii 3090	. 2 ⊢ (∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
16	5, 6, 15	3bitr4i 302	1 ⊢ (Fun ^◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦)

Colors of variables: wff setvar class

Syntax hints: ↔ wb 205 ∧ wa 395 ∃wex 1783 ∈ wcel 2108 ∃*wmo 2538 ∃!weu 2568 ∀wral 3063 ∃!wreu 3065 class class class wbr 5070 ^◡ccnv 5579 dom cdm 5580 ran crn 5581 Fun wfun 6412

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pr 5347

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ral 3068 df-reu 3070 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-sn 4559 df-pr 4561 df-op 4565 df-br 5071 df-opab 5133 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-fun 6420

This theorem is referenced by: (None)

W3C validator