Database
SURREAL NUMBERS
Conway cut representation
Conway cuts
sltsd
Next ⟩
sltssnb
Metamath Proof Explorer
Ascii
Unicode
Theorem
sltsd
Description:
Deduce surreal set less-than.
(Contributed by
Scott Fenton
, 24-Sep-2024)
Ref
Expression
Hypotheses
sltsd.1
⊢
φ
→
A
∈
V
sltsd.2
⊢
φ
→
B
∈
W
sltsd.3
⊢
φ
→
A
⊆
No
sltsd.4
⊢
φ
→
B
⊆
No
sltsd.5
⊢
φ
∧
x
∈
A
∧
y
∈
B
→
x
<
s
y
Assertion
sltsd
⊢
φ
→
A
≪
s
B
Proof
Step
Hyp
Ref
Expression
1
sltsd.1
⊢
φ
→
A
∈
V
2
sltsd.2
⊢
φ
→
B
∈
W
3
sltsd.3
⊢
φ
→
A
⊆
No
4
sltsd.4
⊢
φ
→
B
⊆
No
5
sltsd.5
⊢
φ
∧
x
∈
A
∧
y
∈
B
→
x
<
s
y
6
1
elexd
⊢
φ
→
A
∈
V
7
2
elexd
⊢
φ
→
B
∈
V
8
5
3expb
⊢
φ
∧
x
∈
A
∧
y
∈
B
→
x
<
s
y
9
8
ralrimivva
⊢
φ
→
∀
x
∈
A
∀
y
∈
B
x
<
s
y
10
3
4
9
3jca
⊢
φ
→
A
⊆
No
∧
B
⊆
No
∧
∀
x
∈
A
∀
y
∈
B
x
<
s
y
11
brslts
⊢
A
≪
s
B
↔
A
∈
V
∧
B
∈
V
∧
A
⊆
No
∧
B
⊆
No
∧
∀
x
∈
A
∀
y
∈
B
x
<
s
y
12
6
7
10
11
syl21anbrc
⊢
φ
→
A
≪
s
B