| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > presucmap | Structured version Visualization version GIF version | ||
| Description: pre is really a predecessor (when it should be). This correctness theorem for pre makes it usable in proofs without unfolding ℩. This theorem gives one witness; preuniqval 38747 gives it is the only one. (Contributed by Peter Mazsa, 12-Jan-2026.) |
| Ref | Expression |
|---|---|
| presucmap | ⊢ (𝑁 ∈ ran SucMap → pre 𝑁 SucMap 𝑁) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfpre2 38728 | . . 3 ⊢ (𝑁 ∈ ran SucMap → pre 𝑁 = (℩𝑚𝑚 SucMap 𝑁)) | |
| 2 | 1 | eqcomd 2743 | . 2 ⊢ (𝑁 ∈ ran SucMap → (℩𝑚𝑚 SucMap 𝑁) = pre 𝑁) |
| 3 | preex 38743 | . . 3 ⊢ pre 𝑁 ∈ V | |
| 4 | eupre2 38744 | . . . 4 ⊢ (𝑁 ∈ ran SucMap → (𝑁 ∈ ran SucMap ↔ ∃!𝑚 𝑚 SucMap 𝑁)) | |
| 5 | 4 | ibi 267 | . . 3 ⊢ (𝑁 ∈ ran SucMap → ∃!𝑚 𝑚 SucMap 𝑁) |
| 6 | breq1 5103 | . . . 4 ⊢ (𝑚 = pre 𝑁 → (𝑚 SucMap 𝑁 ↔ pre 𝑁 SucMap 𝑁)) | |
| 7 | 6 | iota2 6489 | . . 3 ⊢ (( pre 𝑁 ∈ V ∧ ∃!𝑚 𝑚 SucMap 𝑁) → ( pre 𝑁 SucMap 𝑁 ↔ (℩𝑚𝑚 SucMap 𝑁) = pre 𝑁)) |
| 8 | 3, 5, 7 | sylancr 588 | . 2 ⊢ (𝑁 ∈ ran SucMap → ( pre 𝑁 SucMap 𝑁 ↔ (℩𝑚𝑚 SucMap 𝑁) = pre 𝑁)) |
| 9 | 2, 8 | mpbird 257 | 1 ⊢ (𝑁 ∈ ran SucMap → pre 𝑁 SucMap 𝑁) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 ∃!weu 2569 Vcvv 3442 class class class wbr 5100 ran crn 5633 ℩cio 6454 SucMap csucmap 38429 pre cpre 38431 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 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-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 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-xp 5638 df-cnv 5640 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-suc 6331 df-iota 6456 df-sucmap 38713 df-pre 38726 |
| This theorem is referenced by: preuniqval 38747 sucpre 38748 |
| Copyright terms: Public domain | W3C validator |