| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > exeupre | Structured version Visualization version GIF version | ||
| Description: Whenever a predecessor exists, it exists alone. (Contributed by Peter Mazsa, 12-Jan-2026.) |
| Ref | Expression |
|---|---|
| exeupre | ⊢ (𝑁 ∈ 𝑉 → (∃𝑚 𝑚 SucMap 𝑁 ↔ ∃!𝑚 𝑚 SucMap 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | brsucmap 38717 | . . . . 5 ⊢ ((𝑚 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝑚 SucMap 𝑁 ↔ suc 𝑚 = 𝑁)) | |
| 2 | 1 | el2v1 38480 | . . . 4 ⊢ (𝑁 ∈ 𝑉 → (𝑚 SucMap 𝑁 ↔ suc 𝑚 = 𝑁)) |
| 3 | 2 | exbidv 1923 | . . 3 ⊢ (𝑁 ∈ 𝑉 → (∃𝑚 𝑚 SucMap 𝑁 ↔ ∃𝑚 suc 𝑚 = 𝑁)) |
| 4 | exeupre2 38723 | . . 3 ⊢ (∃𝑚 suc 𝑚 = 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁) | |
| 5 | 3, 4 | bitrdi 287 | . 2 ⊢ (𝑁 ∈ 𝑉 → (∃𝑚 𝑚 SucMap 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁)) |
| 6 | 2 | eubidv 2587 | . 2 ⊢ (𝑁 ∈ 𝑉 → (∃!𝑚 𝑚 SucMap 𝑁 ↔ ∃!𝑚 suc 𝑚 = 𝑁)) |
| 7 | 5, 6 | bitr4d 282 | 1 ⊢ (𝑁 ∈ 𝑉 → (∃𝑚 𝑚 SucMap 𝑁 ↔ ∃!𝑚 𝑚 SucMap 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∃wex 1781 ∈ wcel 2114 ∃!weu 2569 Vcvv 3442 class class class wbr 5100 suc csuc 6327 SucMap csucmap 38429 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2709 ax-sep 5243 ax-pr 5379 ax-un 7690 ax-reg 9509 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-ne 2934 df-ral 3053 df-rex 3063 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-br 5101 df-opab 5163 df-eprel 5532 df-fr 5585 df-suc 6331 df-sucmap 38713 |
| This theorem is referenced by: eupre2 38744 |
| Copyright terms: Public domain | W3C validator |