| 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 2765 | . . 3 ⊢ (𝑥 = 1s → (𝑥 = 1s ↔ 1s = 1s )) | |
| 2 | oveq1 7417 | . . . 4 ⊢ (𝑥 = 1s → (𝑥 -s 1s ) = ( 1s -s 1s )) | |
| 3 | 2 | eleq1d 2846 | . . 3 ⊢ (𝑥 = 1s → ((𝑥 -s 1s ) ∈ ℕs ↔ ( 1s -s 1s ) ∈ ℕs)) |
| 4 | 1, 3 | orbi12d 931 | . 2 ⊢ (𝑥 = 1s → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs))) |
| 5 | eqeq1 2765 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑥 = 1s ↔ 𝑦 = 1s )) | |
| 6 | oveq1 7417 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 -s 1s ) = (𝑦 -s 1s )) | |
| 7 | 6 | eleq1d 2846 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝑦 -s 1s ) ∈ ℕs)) |
| 8 | 5, 7 | orbi12d 931 | . 2 ⊢ (𝑥 = 𝑦 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs))) |
| 9 | eqeq1 2765 | . . 3 ⊢ (𝑥 = (𝑦 +s 1s ) → (𝑥 = 1s ↔ (𝑦 +s 1s ) = 1s )) | |
| 10 | oveq1 7417 | . . . 4 ⊢ (𝑥 = (𝑦 +s 1s ) → (𝑥 -s 1s ) = ((𝑦 +s 1s ) -s 1s )) | |
| 11 | 10 | eleq1d 2846 | . . 3 ⊢ (𝑥 = (𝑦 +s 1s ) → ((𝑥 -s 1s ) ∈ ℕs ↔ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)) |
| 12 | 9, 11 | orbi12d 931 | . 2 ⊢ (𝑥 = (𝑦 +s 1s ) → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))) |
| 13 | eqeq1 2765 | . . 3 ⊢ (𝑥 = 𝐴 → (𝑥 = 1s ↔ 𝐴 = 1s )) | |
| 14 | oveq1 7417 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 -s 1s ) = (𝐴 -s 1s )) | |
| 15 | 14 | eleq1d 2846 | . . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 -s 1s ) ∈ ℕs ↔ (𝐴 -s 1s ) ∈ ℕs)) |
| 16 | 13, 15 | orbi12d 931 | . 2 ⊢ (𝑥 = 𝐴 → ((𝑥 = 1s ∨ (𝑥 -s 1s ) ∈ ℕs) ↔ (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs))) |
| 17 | eqid 2761 | . . 3 ⊢ 1s = 1s | |
| 18 | 17 | orci 878 | . 2 ⊢ ( 1s = 1s ∨ ( 1s -s 1s ) ∈ ℕs) |
| 19 | nnno 28493 | . . . . . 6 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ No ) | |
| 20 | 1no 27979 | . . . . . 6 ⊢ 1s ∈ No | |
| 21 | pncans 28241 | . . . . . 6 ⊢ ((𝑦 ∈ No ∧ 1s ∈ No ) → ((𝑦 +s 1s ) -s 1s ) = 𝑦) | |
| 22 | 19, 20, 21 | sylancl 597 | . . . . 5 ⊢ (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) = 𝑦) |
| 23 | id 23 | . . . . 5 ⊢ (𝑦 ∈ ℕs → 𝑦 ∈ ℕs) | |
| 24 | 22, 23 | eqeltrd 2861 | . . . 4 ⊢ (𝑦 ∈ ℕs → ((𝑦 +s 1s ) -s 1s ) ∈ ℕs) |
| 25 | 24 | olcd 887 | . . 3 ⊢ (𝑦 ∈ ℕs → ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs)) |
| 26 | 25 | a1d 26 | . 2 ⊢ (𝑦 ∈ ℕs → ((𝑦 = 1s ∨ (𝑦 -s 1s ) ∈ ℕs) → ((𝑦 +s 1s ) = 1s ∨ ((𝑦 +s 1s ) -s 1s ) ∈ ℕs))) |
| 27 | 4, 8, 12, 16, 18, 26 | nnsind 28542 | 1 ⊢ (𝐴 ∈ ℕs → (𝐴 = 1s ∨ (𝐴 -s 1s ) ∈ ℕs)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∨ wo 860 = wceq 1568 ∈ wcel 2141 (class class class)co 7410 No csur 27780 1s c1s 27975 +s cadds 28128 -s csubs 28189 ℕscnns 28482 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5336 ax-pr 5404 ax-un 7732 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2095 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 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4595 df-ot 4597 df-uni 4872 df-int 4912 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-nadd 8651 df-no 27783 df-lts 27784 df-bday 27785 df-les 27885 df-slts 27927 df-cuts 27929 df-0s 27976 df-1s 27977 df-made 27996 df-old 27997 df-left 27999 df-right 28000 df-norec 28107 df-norec2 28118 df-adds 28129 df-negs 28190 df-subs 28191 df-n0s 28483 df-nns 28484 |
| This theorem is referenced by: nnm1n0s 28544 |
| Copyright terms: Public domain | W3C validator |