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

Theorem 0lt1s 28042
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 28039 . . . . 5 0s No
2 lesid 27968 . . . . 5 ( 0s No → 0s ≤s 0s )
31, 2ax-mp 5 . . . 4 0s ≤s 0s
41elexi 3480 . . . . 5 0s ∈ V
5 breq2 5118 . . . . 5 (𝑥 = 0s → ( 0s ≤s 𝑥 ↔ 0s ≤s 0s ))
64, 5rexsn 4653 . . . 4 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ↔ 0s ≤s 0s )
73, 6mpbir 234 . . 3 𝑥 ∈ { 0s } 0s ≤s 𝑥
87orci 879 . 2 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )
9 0elpw 5331 . . . 4 ∅ ∈ 𝒫 No
10 nulsgts 28006 . . . 4 (∅ ∈ 𝒫 No → ∅ <<s ∅)
119, 10ax-mp 5 . . 3 ∅ <<s ∅
12 snssi 4756 . . . . . 6 ( 0s No → { 0s } ⊆ No )
131, 12ax-mp 5 . . . . 5 { 0s } ⊆ No
14 snex 5415 . . . . . 6 { 0s } ∈ V
1514elpw 4571 . . . . 5 ({ 0s } ∈ 𝒫 No ↔ { 0s } ⊆ No )
1613, 15mpbir 234 . . . 4 { 0s } ∈ 𝒫 No
17 nulsgts 28006 . . . 4 ({ 0s } ∈ 𝒫 No → { 0s } <<s ∅)
1816, 17ax-mp 5 . . 3 { 0s } <<s ∅
19 df-0s 28037 . . 3 0s = (∅ |s ∅)
20 df-1s 28038 . . 3 1s = ({ 0s } |s ∅)
21 ltsrec 28031 . . 3 (((∅ <<s ∅ ∧ { 0s } <<s ∅) ∧ ( 0s = (∅ |s ∅) ∧ 1s = ({ 0s } |s ∅))) → ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )))
2211, 18, 19, 20, 21mp4an 706 . 2 ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s ))
238, 22mpbir 234 1 0s <s 1s
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wo 861   = wceq 1570  wcel 2146  wrex 3092  wss 3908  c0 4289  𝒫 cpw 4567  {csn 4594   class class class wbr 5114  (class class class)co 7423   No csur 27841   <s clts 27842   ≤s cles 27945   <<s cslts 27987   |s ccuts 27989   0s c0s 28035   1s c1s 28036
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-tp 4599  df-op 4601  df-uni 4878  df-int 4918  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-ord 6370  df-on 6371  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-1o 8462  df-2o 8463  df-no 27844  df-lts 27845  df-bday 27846  df-les 27946  df-slts 27988  df-cuts 27990  df-0s 28037  df-1s 28038
This theorem is used by:  1ne0s  28050  left1s  28125  right1s  28126  ltsp1d  28245  precsexlem9  28445  n0sge0  28568  nnsrecgt0d  28581  twocut  28653  nohalf  28654  expsgt0  28667  pw2recs  28668  halfcut  28688  bdaypw2n0bndlem  28693  bdayfinbndlem1  28697  0reno  28726  1reno  28727
  Copyright terms: Public domain W3C validator