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 43267
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 484 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 = suc 𝑥)
2 onsuc 7790 . . . . . . . 8 (𝑥 ∈ On → suc 𝑥 ∈ On)
32adantr 480 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → suc 𝑥 ∈ On)
41, 3eqeltrd 2829 . . . . . 6 ((𝑥 ∈ On ∧ 𝑎 = suc 𝑥) → 𝑎 ∈ On)
54rexlimiva 3127 . . . . 5 (∃𝑥 ∈ On 𝑎 = suc 𝑥𝑎 ∈ On)
65pm4.71ri 560 . . . 4 (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥))
7 suceq 6403 . . . . . . 7 (𝑥 = 𝑏 → suc 𝑥 = suc 𝑏)
87eqeq2d 2741 . . . . . 6 (𝑥 = 𝑏 → (𝑎 = suc 𝑥𝑎 = suc 𝑏))
98cbvrexvw 3217 . . . . 5 (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ ∃𝑏 ∈ On 𝑎 = suc 𝑏)
109anbi2i 623 . . . 4 ((𝑎 ∈ On ∧ ∃𝑥 ∈ On 𝑎 = suc 𝑥) ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
116, 10bitri 275 . . 3 (∃𝑥 ∈ On 𝑎 = suc 𝑥 ↔ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏))
1211abbii 2797 . 2 {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
13 onsucrn.f . . 3 𝐹 = (𝑥 ∈ On ↦ suc 𝑥)
1413rnmpt 5924 . 2 ran 𝐹 = {𝑎 ∣ ∃𝑥 ∈ On 𝑎 = suc 𝑥}
15 df-rab 3409 . 2 {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏} = {𝑎 ∣ (𝑎 ∈ On ∧ ∃𝑏 ∈ On 𝑎 = suc 𝑏)}
1612, 14, 153eqtr4i 2763 1 ran 𝐹 = {𝑎 ∈ On ∣ ∃𝑏 ∈ On 𝑎 = suc 𝑏}
Colors of variables: wff setvar class
Syntax hints:  wa 395   = wceq 1540  wcel 2109  {cab 2708  wrex 3054  {crab 3408  cmpt 5191  ran crn 5642  Oncon0 6335  suc csuc 6337
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390  ax-un 7714
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-cnv 5649  df-dm 5651  df-rn 5652  df-ord 6338  df-on 6339  df-suc 6341
This theorem is referenced by:  onsucf1o  43268
  Copyright terms: Public domain W3C validator