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 38648
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 38647 . 2 Suc = {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛}
2 sucidg 6400 . . . . . . . . . 10 (𝑚 ∈ V → 𝑚 ∈ suc 𝑚)
32elv 3445 . . . . . . . . 9 𝑚 ∈ suc 𝑚
4 eleq2 2825 . . . . . . . . 9 (suc 𝑚 = 𝑛 → (𝑚 ∈ suc 𝑚𝑚𝑛))
53, 4mpbii 233 . . . . . . . 8 (suc 𝑚 = 𝑛𝑚𝑛)
6 sssucid 6399 . . . . . . . . 9 𝑚 ⊆ suc 𝑚
7 sseq2 3960 . . . . . . . . 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 2585 . . . 4 (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚(𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
15 df-reu 3351 . . . 4 (∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛) ↔ ∃!𝑚(𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
1614, 15bitr4i 278 . . 3 (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛))
1716abbii 2803 . 2 {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛} = {𝑛 ∣ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛)}
181, 17eqtri 2759 1 Suc = {𝑛 ∣ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛)}
Colors of variables: wff setvar class
Syntax hints:  wa 395  w3a 1086   = wceq 1541  wcel 2113  ∃!weu 2568  {cab 2714  ∃!wreu 3348  Vcvv 3440  wss 3901  suc csuc 6319   Suc csuccl 38379
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 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377  ax-un 7680  ax-reg 9497
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-eprel 5524  df-fr 5577  df-cnv 5632  df-dm 5634  df-rn 5635  df-suc 6323  df-sucmap 38636  df-succl 38643
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator