| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > n0lesm1lt | Structured version Visualization version GIF version | ||
| Description: Non-negative surreal ordering relation. (Contributed by Scott Fenton, 8-Nov-2025.) |
| Ref | Expression |
|---|---|
| n0lesm1lt | ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑀 ≤s 𝑁 ↔ (𝑀 −s 1s ) <s 𝑁)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | n0lesltp1 28809 | . 2 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑀 ≤s 𝑁 ↔ 𝑀 <s (𝑁 +s 1s ))) | |
| 2 | n0no 28766 | . . . 4 ⊢ (𝑀 ∈ ℕ0s → 𝑀 ∈ No) | |
| 3 | 2 | adantr 486 | . . 3 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → 𝑀 ∈ No) |
| 4 | n0no 28766 | . . . . 5 ⊢ (𝑁 ∈ ℕ0s → 𝑁 ∈ No) | |
| 5 | 4 | adantl 487 | . . . 4 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → 𝑁 ∈ No) |
| 6 | peano2no 28427 | . . . 4 ⊢ (𝑁 ∈ No → (𝑁 +s 1s ) ∈ No) | |
| 7 | 5, 6 | syl 18 | . . 3 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑁 +s 1s ) ∈ No) |
| 8 | 1no 28253 | . . . 4 ⊢ 1s ∈ No | |
| 9 | 8 | a1i 11 | . . 3 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → 1s ∈ No) |
| 10 | 3, 7, 9 | ltsubs1d 28521 | . 2 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑀 <s (𝑁 +s 1s ) ↔ (𝑀 −s 1s ) <s ((𝑁 +s 1s ) −s 1s ))) |
| 11 | pncans 28515 | . . . . 5 ⊢ ((𝑁 ∈ No ∧ 1s ∈ No) → ((𝑁 +s 1s ) −s 1s ) = 𝑁) | |
| 12 | 4, 8, 11 | sylancl 598 | . . . 4 ⊢ (𝑁 ∈ ℕ0s → ((𝑁 +s 1s ) −s 1s ) = 𝑁) |
| 13 | 12 | adantl 487 | . . 3 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → ((𝑁 +s 1s ) −s 1s ) = 𝑁) |
| 14 | 13 | breq2d 5120 | . 2 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → ((𝑀 −s 1s ) <s ((𝑁 +s 1s ) −s 1s ) ↔ (𝑀 −s 1s ) <s 𝑁)) |
| 15 | 1, 10, 14 | 3bitrd 308 | 1 ⊢ ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑀 ≤s 𝑁 ↔ (𝑀 −s 1s ) <s 𝑁)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2147 class class class wbr 5108 (class class class)co 7451 Nocsur 28054 <s clts 28055 ≤s cles 28158 1s c1s 28249 +s cadds 28402 −s csubs 28463 ℕ0scn0s 28755 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-ot 4864 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-2o 8515 df-nadd 8713 df-no 28057 df-lts 28058 df-bday 28059 df-les 28159 df-slts 28201 df-cuts 28203 df-0s 28250 df-1s 28251 df-made 28270 df-old 28271 df-left 28273 df-right 28274 df-norec 28381 df-norec2 28392 df-adds 28403 df-negs 28464 df-subs 28465 df-n0s 28757 df-nns 28758 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |