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 6606

Description: A condition showing a class is single-rooted. (See funcnv 6605). (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 5877	. . . . . 6 ⊢ ran 𝐴 = {𝑦 ∣ ∃𝑥 𝑥𝐴𝑦}
2	1	eqabri 2904	. . . . 5 ⊢ (𝑦 ∈ ran 𝐴 ↔ ∃𝑥 𝑥𝐴𝑦)
3	2	biimpi 219	. . . 4 ⊢ (𝑦 ∈ ran 𝐴 → ∃𝑥 𝑥𝐴𝑦)
4	3	biantrurd 541	. . 3 ⊢ (𝑦 ∈ ran 𝐴 → (∃𝑥 𝑥𝐴𝑦 ↔ (∃𝑥 𝑥𝐴𝑦 ∧ ∃𝑥 𝑥𝐴𝑦)))
5	4	ralbiia 3108	. 2 ⊢ (∀𝑦 ∈ ran 𝐴∃𝑥 𝑥𝐴𝑦 ↔ ∀𝑦 ∈ ran 𝐴(∃𝑥 𝑥𝐴𝑦 ∧ ∃𝑥 𝑥𝐴𝑦))
6		funcnv 6605	. 2 ⊢ (Fun ^◡𝐴 ↔ ∀𝑦 ∈ ran 𝐴∃*𝑥 𝑥𝐴𝑦)
7		df-reu 3369	. . . 4 ⊢ (∃!𝑥 ∈ dom 𝐴 𝑥𝐴𝑦 ↔ ∃!𝑥(𝑥 ∈ dom 𝐴 ∧ 𝑥𝐴𝑦))
8		vex 3458	. . . . . . 7 ⊢ 𝑥 ∈ V
9		vex 3458	. . . . . . 7 ⊢ 𝑦 ∈ V
10	8, 9	breldm 5897	. . . . . 6 ⊢ (𝑥𝐴𝑦 → 𝑥 ∈ dom 𝐴)
11	10	pm4.71ri 569	. . . . 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 400 ∃wex 1808 ∈ wcel 2142 ∃*wmo 2564 ∃!weu 2595 ∀wral 3078 ∃!wreu 3366 class class class wbr 5108 ^◡ccnv 5659 dom cdm 5660 ran crn 5661 Fun wfun 6530

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-pr 5403

This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-reu 3369 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-br 5109 df-opab 5173 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-fun 6538

This theorem is used by: cantnf2 44080

W3C validator