Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  onsucrn Structured version   Visualization version   GIF version

Theorem onsucrn 44058
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
StepHypRef Expression
1 simpr 490 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 = suc 𝑥)
2 onsuc 7815 . . . . . . . 8 (𝑥 ∈ On → suc 𝑥 ∈ On)
32adantr 486 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → suc 𝑥 ∈ On)
41, 3eqeltrd 2865 . . . . . 6 ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 ∈ On)
54rexlimiva 3160 . . . . 5 (∃𝑥 ∈ On 𝑎 = suc 𝑥𝑎 ∈ On)
65pm4.71ri 570 . . . 4 (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥))
7 suceq 6433 . . . . . . 7 (𝑥 = 𝑏 → suc 𝑥 = suc 𝑏)
87eqeq2d 2776 . . . . . 6 (𝑥 = 𝑏 → (𝑎 = suc 𝑥𝑎 = suc 𝑏))
98cbvrexvw 3246 . . . . 5 (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ ∃𝑏 ∈ On 𝑎 = suc 𝑏)
109anbi2i 635 . . . 4 ((𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥) ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
116, 10bitri 278 . . 3 (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
1211abbii 2832 . 2 {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
13 onsucrn.f . . 3 𝐹 = (𝑥 ∈ On ↦ suc 𝑥)
1413rnmpt 5949 . 2 ran 𝐹 = {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥}
15 df-rab 3419 . 2 {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
1612, 14, 153eqtr4i 2798 1 ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wa 401   = wceq 1570  wcel 2146  {cab 2743  wrex 3091  {crab 3418  cmpt 5194  ran crn 5664  Oncon0 6364  suc csuc 6366
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-pr 5406  ax-un 7742
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-cnv 5671  df-dm 5673  df-rn 5674  df-ord 6367  df-on 6368  df-suc 6370
This theorem is used by:  onsucf1o  44059
  Copyright terms: Public domain W3C validator