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

Theorem 0lt1s 27882
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 27879 . . . . 5 0s No
2 lesid 27808 . . . . 5 ( 0s No → 0s ≤s 0s )
31, 2ax-mp 5 . . . 4 0s ≤s 0s
41elexi 3475 . . . . 5 0s ∈ V
5 breq2 5103 . . . . 5 (𝑥 = 0s → ( 0s ≤s 𝑥 ↔ 0s ≤s 0s ))
64, 5rexsn 4640 . . . 4 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ↔ 0s ≤s 0s )
73, 6mpbir 233 . . 3 𝑥 ∈ { 0s } 0s ≤s 𝑥
87orci 876 . 2 (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )
9 0elpw 5311 . . . 4 ∅ ∈ 𝒫 No
10 nulsgts 27846 . . . 4 (∅ ∈ 𝒫 No → ∅ <<s ∅)
119, 10ax-mp 5 . . 3 ∅ <<s ∅
12 snssi 4743 . . . . . 6 ( 0s No → { 0s } ⊆ No )
131, 12ax-mp 5 . . . . 5 { 0s } ⊆ No
14 snex 5395 . . . . . 6 { 0s } ∈ V
1514elpw 4558 . . . . 5 ({ 0s } ∈ 𝒫 No ↔ { 0s } ⊆ No )
1613, 15mpbir 233 . . . 4 { 0s } ∈ 𝒫 No
17 nulsgts 27846 . . . 4 ({ 0s } ∈ 𝒫 No → { 0s } <<s ∅)
1816, 17ax-mp 5 . . 3 { 0s } <<s ∅
19 df-0s 27877 . . 3 0s = (∅ |s ∅)
20 df-1s 27878 . . 3 1s = ({ 0s } |s ∅)
21 ltsrec 27871 . . 3 (((∅ <<s ∅ ∧ { 0s } <<s ∅) ∧ ( 0s = (∅ |s ∅) ∧ 1s = ({ 0s } |s ∅))) → ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )))
2211, 18, 19, 20, 21mp4an 703 . 2 ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s ))
238, 22mpbir 233 1 0s <s 1s
Colors of variables: wff setvar class
Syntax hints:  wb 208  wo 858   = wceq 1559  wcel 2141  wrex 3085  wss 3904  c0 4285  𝒫 cpw 4554  {csn 4581   class class class wbr 5099  (class class class)co 7392   No csur 27681   <s clts 27682   ≤s cles 27785   <<s cslts 27827   |s ccuts 27829   0s c0s 27875   1s c1s 27876
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5226  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-tp 4586  df-op 4588  df-uni 4865  df-int 4905  df-br 5100  df-opab 5162  df-mpt 5181  df-tr 5207  df-id 5540  df-eprel 5545  df-po 5553  df-so 5554  df-fr 5598  df-we 5600  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-res 5657  df-ima 5658  df-ord 6345  df-on 6346  df-suc 6348  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-f1 6522  df-fo 6523  df-f1o 6524  df-fv 6525  df-riota 7349  df-ov 7395  df-oprab 7396  df-mpo 7397  df-1o 8432  df-2o 8433  df-no 27684  df-lts 27685  df-bday 27686  df-les 27786  df-slts 27828  df-cuts 27830  df-0s 27877  df-1s 27878
This theorem is referenced by:  1ne0s  27890  left1s  27965  right1s  27966  ltsp1d  28085  precsexlem9  28285  n0sge0  28408  nnsrecgt0d  28421  twocut  28493  nohalf  28494  expsgt0  28507  pw2recs  28508  halfcut  28528  bdaypw2n0bndlem  28533  bdayfinbndlem1  28537  0reno  28566  1reno  28567
  Copyright terms: Public domain W3C validator