Theorem onsucrn 43890

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 489	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 = suc 𝑥)
2		onsuc 7809	. . . . . . . 8 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On)
3	2	adantr 485	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → suc 𝑥 ∈ On)
4	1, 3	eqeltrd 2869	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 ∈ On)
5	4	rexlimiva 3164	. . . . 5 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 → 𝑎 ∈ On)
6	5	pm4.71ri 569	. . . 4 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥))
7		suceq 6430	. . . . . . 7 ⊢ (𝑥 = 𝑏 → suc 𝑥 = suc 𝑏)
8	7	eqeq2d 2780	. . . . . 6 ⊢ (𝑥 = 𝑏 → (𝑎 = suc 𝑥 ↔ 𝑎 = suc 𝑏))
9	8	cbvrexvw 3250	. . . . 5 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ ∃𝑏 ∈ On 𝑎 = suc 𝑏)
10	9	anbi2i 634	. . . 4 ⊢ ((𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥) ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
11	6, 10	bitri 278	. . 3 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
12	11	abbii 2836	. 2 ⊢ {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
13		onsucrn.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ On ↦ suc 𝑥)
14	13	rnmpt 5948	. 2 ⊢ ran 𝐹 = {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥}
15		df-rab 3424	. 2 ⊢ {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
16	12, 14, 15	3eqtr4i 2802	1 ⊢ ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏}

Syntax hints:   ∧ wa 400   = wceq 1567   ∈ wcel 2149  {cab 2747  ∃wrex 3095  {crab 3423   ↦ cmpt 5196  ran crn 5663  Oncon0 6361  suc csuc 6363

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-pr 5405  ax-un 7733

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-cnv 5670  df-dm 5672  df-rn 5673  df-ord 6364  df-on 6365  df-suc 6367

This theorem is referenced by:  onsucf1o  43891