| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > nn1m1nns | Structured version Visualization version GIF version | ||
| Description: Every positive surreal integer is either one or a successor. (Contributed by Scott Fenton, 8-Nov-2025.) |
| Ref | Expression |
|---|---|
| nn1m1nns | ⊢ (𝐴 ∈ ℕs → (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2739 | . . 3 ⊢ (𝑥 = 1s → (𝑥 = 1s ↔ 1s = 1s )) | |
| 2 | oveq1 7363 | . . . 4 ⊢ (𝑥 = 1s → (𝑥 -s 1s ) = ( 1s -s 1s )) | |
| 3 | 2 | eleq1d 2820 | . . 3 ⊢ (𝑥 = 1s → ((𝑥 -s 1s ) ∈ ℕs ↔ ( 1s -s 1s ) ∈ ℕs)) |
| 4 | 1, 3 | orbi12d 919 | . 2 ⊢ (𝑥 = 1s → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs))) |
| 5 | eqeq1 2739 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑥 = 1s ↔ 𝑦 = 1s )) | |
| 6 | oveq1 7363 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s )) | |
| 7 | 6 | eleq1d 2820 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝑦 -s 1s ) ∈ ℕs)) |
| 8 | 5, 7 | orbi12d 919 | . 2 ⊢ (𝑥 = 𝑦 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs))) |
| 9 | eqeq1 2739 | . . 3 ⊢ (𝑥 = (𝑦 +s 1s ) → (𝑥 = 1s ↔ (𝑦 +s 1s ) = 1s )) | |
| 10 | oveq1 7363 | . . . 4 ⊢ (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s )) | |
| 11 | 10 | eleq1d 2820 | . . 3 ⊢ (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕs ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)) |
| 12 | 9, 11 | orbi12d 919 | . 2 ⊢ (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))) |
| 13 | eqeq1 2739 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑥 = 1s ↔ 𝐴 = 1s )) | |
| 14 | oveq1 7363 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s )) | |
| 15 | 14 | eleq1d 2820 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝐴 -s 1s ) ∈ ℕs)) |
| 16 | 13, 15 | orbi12d 919 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs))) |
| 17 | eqid 2735 | . . 3 ⊢ 1s = 1s | |
| 18 | 17 | orci 866 | . 2 ⊢ ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs) |
| 19 | nnno 28304 | . . . . . 6 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ No ) | |
| 20 | 1no 27790 | . . . . . 6 ⊢ 1s ∈ No | |
| 21 | pncans 28052 | . . . . . 6 ⊢ ((𝑦 ∈ No ∧ 1s ∈ No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦) | |
| 22 | 19, 20, 21 | sylancl 587 | . . . . 5 ⊢ (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) = 𝑦) |
| 23 | id 22 | . . . . 5 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ ℕs) | |
| 24 | 22, 23 | eqeltrd 2835 | . . . 4 ⊢ (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) ∈ ℕs) |
| 25 | 24 | olcd 875 | . . 3 ⊢ (𝑦 ∈ ℕs → ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)) |
| 26 | 25 | a1d 25 | . 2 ⊢ (𝑦 ∈ ℕs → ((𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs) → ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))) |
| 27 | 4, 8, 12, 16, 18, 26 | nnsind 28353 | 1 ⊢ (𝐴 ∈ ℕs → (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 848 = wceq 1542 ∈ wcel 2114 (class class class)co 7356 No csur 27591 1s c1s 27786 +s cadds 27939 -s csubs 28000 ℕscnns 28293 |
| 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 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 |
| 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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-ral 3050 df-rex 3060 df-rmo 3340 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-ot 4566 df-uni 4841 df-int 4880 df-iun 4925 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-se 5574 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-2o 8395 df-nadd 8591 df-no 27594 df-lts 27595 df-bday 27596 df-les 27697 df-slts 27738 df-cuts 27740 df-0s 27787 df-1s 27788 df-made 27807 df-old 27808 df-left 27810 df-right 27811 df-norec 27918 df-norec2 27929 df-adds 27940 df-negs 28001 df-subs 28002 df-n0s 28294 df-nns 28295 |
| This theorem is referenced by: nnm1n0s 28355 |
| Copyright terms: Public domain | W3C validator |