Theorem dffun6f 6576

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 6573	. 2 ⊢ (Fun 𝐴 ↔ (Rel 𝐴 ∧ ∀𝑤∃𝑢∀𝑣(𝑤𝐴𝑣 → 𝑣 = 𝑢)))
2		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑦𝑤
3		dffun6f.2	. . . . . . 7 ⊢ Ⅎ𝑦𝐴
4		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑦𝑣
5	2, 3, 4	nfbr 5156	. . . . . 6 ⊢ Ⅎ𝑦 𝑤𝐴𝑣
6		nfv 1949	. . . . . 6 ⊢ Ⅎ𝑣 𝑤𝐴𝑦
7		breq2 5110	. . . . . 6 ⊢ (𝑣 = 𝑦 → (𝑤𝐴𝑣 ↔ 𝑤𝐴𝑦))
8	5, 6, 7	cbvmow 2631	. . . . 5 ⊢ (∃*𝑣 𝑤𝐴𝑣 ↔ ∃*𝑦 𝑤𝐴𝑦)
9	8	albii 1852	. . . 4 ⊢ (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃*𝑦 𝑤𝐴𝑦)
10		dfmo 2568	. . . . 5 ⊢ (∃*𝑣 𝑤𝐴𝑣 ↔ ∃𝑢∀𝑣(𝑤𝐴𝑣 → 𝑣 = 𝑢))
11	10	albii 1852	. . . 4 ⊢ (∀𝑤∃*𝑣 𝑤𝐴𝑣 ↔ ∀𝑤∃𝑢∀𝑣(𝑤𝐴𝑣 → 𝑣 = 𝑢))
12		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑥𝑤
13		dffun6f.1	. . . . . . 7 ⊢ Ⅎ𝑥𝐴
14		nfcv 2926	. . . . . . 7 ⊢ Ⅎ𝑥𝑦
15	12, 13, 14	nfbr 5156	. . . . . 6 ⊢ Ⅎ𝑥 𝑤𝐴𝑦
16	15	nfmov 2588	. . . . 5 ⊢ Ⅎ𝑥∃*𝑦 𝑤𝐴𝑦
17		nfv 1949	. . . . 5 ⊢ Ⅎ𝑤∃*𝑦 𝑥𝐴𝑦
18		breq1 5109	. . . . . 6 ⊢ (𝑤 = 𝑥 → (𝑤𝐴𝑦 ↔ 𝑥𝐴𝑦))
19	18	mobidv 2577	. . . . 5 ⊢ (𝑤 = 𝑥 → (∃*𝑦 𝑤𝐴𝑦 ↔ ∃*𝑦 𝑥𝐴𝑦))
20	16, 17, 19	cbvalv1 2374	. . . 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 1568  ∃wex 1812  ∃*wmo 2565  Ⅎwnfc 2911   class class class wbr 5106  Rel wrel 5661  Fun wfun 6555

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-pr 5396

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-nf 1817  df-sb 2102  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-br 5107  df-opab 5172  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-fun 6563

This theorem is used by:  funopab  6598  funcnvmpt  7021  dffun3f  10005