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

Theorem dfpre3 39547
Description: Alternate definition of the successor-predecessor. (Contributed by Peter Mazsa, 12-Jan-2026.)
Assertion
Ref Expression
dfpre3 (𝑁 ∈ 𝑉 → pre 𝑁 = (℩𝑚 suc 𝑚 = 𝑁))
Distinct variable groups:   𝑚,𝑁   𝑚,𝑉

Proof of Theorem dfpre3
StepHypRef Expression
1 dfpre2 39546 . 2 (𝑁 ∈ 𝑉 → pre 𝑁 = (℩𝑚𝑚 SucMap 𝑁))
2 brsucmap 39535 . . . 4 ((𝑚 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝑚 SucMap 𝑁 ↔ suc 𝑚 = 𝑁))
32el2v1 39298 . . 3 (𝑁 ∈ 𝑉 → (𝑚 SucMap 𝑁 ↔ suc 𝑚 = 𝑁))
43iotabidv 6526 . 2 (𝑁 ∈ 𝑉 → (℩𝑚𝑚 SucMap 𝑁) = (℩𝑚 suc 𝑚 = 𝑁))
51, 4eqtrd 2795 1 (𝑁 ∈ 𝑉 → pre 𝑁 = (℩𝑚 suc 𝑚 = 𝑁))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∈ wcel 2144  Vcvv 3450   class class class wbr 5102  suc csuc 6367  ℩cio 6495   SucMap csucmap 39247   pre cpre 39249
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5657  df-cnv 5659  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-suc 6371  df-iota 6497  df-sucmap 39531  df-pre 39544
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator