Database
SURREAL NUMBERS
Subsystems of surreals
Natural numbers
n0sleltp1
Next ⟩
n0slem1lt
Metamath Proof Explorer
Ascii
Unicode
Theorem
n0sleltp1
Description:
Non-negative surreal ordering relation.
(Contributed by
Scott Fenton
, 7-Nov-2025)
Ref
Expression
Assertion
n0sleltp1
⊢
M
∈
ℕ
0s
∧
N
∈
ℕ
0s
→
M
≤
s
N
↔
M
<
s
N
+
s
1
s
Proof
Step
Hyp
Ref
Expression
1
n0sno
⊢
M
∈
ℕ
0s
→
M
∈
No
2
1
adantr
⊢
M
∈
ℕ
0s
∧
N
∈
ℕ
0s
→
M
∈
No
3
n0sno
⊢
N
∈
ℕ
0s
→
N
∈
No
4
3
adantl
⊢
M
∈
ℕ
0s
∧
N
∈
ℕ
0s
→
N
∈
No
5
1sno
⊢
1
s
∈
No
6
5
a1i
⊢
M
∈
ℕ
0s
∧
N
∈
ℕ
0s
→
1
s
∈
No
7
2
4
6
sleadd1d
⊢
M
∈
ℕ
0s
∧
N
∈
ℕ
0s
→
M
≤
s
N
↔
M
+
s
1
s
≤
s
N
+
s
1
s
8
peano2n0s
⊢
N
∈
ℕ
0s
→
N
+
s
1
s
∈
ℕ
0s
9
n0sltp1le
⊢
M
∈
ℕ
0s
∧
N
+
s
1
s
∈
ℕ
0s
→
M
<
s
N
+
s
1
s
↔
M
+
s
1
s
≤
s
N
+
s
1
s
10
8
9
sylan2
⊢
M
∈
ℕ
0s
∧
N
∈
ℕ
0s
→
M
<
s
N
+
s
1
s
↔
M
+
s
1
s
≤
s
N
+
s
1
s
11
7
10
bitr4d
⊢
M
∈
ℕ
0s
∧
N
∈
ℕ
0s
→
M
≤
s
N
↔
M
<
s
N
+
s
1
s