| Mathbox for Peter Mazsa |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > brsucmap | Structured version Visualization version GIF version | ||
| Description: Binary relation form of the successor map, general version. (Contributed by Peter Mazsa, 6-Jan-2026.) |
| Ref | Expression |
|---|---|
| brsucmap | ⊢ ((𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → (𝑀 SucMap 𝑁 ↔ suc 𝑀 = 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | suceq 6456 | . . 3 ⊢ (𝑚 = 𝑀 → suc 𝑚 = suc 𝑀) | |
| 2 | id 23 | . . 3 ⊢ (𝑛 = 𝑁 → 𝑛 = 𝑁) | |
| 3 | 1, 2 | eqeqan12d 2780 | . 2 ⊢ ((𝑚 = 𝑀 ∧ 𝑛 = 𝑁) → (suc 𝑚 = 𝑛 ↔ suc 𝑀 = 𝑁)) |
| 4 | df-sucmap 39662 | . 2 ⊢ SucMap = {〈𝑚, 𝑛〉 ∣ suc 𝑚 = 𝑛} | |
| 5 | 3, 4 | brabga 5514 | 1 ⊢ ((𝑀 ∈ 𝑉 ∧ 𝑁 ∈ 𝑊) → (𝑀 SucMap 𝑁 ↔ suc 𝑀 = 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1572 ∈ wcel 2150 class class class wbr 5107 suc csuc 6389 SucMap csucmap 39378 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-clab 2745 df-cleq 2758 df-clel 2842 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-suc 6393 df-sucmap 39662 |
| This theorem is used by: dmsucmap 39668 dfpre3 39678 sucmapsuc 39689 sucmapleftuniq 39690 exeupre 39691 sucpre 39697 |
| Copyright terms: Public domain | W3C validator |