| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > n0sge0 | Structured version Visualization version GIF version | ||
| Description: A non-negative integer is greater than or equal to zero. (Contributed by Scott Fenton, 15-Apr-2025.) |
| Ref | Expression |
|---|---|
| n0sge0 | ⊢ (𝐴 ∈ ℕ0s → 0s ≤s 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | breq2 5090 | . 2 ⊢ (𝑛 = 0s → ( 0s ≤s 𝑛 ↔ 0s ≤s 0s )) | |
| 2 | breq2 5090 | . 2 ⊢ (𝑛 = 𝑚 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝑚)) | |
| 3 | breq2 5090 | . 2 ⊢ (𝑛 = (𝑚 +s 1s ) → ( 0s ≤s 𝑛 ↔ 0s ≤s (𝑚 +s 1s ))) | |
| 4 | breq2 5090 | . 2 ⊢ (𝑛 = 𝐴 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝐴)) | |
| 5 | 0no 27815 | . . 3 ⊢ 0s ∈ No | |
| 6 | lesid 27745 | . . 3 ⊢ ( 0s ∈ No → 0s ≤s 0s ) | |
| 7 | 5, 6 | ax-mp 5 | . 2 ⊢ 0s ≤s 0s |
| 8 | 5 | a1i 11 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ∈ No ) |
| 9 | n0no 28329 | . . . . 5 ⊢ (𝑚 ∈ ℕ0s → 𝑚 ∈ No ) | |
| 10 | 9 | adantr 480 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ∈ No ) |
| 11 | peano2no 27990 | . . . . . 6 ⊢ (𝑚 ∈ No → (𝑚 +s 1s ) ∈ No ) | |
| 12 | 9, 11 | syl 17 | . . . . 5 ⊢ (𝑚 ∈ ℕ0s → (𝑚 +s 1s ) ∈ No ) |
| 13 | 12 | adantr 480 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 1s ) ∈ No ) |
| 14 | simpr 484 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s 𝑚) | |
| 15 | 9 | addsridd 27971 | . . . . . 6 ⊢ (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) = 𝑚) |
| 16 | 15 | adantr 480 | . . . . 5 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) = 𝑚) |
| 17 | 5 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 0s ∈ No ) |
| 18 | 1no 27816 | . . . . . . . . . 10 ⊢ 1s ∈ No | |
| 19 | 18 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 1s ∈ No ) |
| 20 | 0lt1s 27818 | . . . . . . . . . 10 ⊢ 0s <s 1s | |
| 21 | 20 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 0s <s 1s ) |
| 22 | 17, 19, 21 | ltlesd 27751 | . . . . . . . 8 ⊢ (⊤ → 0s ≤s 1s ) |
| 23 | 22 | mptru 1549 | . . . . . . 7 ⊢ 0s ≤s 1s |
| 24 | 5 | a1i 11 | . . . . . . . 8 ⊢ (𝑚 ∈ ℕ0s → 0s ∈ No ) |
| 25 | 18 | a1i 11 | . . . . . . . 8 ⊢ (𝑚 ∈ ℕ0s → 1s ∈ No ) |
| 26 | 24, 25, 9 | leadds2d 28002 | . . . . . . 7 ⊢ (𝑚 ∈ ℕ0s → ( 0s ≤s 1s ↔ (𝑚 +s 0s ) ≤s (𝑚 +s 1s ))) |
| 27 | 23, 26 | mpbii 233 | . . . . . 6 ⊢ (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) ≤s (𝑚 +s 1s )) |
| 28 | 27 | adantr 480 | . . . . 5 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) ≤s (𝑚 +s 1s )) |
| 29 | 16, 28 | eqbrtrrd 5110 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ≤s (𝑚 +s 1s )) |
| 30 | 8, 10, 13, 14, 29 | lestrd 27744 | . . 3 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s (𝑚 +s 1s )) |
| 31 | 30 | ex 412 | . 2 ⊢ (𝑚 ∈ ℕ0s → ( 0s ≤s 𝑚 → 0s ≤s (𝑚 +s 1s ))) |
| 32 | 1, 2, 3, 4, 7, 31 | n0sind 28339 | 1 ⊢ (𝐴 ∈ ℕ0s → 0s ≤s 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ⊤wtru 1543 ∈ wcel 2114 class class class wbr 5086 (class class class)co 7360 No csur 27617 <s clts 27618 ≤s cles 27722 0s c0s 27811 1s c1s 27812 +s cadds 27965 ℕ0scn0s 28318 |
| 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 2185 ax-ext 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5302 ax-pr 5370 ax-un 7682 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-ot 4577 df-uni 4852 df-int 4891 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8342 df-1o 8398 df-2o 8399 df-nadd 8595 df-no 27620 df-lts 27621 df-bday 27622 df-les 27723 df-slts 27764 df-cuts 27766 df-0s 27813 df-1s 27814 df-made 27833 df-old 27834 df-left 27836 df-right 27837 df-norec2 27955 df-adds 27966 df-n0s 28320 |
| This theorem is referenced by: nnsgt0 28345 elnns2 28347 nnsge1 28349 n0subs 28369 n0lts1e0 28374 eln0zs 28406 bdaypw2n0bndlem 28469 bdayfinbndlem1 28473 z12bdaylem1 28476 |
| Copyright terms: Public domain | W3C validator |