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

Theorem 0lt1s 27829
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 27826 . . . . 5 0s No
2 lesid 27756 . . . . 5 ( 0s No → 0s ≤s 0s )
31, 2ax-mp 5 . . . 4 0s ≤s 0s
41elexi 3455 . . . . 5 0s ∈ V
5 breq2 5083 . . . . 5 (𝑥 = 0s → ( 0s ≤s 𝑥 ↔ 0s ≤s 0s ))
64, 5rexsn 4621 . . . 4 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ↔ 0s ≤s 0s )
73, 6mpbir 232 . . 3 𝑥 ∈ { 0s } 0s ≤s 𝑥
87orci 871 . 2 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )
9 0elpw 5291 . . . 4 ∅ ∈ 𝒫 No
10 nulsgts 27793 . . . 4 (∅ ∈ 𝒫 No → ∅ <<s ∅)
119, 10ax-mp 5 . . 3 ∅ <<s ∅
12 snssi 4724 . . . . . 6 ( 0s No → { 0s } ⊆ No )
131, 12ax-mp 5 . . . . 5 { 0s } ⊆ No
14 snex 5375 . . . . . 6 { 0s } ∈ V
1514elpw 4540 . . . . 5 ({ 0s } ∈ 𝒫 No ↔ { 0s } ⊆ No )
1613, 15mpbir 232 . . . 4 { 0s } ∈ 𝒫 No
17 nulsgts 27793 . . . 4 ({ 0s } ∈ 𝒫 No → { 0s } <<s ∅)
1816, 17ax-mp 5 . . 3 { 0s } <<s ∅
19 df-0s 27824 . . 3 0s = (∅ |s ∅)
20 df-1s 27825 . . 3 1s = ({ 0s } |s ∅)
21 ltsrec 27818 . . 3 (((∅ <<s ∅ ∧ { 0s } <<s ∅) ∧ ( 0s = (∅ |s ∅) ∧ 1s = ({ 0s } |s ∅))) → ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )))
2211, 18, 19, 20, 21mp4an 699 . 2 ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s ))
238, 22mpbir 232 1 0s <s 1s
Colors of variables: wff setvar class
Syntax hints:  wb 207  wo 853   = wceq 1547  wcel 2119  wrex 3064  wss 3890  c0 4268  𝒫 cpw 4536  {csn 4562   class class class wbr 5079  (class class class)co 7363   No csur 27628   <s clts 27629   ≤s cles 27733   <<s cslts 27774   |s ccuts 27776   0s c0s 27822   1s c1s 27823
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-tp 4567  df-op 4569  df-uni 4846  df-int 4885  df-br 5080  df-opab 5142  df-mpt 5161  df-tr 5187  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  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 7320  df-ov 7366  df-oprab 7367  df-mpo 7368  df-1o 8402  df-2o 8403  df-no 27631  df-lts 27632  df-bday 27633  df-les 27734  df-slts 27775  df-cuts 27777  df-0s 27824  df-1s 27825
This theorem is referenced by:  1ne0s  27837  left1s  27912  right1s  27913  ltsp1d  28032  precsexlem9  28232  n0sge0  28355  nnsrecgt0d  28368  twocut  28440  nohalf  28441  expsgt0  28454  pw2recs  28455  halfcut  28475  bdaypw2n0bndlem  28480  bdayfinbndlem1  28484  0reno  28513  1reno  28514
  Copyright terms: Public domain W3C validator