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

Theorem 0lt1s 27820
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 27817 . . . . 5 0s No
2 lesid 27747 . . . . 5 ( 0s No → 0s ≤s 0s )
31, 2ax-mp 5 . . . 4 0s ≤s 0s
41elexi 3465 . . . . 5 0s ∈ V
5 breq2 5104 . . . . 5 (𝑥 = 0s → ( 0s ≤s 𝑥 ↔ 0s ≤s 0s ))
64, 5rexsn 4641 . . . 4 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ↔ 0s ≤s 0s )
73, 6mpbir 231 . . 3 𝑥 ∈ { 0s } 0s ≤s 𝑥
87orci 866 . 2 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )
9 0elpw 5303 . . . 4 ∅ ∈ 𝒫 No
10 nulsgts 27784 . . . 4 (∅ ∈ 𝒫 No → ∅ <<s ∅)
119, 10ax-mp 5 . . 3 ∅ <<s ∅
12 snssi 4766 . . . . . 6 ( 0s No → { 0s } ⊆ No )
131, 12ax-mp 5 . . . . 5 { 0s } ⊆ No
14 snex 5385 . . . . . 6 { 0s } ∈ V
1514elpw 4560 . . . . 5 ({ 0s } ∈ 𝒫 No ↔ { 0s } ⊆ No )
1613, 15mpbir 231 . . . 4 { 0s } ∈ 𝒫 No
17 nulsgts 27784 . . . 4 ({ 0s } ∈ 𝒫 No → { 0s } <<s ∅)
1816, 17ax-mp 5 . . 3 { 0s } <<s ∅
19 df-0s 27815 . . 3 0s = (∅ |s ∅)
20 df-1s 27816 . . 3 1s = ({ 0s } |s ∅)
21 ltsrec 27809 . . 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 3903  c0 4287  𝒫 cpw 4556  {csn 4582   class class class wbr 5100  (class class class)co 7368   No csur 27619   <s clts 27620   ≤s cles 27724   <<s cslts 27765   |s ccuts 27767   0s c0s 27813   1s c1s 27814
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 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-1o 8407  df-2o 8408  df-no 27622  df-lts 27623  df-bday 27624  df-les 27725  df-slts 27766  df-cuts 27768  df-0s 27815  df-1s 27816
This theorem is referenced by:  1ne0s  27828  left1s  27903  right1s  27904  ltsp1d  28023  precsexlem9  28223  n0sge0  28346  nnsrecgt0d  28359  twocut  28431  nohalf  28432  expsgt0  28445  pw2recs  28446  halfcut  28466  bdaypw2n0bndlem  28471  bdayfinbndlem1  28475  0reno  28504  1reno  28505
  Copyright terms: Public domain W3C validator