| 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 38584 | . 2 ⊢ ∃*𝑚 suc 𝑚 = 𝑁 | |
| 2 | moeuex 2580 | . 2 ⊢ (∃*𝑚 suc 𝑚 = 𝑁 → (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 = wceq 1541 ∃wex 1780 ∃*wmo 2535 ∃!weu 2566 suc csuc 6317 |
| 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-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 ax-un 7678 ax-reg 9495 |
| 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-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-eprel 5522 df-fr 5575 df-suc 6321 |
| This theorem is referenced by: dfsuccl3 38586 exeupre 38603 |
| Copyright terms: Public domain | W3C validator |