| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > exeupre2 | Structured version Visualization version GIF version | ||
| Description: Whenever a predecessor exists, it exists alone. (Contributed by Peter Mazsa, 12-Jan-2026.) |
| Ref | Expression |
|---|---|
| exeupre2 | ⊢ (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mopre 38851 | . 2 ⊢ ∃*𝑚 suc 𝑚 = 𝑁 | |
| 2 | moeuex 2588 | . 2 ⊢ (∃*𝑚 suc 𝑚 = 𝑁 → (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 208 = wceq 1548 ∃wex 1787 ∃*wmo 2543 ∃!weu 2574 suc csuc 6315 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 ax-sep 5220 ax-pr 5364 ax-un 7681 ax-reg 9501 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-ne 2937 df-ral 3056 df-rex 3066 df-rab 3394 df-v 3435 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4841 df-br 5075 df-opab 5137 df-eprel 5520 df-fr 5573 df-suc 6319 |
| This theorem is referenced by: dfsuccl3 38853 exeupre 38871 |
| Copyright terms: Public domain | W3C validator |