| 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 5114 | . 2 ⊢ (𝑛 = 0s → ( 0s ≤s 𝑛 ↔ 0s ≤s 0s )) | |
| 2 | breq2 5114 | . 2 ⊢ (𝑛 = 𝑚 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝑚)) | |
| 3 | breq2 5114 | . 2 ⊢ (𝑛 = (𝑚 +s 1s ) → ( 0s ≤s 𝑛 ↔ 0s ≤s (𝑚 +s 1s ))) | |
| 4 | breq2 5114 | . 2 ⊢ (𝑛 = 𝐴 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝐴)) | |
| 5 | 0no 27980 | . . 3 ⊢ 0s ∈ No | |
| 6 | lesid 27909 | . . 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 28494 | . . . . 5 ⊢ (𝑚 ∈ ℕ0s → 𝑚 ∈ No ) | |
| 10 | 9 | adantr 485 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ∈ No ) |
| 11 | peano2no 28155 | . . . . . 6 ⊢ (𝑚 ∈ No → (𝑚 +s 1s ) ∈ No ) | |
| 12 | 9, 11 | syl 18 | . . . . 5 ⊢ (𝑚 ∈ ℕ0s → (𝑚 +s 1s ) ∈ No ) |
| 13 | 12 | adantr 485 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 1s ) ∈ No ) |
| 14 | simpr 489 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s 𝑚) | |
| 15 | 9 | addsridd 28136 | . . . . . 6 ⊢ (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) = 𝑚) |
| 16 | 15 | adantr 485 | . . . . 5 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) = 𝑚) |
| 17 | 5 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 0s ∈ No ) |
| 18 | 1no 27981 | . . . . . . . . . 10 ⊢ 1s ∈ No | |
| 19 | 18 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 1s ∈ No ) |
| 20 | 0lt1s 27983 | . . . . . . . . . 10 ⊢ 0s <s 1s | |
| 21 | 20 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 0s <s 1s ) |
| 22 | 17, 19, 21 | ltlesd 27915 | . . . . . . . 8 ⊢ (⊤ → 0s ≤s 1s ) |
| 23 | 22 | mptru 1577 | . . . . . . 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 28167 | . . . . . . 7 ⊢ (𝑚 ∈ ℕ0s → ( 0s ≤s 1s ↔ (𝑚 +s 0s ) ≤s (𝑚 +s 1s ))) |
| 27 | 23, 26 | mpbii 236 | . . . . . 6 ⊢ (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) ≤s (𝑚 +s 1s )) |
| 28 | 27 | adantr 485 | . . . . 5 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) ≤s (𝑚 +s 1s )) |
| 29 | 16, 28 | eqbrtrrd 5136 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ≤s (𝑚 +s 1s )) |
| 30 | 8, 10, 13, 14, 29 | lestrd 27908 | . . 3 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s (𝑚 +s 1s )) |
| 31 | 30 | ex 417 | . 2 ⊢ (𝑚 ∈ ℕ0s → ( 0s ≤s 𝑚 → 0s ≤s (𝑚 +s 1s ))) |
| 32 | 1, 2, 3, 4, 7, 31 | n0sind 28504 | 1 ⊢ (𝐴 ∈ ℕ0s → 0s ≤s 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1570 ⊤wtru 1571 ∈ wcel 2143 class class class wbr 5110 (class class class)co 7412 No csur 27782 <s clts 27783 ≤s cles 27886 0s c0s 27976 1s c1s 27977 +s cadds 28130 ℕ0scn0s 28483 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5239 ax-sep 5258 ax-nul 5270 ax-pow 5338 ax-pr 5406 ax-un 7734 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3746 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4288 df-if 4489 df-pw 4565 df-sn 4591 df-pr 4593 df-tp 4595 df-op 4597 df-ot 4599 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-se 5617 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8279 df-wrecs 8310 df-recs 8359 df-rdg 8398 df-1o 8454 df-2o 8455 df-nadd 8653 df-no 27785 df-lts 27786 df-bday 27787 df-les 27887 df-slts 27929 df-cuts 27931 df-0s 27978 df-1s 27979 df-made 27998 df-old 27999 df-left 28001 df-right 28002 df-norec2 28120 df-adds 28131 df-n0s 28485 |
| This theorem is referenced by: nnsgt0 28510 elnns2 28512 nnsge1 28514 n0subs 28534 n0lts1e0 28539 eln0zs 28571 bdaypw2n0bndlem 28634 bdayfinbndlem1 28638 z12bdaylem1 28641 |
| Copyright terms: Public domain | W3C validator |