| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dfpre3 | Structured version Visualization version GIF version | ||
| Description: Alternate definition of the successor-predecessor. (Contributed by Peter Mazsa, 12-Jan-2026.) |
| Ref | Expression |
|---|---|
| dfpre3 | ⊢ (𝑁 ∈ 𝑉 → pre 𝑁 = (℩𝑚 suc 𝑚 = 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfpre2 38815 | . 2 ⊢ (𝑁 ∈ 𝑉 → pre 𝑁 = (℩𝑚𝑚 SucMap 𝑁)) | |
| 2 | brsucmap 38804 | . . . 4 ⊢ ((𝑚 ∈ V ∧ 𝑁 ∈ 𝑉) → (𝑚 SucMap 𝑁 ↔ suc 𝑚 = 𝑁)) | |
| 3 | 2 | el2v1 38567 | . . 3 ⊢ (𝑁 ∈ 𝑉 → (𝑚 SucMap 𝑁 ↔ suc 𝑚 = 𝑁)) |
| 4 | 3 | iotabidv 6477 | . 2 ⊢ (𝑁 ∈ 𝑉 → (℩𝑚𝑚 SucMap 𝑁) = (℩𝑚 suc 𝑚 = 𝑁)) |
| 5 | 1, 4 | eqtrd 2772 | 1 ⊢ (𝑁 ∈ 𝑉 → pre 𝑁 = (℩𝑚 suc 𝑚 = 𝑁)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 ∈ wcel 2114 Vcvv 3430 class class class wbr 5086 suc csuc 6320 ℩cio 6447 SucMap csucmap 38516 pre cpre 38518 |
| 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 5232 ax-pr 5371 ax-un 7683 |
| 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-clab 2716 df-cleq 2729 df-clel 2812 df-ral 3053 df-rex 3063 df-rab 3391 df-v 3432 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-br 5087 df-opab 5149 df-xp 5631 df-cnv 5633 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-suc 6324 df-iota 6449 df-sucmap 38800 df-pre 38813 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |