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 38973
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 38972 . 2 Suc = {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛}
2 sucidg 6429 . . . . . . . . . 10 (𝑚 ∈ V → 𝑚 ∈ suc 𝑚)
32elv 3459 . . . . . . . . 9 𝑚 ∈ suc 𝑚
4 eleq2 2851 . . . . . . . . 9 (suc 𝑚 = 𝑛 → (𝑚 ∈ suc 𝑚𝑚𝑛))
53, 4mpbii 235 . . . . . . . 8 (suc 𝑚 = 𝑛𝑚𝑛)
6 sssucid 6428 . . . . . . . . 9 𝑚 ⊆ suc 𝑚
7 sseq2 3962 . . . . . . . . 9 (suc 𝑚 = 𝑛 → (𝑚 ⊆ suc 𝑚𝑚𝑛))
86, 7mpbii 235 . . . . . . . 8 (suc 𝑚 = 𝑛𝑚𝑛)
95, 8jca 519 . . . . . . 7 (suc 𝑚 = 𝑛 → (𝑚𝑛𝑚𝑛))
109pm4.71ri 568 . . . . . 6 (suc 𝑚 = 𝑛 ↔ ((𝑚𝑛𝑚𝑛) ∧ suc 𝑚 = 𝑛))
11 df-3an 1100 . . . . . 6 ((𝑚𝑛𝑚𝑛 ∧ suc 𝑚 = 𝑛) ↔ ((𝑚𝑛𝑚𝑛) ∧ suc 𝑚 = 𝑛))
12 3anass 1106 . . . . . 6 ((𝑚𝑛𝑚𝑛 ∧ suc 𝑚 = 𝑛) ↔ (𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
1310, 11, 123bitr2i 301 . . . . 5 (suc 𝑚 = 𝑛 ↔ (𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
1413eubii 2612 . . . 4 (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚(𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
15 df-reu 3368 . . . 4 (∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛) ↔ ∃!𝑚(𝑚𝑛 ∧ (𝑚𝑛 ∧ suc 𝑚 = 𝑛)))
1614, 15bitr4i 280 . . 3 (∃!𝑚 suc 𝑚 = 𝑛 ↔ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛))
1716abbii 2829 . 2 {𝑛 ∣ ∃!𝑚 suc 𝑚 = 𝑛} = {𝑛 ∣ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛)}
181, 17eqtri 2785 1 Suc = {𝑛 ∣ ∃!𝑚𝑛 (𝑚𝑛 ∧ suc 𝑚 = 𝑛)}
Colors of variables: wff setvar class
Syntax hints:  wa 399  w3a 1098   = wceq 1560  wcel 2142  ∃!weu 2595  {cab 2740  ∃!wreu 3365  Vcvv 3454  wss 3904  suc csuc 6348   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  ax-un 7718  ax-reg 9540
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-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  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-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-eprel 5547  df-fr 5600  df-cnv 5655  df-dm 5657  df-rn 5658  df-suc 6352  df-sucmap 38961  df-succl 38968
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator