Theorem exeupre2 39154

Description: Whenever a predecessor exists, it exists alone. (Contributed by Peter Mazsa, 12-Jan-2026.)

Assertion

Ref	Expression
exeupre2	⊢ (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁)

Distinct variable group:   𝑚,𝑁

Proof of Theorem exeupre2

Step	Hyp	Ref	Expression
1		mopre 39153	. 2 ⊢ ∃*𝑚 suc 𝑚 = 𝑁
2		moeuex 2612	. 2 ⊢ (∃*𝑚 suc 𝑚 = 𝑁 → (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁))
3	1, 2	ax-mp 5	1 ⊢ (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁)

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  ∃wex 1812  ∃*wmo 2567  ∃!weu 2598  suc csuc 6366

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406  ax-un 7738  ax-reg 9557

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-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-eprel 5563  df-fr 5616  df-suc 6370

This theorem is used by:  dfsuccl3  39155  exeupre  39173