Theorem dfrnf 5932

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

Hypotheses

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

Assertion

Ref	Expression
dfrnf	⊢ ran 𝐴 = {𝑦 ∣ ∃𝑥 𝑥𝐴𝑦}

Distinct variable group:   𝑥,𝑦

Allowed substitution hints:   𝐴(𝑥, 𝑦)

Proof of Theorem dfrnf

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

Step	Hyp	Ref	Expression
1		dfrn2 5870	. 2 ⊢ ran 𝐴 = {𝑤 ∣ ∃𝑣 𝑣𝐴𝑤}
2		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑥𝑣
3		dfrnf.1	. . . . 5 ⊢ Ⅎ𝑥𝐴
4		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑥𝑤
5	2, 3, 4	nfbr 5152	. . . 4 ⊢ Ⅎ𝑥 𝑣𝐴𝑤
6		nfv 1947	. . . 4 ⊢ Ⅎ𝑣 𝑥𝐴𝑤
7		breq1 5106	. . . 4 ⊢ (𝑣 = 𝑥 → (𝑣𝐴𝑤 ↔ 𝑥𝐴𝑤))
8	5, 6, 7	cbvexv1 2372	. . 3 ⊢ (∃𝑣 𝑣𝐴𝑤 ↔ ∃𝑥 𝑥𝐴𝑤)
9	8	abbii 2828	. 2 ⊢ {𝑤 ∣ ∃𝑣 𝑣𝐴𝑤} = {𝑤 ∣ ∃𝑥 𝑥𝐴𝑤}
10		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑦𝑥
11		dfrnf.2	. . . . 5 ⊢ Ⅎ𝑦𝐴
12		nfcv 2923	. . . . 5 ⊢ Ⅎ𝑦𝑤
13	10, 11, 12	nfbr 5152	. . . 4 ⊢ Ⅎ𝑦 𝑥𝐴𝑤
14	13	nfex 2355	. . 3 ⊢ Ⅎ𝑦∃𝑥 𝑥𝐴𝑤
15		nfv 1947	. . 3 ⊢ Ⅎ𝑤∃𝑥 𝑥𝐴𝑦
16		breq2 5107	. . . 4 ⊢ (𝑤 = 𝑦 → (𝑥𝐴𝑤 ↔ 𝑥𝐴𝑦))
17	16	exbidv 1954	. . 3 ⊢ (𝑤 = 𝑦 → (∃𝑥 𝑥𝐴𝑤 ↔ ∃𝑥 𝑥𝐴𝑦))
18	14, 15, 17	cbvabw 2832	. 2 ⊢ {𝑤 ∣ ∃𝑥 𝑥𝐴𝑤} = {𝑦 ∣ ∃𝑥 𝑥𝐴𝑦}
19	1, 9, 18	3eqtri 2788	1 ⊢ ran 𝐴 = {𝑦 ∣ ∃𝑥 𝑥𝐴𝑦}

This proof depends on syntax axioms:   = wceq 1570  ∃wex 1812  {cab 2739  Ⅎwnfc 2908   class class class wbr 5103  ran crn 5652

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-pr 5391

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 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-cnv 5659  df-dm 5661  df-rn 5662

This theorem is used by:  rnopab  5936