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

Theorem dfsuccl4 38587
Description: Alternate definition that incorporates the most desirable properties of the successor class. (Contributed by Peter Mazsa, 30-Jan-2026.)
Assertion
Ref Expression
dfsuccl4 Suc = {𝑛 ∣ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛)}
Distinct variable group:   𝑚,𝑛

Proof of Theorem dfsuccl4
StepHypRef Expression
1 dfsuccl3 38586 . 2 Suc = {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛}
2 sucidg 6398 . . . . . . . . . 10 (𝑚 ∈ V → 𝑚 ∈ suc 𝑚)
32elv 3443 . . . . . . . . 9 𝑚 ∈ suc 𝑚
4 eleq2 2823 . . . . . . . . 9 (suc 𝑚 = 𝑛 → (𝑚 ∈ suc 𝑚𝑚𝑛))
53, 4mpbii 233 . . . . . . . 8 (suc 𝑚 = 𝑛𝑚𝑛)
6 sssucid 6397 . . . . . . . . 9 𝑚 ⊆ suc 𝑚
7 sseq2 3958 . . . . . . . . 9 (suc 𝑚 = 𝑛 → (𝑚 ⊆ suc 𝑚𝑚𝑛))
86, 7mpbii 233 . . . . . . . 8 (suc 𝑚 = 𝑛𝑚𝑛)
95, 8jca 511 . . . . . . 7 (suc 𝑚 = 𝑛 → (𝑚𝑛𝑚𝑛))
109pm4.71ri 560 . . . . . 6 (suc 𝑚 = 𝑛 ↔ ((𝑚𝑛𝑚𝑛) ∧ suc 𝑚 = 𝑛))
11 df-3an 1088 . . . . . 6 ((𝑚𝑛𝑚𝑛 ∧ suc 𝑚 = 𝑛) ↔ ((𝑚𝑛𝑚𝑛) ∧ suc 𝑚 = 𝑛))
12 3anass 1094 . . . . . 6 ((𝑚𝑛𝑚𝑛 ∧ suc 𝑚 = 𝑛) ↔ (𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
1310, 11, 123bitr2i 299 . . . . 5 (suc 𝑚 = 𝑛 ↔ (𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
1413eubii 2583 . . . 4 (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚(𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
15 df-reu 3349 . . . 4 (∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛) ↔ ∃!𝑚(𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
1614, 15bitr4i 278 . . 3 (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛))
1716abbii 2801 . 2 {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛} = {𝑛 ∣ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛)}
181, 17eqtri 2757 1 Suc = {𝑛 ∣ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛)}
Colors of variables: wff setvar class
Syntax hints:  wa 395  w3a 1086   = wceq 1541  wcel 2113  ∃!weu 2566  {cab 2712  ∃!wreu 3346  Vcvv 3438  wss 3899  suc csuc 6317   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  ax-un 7678  ax-reg 9495
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-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-eprel 5522  df-fr 5575  df-cnv 5630  df-dm 5632  df-rn 5633  df-suc 6321  df-sucmap 38575  df-succl 38582
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator