Theorem dfrn5 36009

Description: Definition of range in terms of 2^nd and image. (Contributed by Scott Fenton, 17-Apr-2014.) (Revised by Mario Carneiro, 19-Apr-2014.) (Proof shortened by Peter Mazsa, 2-Oct-2022.)

Assertion

Ref	Expression
dfrn5	⊢ ran 𝐴 = ((2nd ↾ (V × V)) “ 𝐴)

Proof of Theorem dfrn5

Dummy variables 𝑝 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		excom 2173	. . . 4 ⊢ (∃𝑦∃𝑝∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)) ↔ ∃𝑝∃𝑦∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
2		opex 5410	. . . . . . . 8 ⊢ ⟨𝑦, 𝑧⟩ ∈ V
3		breq1 5082	. . . . . . . . . 10 ⊢ (𝑝 = ⟨𝑦, 𝑧⟩ → (𝑝2nd 𝑥 ↔ ⟨𝑦, 𝑧⟩2nd 𝑥))
4		eleq1 2828	. . . . . . . . . 10 ⊢ (𝑝 = ⟨𝑦, 𝑧⟩ → (𝑝 ∈ 𝐴 ↔ ⟨𝑦, 𝑧⟩ ∈ 𝐴))
5	3, 4	anbi12d 638	. . . . . . . . 9 ⊢ (𝑝 = ⟨𝑦, 𝑧⟩ → ((𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴) ↔ (⟨𝑦, 𝑧⟩2nd 𝑥 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝐴)))
6		vex 3436	. . . . . . . . . . . 12 ⊢ 𝑦 ∈ V
7		vex 3436	. . . . . . . . . . . 12 ⊢ 𝑧 ∈ V
8	6, 7	br2ndeq 36007	. . . . . . . . . . 11 ⊢ (⟨𝑦, 𝑧⟩2nd 𝑥 ↔ 𝑥 = 𝑧)
9		equcom 2025	. . . . . . . . . . 11 ⊢ (𝑥 = 𝑧 ↔ 𝑧 = 𝑥)
10	8, 9	bitri 276	. . . . . . . . . 10 ⊢ (⟨𝑦, 𝑧⟩2nd 𝑥 ↔ 𝑧 = 𝑥)
11	10	anbi1i 630	. . . . . . . . 9 ⊢ ((⟨𝑦, 𝑧⟩2nd 𝑥 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝐴) ↔ (𝑧 = 𝑥 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝐴))
12	5, 11	bitrdi 288	. . . . . . . 8 ⊢ (𝑝 = ⟨𝑦, 𝑧⟩ → ((𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴) ↔ (𝑧 = 𝑥 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝐴)))
13	2, 12	ceqsexv 3481	. . . . . . 7 ⊢ (∃𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)) ↔ (𝑧 = 𝑥 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝐴))
14	13	exbii 1855	. . . . . 6 ⊢ (∃𝑧∃𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)) ↔ ∃𝑧(𝑧 = 𝑥 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝐴))
15		excom 2173	. . . . . 6 ⊢ (∃𝑧∃𝑝(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)) ↔ ∃𝑝∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
16		vex 3436	. . . . . . 7 ⊢ 𝑥 ∈ V
17		opeq2 4812	. . . . . . . 8 ⊢ (𝑧 = 𝑥 → ⟨𝑦, 𝑧⟩ = ⟨𝑦, 𝑥⟩)
18	17	eleq1d 2825	. . . . . . 7 ⊢ (𝑧 = 𝑥 → (⟨𝑦, 𝑧⟩ ∈ 𝐴 ↔ ⟨𝑦, 𝑥⟩ ∈ 𝐴))
19	16, 18	ceqsexv 3481	. . . . . 6 ⊢ (∃𝑧(𝑧 = 𝑥 ∧ ⟨𝑦, 𝑧⟩ ∈ 𝐴) ↔ ⟨𝑦, 𝑥⟩ ∈ 𝐴)
20	14, 15, 19	3bitr3ri 303	. . . . 5 ⊢ (⟨𝑦, 𝑥⟩ ∈ 𝐴 ↔ ∃𝑝∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
21	20	exbii 1855	. . . 4 ⊢ (∃𝑦⟨𝑦, 𝑥⟩ ∈ 𝐴 ↔ ∃𝑦∃𝑝∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
22		ancom 461	. . . . . 6 ⊢ ((𝑝 ∈ 𝐴 ∧ 𝑝(2nd ↾ (V × V))𝑥) ↔ (𝑝(2nd ↾ (V × V))𝑥 ∧ 𝑝 ∈ 𝐴))
23		anass 469	. . . . . . 7 ⊢ (((∃𝑦∃𝑧 𝑝 = ⟨𝑦, 𝑧⟩ ∧ 𝑝2nd 𝑥) ∧ 𝑝 ∈ 𝐴) ↔ (∃𝑦∃𝑧 𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
24	16	brresi 5947	. . . . . . . . 9 ⊢ (𝑝(2nd ↾ (V × V))𝑥 ↔ (𝑝 ∈ (V × V) ∧ 𝑝2nd 𝑥))
25		elvv 5700	. . . . . . . . . 10 ⊢ (𝑝 ∈ (V × V) ↔ ∃𝑦∃𝑧 𝑝 = ⟨𝑦, 𝑧⟩)
26	25	anbi1i 630	. . . . . . . . 9 ⊢ ((𝑝 ∈ (V × V) ∧ 𝑝2nd 𝑥) ↔ (∃𝑦∃𝑧 𝑝 = ⟨𝑦, 𝑧⟩ ∧ 𝑝2nd 𝑥))
27	24, 26	bitri 276	. . . . . . . 8 ⊢ (𝑝(2nd ↾ (V × V))𝑥 ↔ (∃𝑦∃𝑧 𝑝 = ⟨𝑦, 𝑧⟩ ∧ 𝑝2nd 𝑥))
28	27	anbi1i 630	. . . . . . 7 ⊢ ((𝑝(2nd ↾ (V × V))𝑥 ∧ 𝑝 ∈ 𝐴) ↔ ((∃𝑦∃𝑧 𝑝 = ⟨𝑦, 𝑧⟩ ∧ 𝑝2nd 𝑥) ∧ 𝑝 ∈ 𝐴))
29		19.41vv 1957	. . . . . . 7 ⊢ (∃𝑦∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)) ↔ (∃𝑦∃𝑧 𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
30	23, 28, 29	3bitr4i 304	. . . . . 6 ⊢ ((𝑝(2nd ↾ (V × V))𝑥 ∧ 𝑝 ∈ 𝐴) ↔ ∃𝑦∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
31	22, 30	bitri 276	. . . . 5 ⊢ ((𝑝 ∈ 𝐴 ∧ 𝑝(2nd ↾ (V × V))𝑥) ↔ ∃𝑦∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
32	31	exbii 1855	. . . 4 ⊢ (∃𝑝(𝑝 ∈ 𝐴 ∧ 𝑝(2nd ↾ (V × V))𝑥) ↔ ∃𝑝∃𝑦∃𝑧(𝑝 = ⟨𝑦, 𝑧⟩ ∧ (𝑝2nd 𝑥 ∧ 𝑝 ∈ 𝐴)))
33	1, 21, 32	3bitr4i 304	. . 3 ⊢ (∃𝑦⟨𝑦, 𝑥⟩ ∈ 𝐴 ↔ ∃𝑝(𝑝 ∈ 𝐴 ∧ 𝑝(2nd ↾ (V × V))𝑥))
34	16	elrn2 5841	. . 3 ⊢ (𝑥 ∈ ran 𝐴 ↔ ∃𝑦⟨𝑦, 𝑥⟩ ∈ 𝐴)
35	16	elima2 6025	. . 3 ⊢ (𝑥 ∈ ((2nd ↾ (V × V)) “ 𝐴) ↔ ∃𝑝(𝑝 ∈ 𝐴 ∧ 𝑝(2nd ↾ (V × V))𝑥))
36	33, 34, 35	3bitr4i 304	. 2 ⊢ (𝑥 ∈ ran 𝐴 ↔ 𝑥 ∈ ((2nd ↾ (V × V)) “ 𝐴))
37	36	eqriv 2737	1 ⊢ ran 𝐴 = ((2nd ↾ (V × V)) “ 𝐴)

Syntax hints:   ∧ wa 396   = wceq 1547  ∃wex 1786   ∈ wcel 2119  Vcvv 3432  ⟨cop 4568   class class class wbr 5079   × cxp 5623  ran crn 5626   ↾ cres 5627   “ cima 5628  2^nd c2nd 7937

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369  ax-un 7685

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fo 6498  df-fv 6500  df-2nd 7939

This theorem is referenced by:  brrange  36167