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 6607

Description: A condition showing a class is single-rooted. (See funcnv 6606). (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 5876	. . . . . 6 ⊢ ran 𝐴 = {𝑦 ∣ ∃𝑥 𝑥𝐴𝑦}
2	1	eqabri 2904	. . . . 5 ⊢ (𝑦 ∈ ran 𝐴 ↔ ∃𝑥 𝑥𝐴𝑦)
3	2	biimpi 219	. . . 4 ⊢ (𝑦 ∈ ran 𝐴 → ∃𝑥 𝑥𝐴𝑦)
4	3	biantrurd 542	. . 3 ⊢ (𝑦 ∈ ran 𝐴 → (∃𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃𝑥 𝑥𝐴𝑦)))
5	4	ralbiia 3108	. 2 ⊢ (∀𝑦 ∈ ran 𝐴∃𝑥 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃𝑥 𝑥𝐴𝑦))
6		funcnv 6606	. 2 ⊢ (Fun ^◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)
7		df-reu 3368	. . . 4 ⊢ (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴 ∧ 𝑥𝐴𝑦))
8		vex 3457	. . . . . . 7 ⊢ 𝑥 ∈ V
9		vex 3457	. . . . . . 7 ⊢ 𝑦 ∈ V
10	8, 9	breldm 5896	. . . . . 6 ⊢ (𝑥𝐴𝑦 → 𝑥 ∈ dom 𝐴)
11	10	pm4.71ri 570	. . . . 5 ⊢ (𝑥𝐴𝑦 ↔ (𝑥 ∈ dom 𝐴 ∧ 𝑥𝐴𝑦))
12	11	eubii 2612	. . . 4 ⊢ (∃!𝑥 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴 ∧ 𝑥𝐴𝑦))
13		df-eu 2596	. . . 4 ⊢ (∃!𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
14	7, 12, 13	3bitr2i 302	. . 3 ⊢ (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
15	14	ralbii 3110	. 2 ⊢ (∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃*𝑥 𝑥𝐴𝑦))
16	5, 6, 15	3bitr4i 306	1 ⊢ (Fun ^◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦)

Colors of variables: wff setvar class

This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 ∃wex 1812 ∈ wcel 2145 ∃*wmo 2564 ∃!weu 2595 ∀wral 3078 ∃!wreu 3365 class class class wbr 5107 ^◡ccnv 5658 dom cdm 5659 ran crn 5660 Fun wfun 6531

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-fun 6539

This theorem is used by: cantnf2 44168

W3C validator