Theorem onsucrn 44413

Description: The successor operation is surjective onto its range, the class of successor ordinals. Lemma 1.17 of [Schloeder] p. 2. (Contributed by RP, 18-Jan-2025.)

Hypothesis

Ref	Expression
onsucrn.f	⊢ 𝐹 = (𝑥 ∈ On ↦ suc 𝑥)

Assertion

Ref	Expression
onsucrn	⊢ ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏}

Distinct variable group:   𝑎,𝑏,𝑥

Allowed substitution hints:   𝐹(𝑥, 𝑎, 𝑏)

Proof of Theorem onsucrn

Step	Hyp	Ref	Expression
1		simpr 490	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 = suc 𝑥)
2		onsuc 7831	. . . . . . . 8 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On)
3	2	adantr 486	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → suc 𝑥 ∈ On)
4	1, 3	eqeltrd 2863	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 ∈ On)
5	4	rexlimiva 3158	. . . . 5 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 → 𝑎 ∈ On)
6	5	pm4.71ri 570	. . . 4 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥))
7		suceq 6437	. . . . . . 7 ⊢ (𝑥 = 𝑏 → suc 𝑥 = suc 𝑏)
8	7	eqeq2d 2774	. . . . . 6 ⊢ (𝑥 = 𝑏 → (𝑎 = suc 𝑥 ↔ 𝑎 = suc 𝑏))
9	8	cbvrexvw 3244	. . . . 5 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ ∃𝑏 ∈ On 𝑎 = suc 𝑏)
10	9	anbi2i 635	. . . 4 ⊢ ((𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥) ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
11	6, 10	bitri 278	. . 3 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
12	11	abbii 2830	. 2 ⊢ {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
13		onsucrn.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ On ↦ suc 𝑥)
14	13	rnmpt 5943	. 2 ⊢ ran 𝐹 = {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥}
15		df-rab 3416	. 2 ⊢ {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
16	12, 14, 15	3eqtr4i 2796	1 ⊢ ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏}

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1569   ∈ wcel 2146  {cab 2741  ∃wrex 3089  {crab 3415   ↦ cmpt 5188  ran crn 5655  Oncon0 6368  suc csuc 6370

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-pr 5394  ax-un 7758

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-ss 3900  df-pss 4016  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-tr 5215  df-eprel 5554  df-po 5562  df-so 5563  df-fr 5607  df-we 5609  df-cnv 5662  df-dm 5664  df-rn 5665  df-ord 6371  df-on 6372  df-suc 6374

This theorem is used by:  onsucf1o  44414