Theorem onsucrn 43628

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 484	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 = suc 𝑥)
2		onsuc 7765	. . . . . . . 8 ⊢ (𝑥 ∈ On → suc 𝑥 ∈ On)
3	2	adantr 480	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → suc 𝑥 ∈ On)
4	1, 3	eqeltrd 2837	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 ∈ On)
5	4	rexlimiva 3131	. . . . 5 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 → 𝑎 ∈ On)
6	5	pm4.71ri 560	. . . 4 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥))
7		suceq 6393	. . . . . . 7 ⊢ (𝑥 = 𝑏 → suc 𝑥 = suc 𝑏)
8	7	eqeq2d 2748	. . . . . 6 ⊢ (𝑥 = 𝑏 → (𝑎 = suc 𝑥 ↔ 𝑎 = suc 𝑏))
9	8	cbvrexvw 3217	. . . . 5 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ ∃𝑏 ∈ On 𝑎 = suc 𝑏)
10	9	anbi2i 624	. . . 4 ⊢ ((𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥) ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
11	6, 10	bitri 275	. . 3 ⊢ (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
12	11	abbii 2804	. 2 ⊢ {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
13		onsucrn.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ On ↦ suc 𝑥)
14	13	rnmpt 5914	. 2 ⊢ ran 𝐹 = {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥}
15		df-rab 3402	. 2 ⊢ {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
16	12, 14, 15	3eqtr4i 2770	1 ⊢ ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏}

Syntax hints:   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {cab 2715  ∃wrex 3062  {crab 3401   ↦ cmpt 5181  ran crn 5633  Oncon0 6325  suc csuc 6327

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-cnv 5640  df-dm 5642  df-rn 5643  df-ord 6328  df-on 6329  df-suc 6331

This theorem is referenced by:  onsucf1o  43629