MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  n0lesm1lt Structured version   Visualization version   GIF version

Theorem n0lesm1lt 28768
Description: Non-negative surreal ordering relation. (Contributed by Scott Fenton, 8-Nov-2025.)
Assertion
Ref Expression
n0lesm1lt ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑀 ≤s 𝑁 ↔ (𝑀 −s 1s ) <s 𝑁))

Proof of Theorem n0lesm1lt
StepHypRef Expression
1 n0lesltp1 28767 . 2 ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑀 ≤s 𝑁 ↔ 𝑀 <s (𝑁 +s 1s )))
2 n0no 28724 . . . 4 (𝑀 ∈ ℕ0s → 𝑀 ∈ No)
32adantr 486 . . 3 ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → 𝑀 ∈ No)
4 n0no 28724 . . . . 5 (𝑁 ∈ ℕ0s → 𝑁 ∈ No)
54adantl 487 . . . 4 ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → 𝑁 ∈ No)
6 peano2no 28385 . . . 4 (𝑁 ∈ No → (𝑁 +s 1s ) ∈ No)
75, 6syl 18 . . 3 ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑁 +s 1s ) ∈ No)
8 1no 28211 . . . 4 1s ∈ No
98a1i 11 . . 3 ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → 1s ∈ No)
103, 7, 9ltsubs1d 28479 . 2 ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → (𝑀 <s (𝑁 +s 1s ) ↔ (𝑀 −s 1s ) <s ((𝑁 +s 1s ) −s 1s )))
11 pncans 28473 . . . . 5 ((𝑁 ∈ No ∧ 1s ∈ No) → ((𝑁 +s 1s ) −s 1s ) = 𝑁)
124, 8, 11sylancl 598 . . . 4 (𝑁 ∈ ℕ0s → ((𝑁 +s 1s ) −s 1s ) = 𝑁)
1312adantl 487 . . 3 ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → ((𝑁 +s 1s ) −s 1s ) = 𝑁)
1413breq2d 5118 . 2 ((𝑀 ∈ ℕ0s ∧ 𝑁 ∈ ℕ0s) → ((𝑀 −s 1s ) <s ((𝑁 +s 1s ) −s 1s ) ↔ (𝑀 −s 1s ) <s 𝑁))
151, 10, 143bitrd 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 1569   ∈ wcel 2146   class class class wbr 5106  (class class class)co 7430  Nocsur 28012   <s clts 28013   ≤s cles 28116   1s c1s 28207   +s cadds 28360   −s csubs 28421  ℕ0scn0s 28713
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  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 4839  df-ot 4862  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6311  df-ord 6372  df-on 6373  df-lim 6374  df-suc 6375  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-mpo 7435  df-om 7888  df-1st 8011  df-2nd 8012  df-frecs 8313  df-wrecs 8344  df-recs 8393  df-rdg 8432  df-1o 8490  df-2o 8491  df-nadd 8689  df-no 28015  df-lts 28016  df-bday 28017  df-les 28117  df-slts 28159  df-cuts 28161  df-0s 28208  df-1s 28209  df-made 28228  df-old 28229  df-left 28231  df-right 28232  df-norec 28339  df-norec2 28350  df-adds 28361  df-negs 28422  df-subs 28423  df-n0s 28715  df-nns 28716
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator