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 39668
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 39667 . 2 Suc = ran SucMap
2 df-sucmap 39660 . . 3 SucMap = {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
32rneqi 5931 . 2 ran SucMap = ran {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛}
4 rnopab 5948 . 2 ran {⟨𝑚, 𝑛⟩ ∣ suc 𝑚 = 𝑛} = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
51, 3, 43eqtri 2790 1 Suc = {𝑛 ∣ ∃𝑚 suc 𝑚 = 𝑛}
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   = wceq 1570  ∃wex 1812  {cab 2741  {copab 5173  ran crn 5659  suc csuc 6390   SucMap csucmap 39376   Suc csuccl 39377
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-br 5109  df-opab 5174  df-cnv 5666  df-dm 5668  df-rn 5669  df-sucmap 39660  df-succl 39667
This theorem is used by:  dfsuccl3  39671
  Copyright terms: Public domain W3C validator