| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > 0lt1s | Structured version Visualization version GIF version | ||
| Description: Surreal zero is less than surreal one. Theorem from [Conway] p. 7. (Contributed by Scott Fenton, 7-Aug-2024.) |
| Ref | Expression |
|---|---|
| 0lt1s | ⊢ 0s <s 1s |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0no 28177 | . . . . 5 ⊢ 0s ∈ No | |
| 2 | lesid 28106 | . . . . 5 ⊢ ( 0s ∈ No → 0s ≤s 0s ) | |
| 3 | 1, 2 | ax-mp 5 | . . . 4 ⊢ 0s ≤s 0s |
| 4 | 1 | elexi 3473 | . . . . 5 ⊢ 0s ∈ V |
| 5 | breq2 5107 | . . . . 5 ⊢ (𝑥 = 0s → ( 0s ≤s 𝑥 ↔ 0s ≤s 0s )) | |
| 6 | 4, 5 | rexsn 4643 | . . . 4 ⊢ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ↔ 0s ≤s 0s ) |
| 7 | 3, 6 | mpbir 234 | . . 3 ⊢ ∃𝑥 ∈ { 0s } 0s ≤s 𝑥 |
| 8 | 7 | orci 879 | . 2 ⊢ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s ) |
| 9 | 0elpw 5317 | . . . 4 ⊢ ∅ ∈ 𝒫 No | |
| 10 | nulsgts 28144 | . . . 4 ⊢ (∅ ∈ 𝒫 No → ∅ <<s ∅) | |
| 11 | 9, 10 | ax-mp 5 | . . 3 ⊢ ∅ <<s ∅ |
| 12 | snssi 4746 | . . . . . 6 ⊢ ( 0s ∈ No → { 0s } ⊆ No ) | |
| 13 | 1, 12 | ax-mp 5 | . . . . 5 ⊢ { 0s } ⊆ No |
| 14 | snex 5397 | . . . . . 6 ⊢ { 0s } ∈ V | |
| 15 | 14 | elpw 4561 | . . . . 5 ⊢ ({ 0s } ∈ 𝒫 No ↔ { 0s } ⊆ No ) |
| 16 | 13, 15 | mpbir 234 | . . . 4 ⊢ { 0s } ∈ 𝒫 No |
| 17 | nulsgts 28144 | . . . 4 ⊢ ({ 0s } ∈ 𝒫 No → { 0s } <<s ∅) | |
| 18 | 16, 17 | ax-mp 5 | . . 3 ⊢ { 0s } <<s ∅ |
| 19 | df-0s 28175 | . . 3 ⊢ 0s = (∅ |s ∅) | |
| 20 | df-1s 28176 | . . 3 ⊢ 1s = ({ 0s } |s ∅) | |
| 21 | ltsrec 28169 | . . 3 ⊢ (((∅ <<s ∅ ∧ { 0s } <<s ∅) ∧ ( 0s = (∅ |s ∅) ∧ 1s = ({ 0s } |s ∅))) → ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s ))) | |
| 22 | 11, 18, 19, 20, 21 | mp4an 706 | . 2 ⊢ ( 0s <s 1s ↔ (∃𝑥 ∈ { 0s } 0s ≤s 𝑥 ∨ ∃𝑦 ∈ ∅ 𝑦 ≤s 1s )) |
| 23 | 8, 22 | mpbir 234 | 1 ⊢ 0s <s 1s |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∃wrex 3087 ⊆ wss 3899 ∅c0 4279 𝒫 cpw 4557 {csn 4584 class class class wbr 5103 (class class class)co 7412 No csur 27979 <s clts 27980 ≤s cles 28083 <<s cslts 28125 |s ccuts 28127 0s c0s 28173 1s c1s 28174 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-ord 6358 df-on 6359 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1o 8460 df-2o 8461 df-no 27982 df-lts 27983 df-bday 27984 df-les 28084 df-slts 28126 df-cuts 28128 df-0s 28175 df-1s 28176 |
| This theorem is used by: 1ne0s 28188 left1s 28263 right1s 28264 ltsp1d 28383 precsexlem9 28583 n0sge0 28706 nnsrecgt0d 28719 twocut 28791 nohalf 28792 expsgt0 28805 pw2recs 28806 halfcut 28826 bdaypw2n0bndlem 28831 bdayfinbndlem1 28835 0reno 28864 1reno 28865 |
| Copyright terms: Public domain | W3C validator |