Theorem dffun6f 6553

Description: Definition of function, using bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 9-Mar-1995.) (Revised by Mario Carneiro, 15-Oct-2016.)

Hypotheses

Ref	Expression
dffun6f.1	⊢ Ⅎ𝑥𝐴
dffun6f.2	⊢ Ⅎ𝑦𝐴

Assertion

Ref	Expression
dffun6f	⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥, 𝑦)

Proof of Theorem dffun6f

Dummy variables 𝑤 𝑣 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dffun3 6550	. 2 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑤∃𝑢∀𝑣(𝑤𝐴𝑣 → 𝑣 = 𝑢)))
2		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑦𝑤
3		dffun6f.2	. . . . . . 7 ⊢ Ⅎ𝑦𝐴
4		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑦𝑣
5	2, 3, 4	nfbr 5151	. . . . . 6 ⊢ Ⅎ𝑦 𝑤𝐴𝑣
6		nfv 1946	. . . . . 6 ⊢ Ⅎ𝑣 𝑤𝐴𝑦
7		breq2 5106	. . . . . 6 ⊢ (𝑣 = 𝑦 → (𝑤𝐴𝑣 ↔ 𝑤𝐴𝑦))
8	5, 6, 7	cbvmow 2628	. . . . 5 ⊢ (∃*𝑣 𝑤𝐴𝑣 ↔ ∃*𝑦 𝑤𝐴𝑦)
9	8	albii 1851	. . . 4 ⊢ (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃*𝑦 𝑤𝐴𝑦)
10		dfmo 2565	. . . . 5 ⊢ (∃*𝑣 𝑤𝐴𝑣 ↔ ∃𝑢∀𝑣(𝑤𝐴𝑣 → 𝑣 = 𝑢))
11	10	albii 1851	. . . 4 ⊢ (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃𝑢∀𝑣(𝑤𝐴𝑣 → 𝑣 = 𝑢))
12		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑥𝑤
13		dffun6f.1	. . . . . . 7 ⊢ Ⅎ𝑥𝐴
14		nfcv 2922	. . . . . . 7 ⊢ Ⅎ𝑥𝑦
15	12, 13, 14	nfbr 5151	. . . . . 6 ⊢ Ⅎ𝑥 𝑤𝐴𝑦
16	15	nfmov 2585	. . . . 5 ⊢ Ⅎ𝑥∃*𝑦 𝑤𝐴𝑦
17		nfv 1946	. . . . 5 ⊢ Ⅎ𝑤∃*𝑦 𝑥𝐴𝑦
18		breq1 5105	. . . . . 6 ⊢ (𝑤 = 𝑥 → (𝑤𝐴𝑦 ↔ 𝑥𝐴𝑦))
19	18	mobidv 2574	. . . . 5 ⊢ (𝑤 = 𝑥 → (∃*𝑦 𝑤𝐴𝑦 ↔ ∃*𝑦 𝑥𝐴𝑦))
20	16, 17, 19	cbvalv1 2370	. . . 4 ⊢ (∀𝑤∃*𝑦 𝑤𝐴𝑦 ↔ ∀𝑥∃*𝑦 𝑥𝐴𝑦)
21	9, 11, 20	3bitr3ri 305	. . 3 ⊢ (∀𝑥∃*𝑦 𝑥𝐴𝑦 ↔ ∀𝑤∃𝑢∀𝑣(𝑤𝐴𝑣 → 𝑣 = 𝑢))
22	21	anbi2i 635	. 2 ⊢ ((Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦) ↔ (Rel 𝐴 ∧ ∀𝑤∃𝑢∀𝑣(𝑤𝐴𝑣 → 𝑣 = 𝑢)))
23	1, 22	bitr4i 281	1 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑥∃*𝑦 𝑥𝐴𝑦))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401  ∀wal 1567  ∃wex 1811  ∃*wmo 2562  Ⅎwnfc 2907   class class class wbr 5102  Rel wrel 5655  Fun wfun 6532

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-fun 6540

This theorem is used by:  funopab  6575  funcnvmpt  6995  dffun3f  9978