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 39119
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 39118 . 2 Suc = ran SucMap
2 df-sucmap 39111 . . 3 SucMap = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
32rneqi 5927 . 2 ran SucMap = ran {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
4 rnopab 5944 . 2 ran {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛} = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
51, 3, 43eqtri 2790 1 Suc = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1570  wex 1809  {cab 2741  {copab 5173  ran crn 5662  suc csuc 6362   SucMap csucmap 38827   Suc csuccl 38828
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-cnv 5669  df-dm 5671  df-rn 5672  df-sucmap 39111  df-succl 39118
This theorem is referenced by:  dfsuccl3  39122
  Copyright terms: Public domain W3C validator