Users' Mathboxes Mathbox for Peter Mazsa < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dfsuccl2 Structured version   Visualization version   GIF version

Theorem dfsuccl2 38583
Description: Alternate definition of the class of all successors. (Contributed by Peter Mazsa, 29-Jan-2026.)
Assertion
Ref Expression
dfsuccl2 Suc = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
Distinct variable group:   𝑚,𝑛

Proof of Theorem dfsuccl2
StepHypRef Expression
1 df-succl 38582 . 2 Suc = ran SucMap
2 df-sucmap 38575 . . 3 SucMap = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
32rneqi 5884 . 2 ran SucMap = ran {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
4 rnopab 5901 . 2 ran {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛} = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
51, 3, 43eqtri 2761 1 Suc = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1541  wex 1780  {cab 2712  {copab 5158  ran crn 5623  suc csuc 6317   SucMap csucmap 38317   Suc csuccl 38318
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-ss 3916  df-nul 4284  df-if 4478  df-sn 4579  df-pr 4581  df-op 4585  df-br 5097  df-opab 5159  df-cnv 5630  df-dm 5632  df-rn 5633  df-sucmap 38575  df-succl 38582
This theorem is referenced by:  dfsuccl3  38586
  Copyright terms: Public domain W3C validator