Metamath Proof Explorer


Theorem lt2addsd

Description: Adding both sides of two surreal less-than relations. (Contributed by Scott Fenton, 15-Apr-2025)

Ref Expression
Hypotheses lt2addsd.1 φ A No
lt2addsd.2 φ B No
lt2addsd.3 φ C No
lt2addsd.4 φ D No
lt2addsd.5 φ A < s C
lt2addsd.6 φ B < s D
Assertion lt2addsd φ A + s B < s C + s D

Proof

Step Hyp Ref Expression
1 lt2addsd.1 φ A No
2 lt2addsd.2 φ B No
3 lt2addsd.3 φ C No
4 lt2addsd.4 φ D No
5 lt2addsd.5 φ A < s C
6 lt2addsd.6 φ B < s D
7 1 2 addscld φ A + s B No
8 3 2 addscld φ C + s B No
9 3 4 addscld φ C + s D No
10 1 3 2 ltadds1d φ A < s C A + s B < s C + s B
11 5 10 mpbid φ A + s B < s C + s B
12 2 4 3 ltadds2d φ B < s D C + s B < s C + s D
13 6 12 mpbid φ C + s B < s C + s D
14 7 8 9 11 13 ltstrd φ A + s B < s C + s D