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

Theorem 0lt1s 27818
Description: Surreal zero is less than surreal one. Theorem from [Conway] p. 7. (Contributed by Scott Fenton, 7-Aug-2024.)
Assertion
Ref Expression
0lt1s 0s <s 1s

Proof of Theorem 0lt1s
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0no 27815 . . . . 5 0s No
2 lesid 27745 . . . . 5 ( 0s No → 0s ≤s 0s )
31, 2ax-mp 5 . . . 4 0s ≤s 0s
41elexi 3453 . . . . 5 0s ∈ V
5 breq2 5090 . . . . 5 (𝑥 = 0s → ( 0s ≤s 𝑥 ↔ 0s ≤s 0s ))
64, 5rexsn 4627 . . . 4 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ↔ 0s ≤s 0s )
73, 6mpbir 231 . . 3 𝑥 ∈ { 0s } 0s ≤s 𝑥
87orci 866 . 2 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )
9 0elpw 5293 . . . 4 ∅ ∈ 𝒫 No
10 nulsgts 27782 . . . 4 (∅ ∈ 𝒫 No → ∅ <<s ∅)
119, 10ax-mp 5 . . 3 ∅ <<s ∅
12 snssi 4752 . . . . . 6 ( 0s No → { 0s } ⊆ No )
131, 12ax-mp 5 . . . . 5 { 0s } ⊆ No
14 snex 5376 . . . . . 6 { 0s } ∈ V
1514elpw 4546 . . . . 5 ({ 0s } ∈ 𝒫 No ↔ { 0s } ⊆ No )
1613, 15mpbir 231 . . . 4 { 0s } ∈ 𝒫 No
17 nulsgts 27782 . . . 4 ({ 0s } ∈ 𝒫 No → { 0s } <<s ∅)
1816, 17ax-mp 5 . . 3 { 0s } <<s ∅
19 df-0s 27813 . . 3 0s = (∅ |s ∅)
20 df-1s 27814 . . 3 1s = ({ 0s } |s ∅)
21 ltsrec 27807 . . 3 (((∅ <<s ∅ ∧ { 0s } <<s ∅) ∧ ( 0s = (∅ |s ∅) ∧ 1s = ({ 0s } |s ∅))) → ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )))
2211, 18, 19, 20, 21mp4an 694 . 2 ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s ))
238, 22mpbir 231 1 0s <s 1s
Colors of variables: wff setvar class
Syntax hints:  wb 206  wo 848   = wceq 1542  wcel 2114  wrex 3062  wss 3890  c0 4274  𝒫 cpw 4542  {csn 4568   class class class wbr 5086  (class class class)co 7360   No csur 27617   <s clts 27618   ≤s cles 27722   <<s cslts 27763   |s ccuts 27765   0s c0s 27811   1s c1s 27812
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-tp 4573  df-op 4575  df-uni 4852  df-int 4891  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-ord 6320  df-on 6321  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-1o 8398  df-2o 8399  df-no 27620  df-lts 27621  df-bday 27622  df-les 27723  df-slts 27764  df-cuts 27766  df-0s 27813  df-1s 27814
This theorem is referenced by:  1ne0s  27826  left1s  27901  right1s  27902  ltsp1d  28021  precsexlem9  28221  n0sge0  28344  nnsrecgt0d  28357  twocut  28429  nohalf  28430  expsgt0  28443  pw2recs  28444  halfcut  28464  bdaypw2n0bndlem  28469  bdayfinbndlem1  28473  0reno  28502  1reno  28503
  Copyright terms: Public domain W3C validator