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 38969
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 38968 . 2 Suc = ran SucMap
2 df-sucmap 38961 . . 3 SucMap = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
32rneqi 5913 . 2 ran SucMap = ran {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
4 rnopab 5930 . 2 ran {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛} = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
51, 3, 43eqtri 2789 1 Suc = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
Colors of variables: wff setvar class
Syntax hints:   = wceq 1560  wex 1799  {cab 2740  {copab 5162  ran crn 5648  suc csuc 6348   SucMap csucmap 38677   Suc csuccl 38678
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-pr 5390
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-rab 3415  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-sn 4583  df-pr 4585  df-op 4589  df-br 5101  df-opab 5163  df-cnv 5655  df-dm 5657  df-rn 5658  df-sucmap 38961  df-succl 38968
This theorem is referenced by:  dfsuccl3  38972
  Copyright terms: Public domain W3C validator