| 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 5111 | . 2 ⊢ (𝑛 = 0s → ( 0s ≤s 𝑛 ↔ 0s ≤s 0s )) | |
| 2 | breq2 5111 | . 2 ⊢ (𝑛 = 𝑚 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝑚)) | |
| 3 | breq2 5111 | . 2 ⊢ (𝑛 = (𝑚 +s 1s ) → ( 0s ≤s 𝑛 ↔ 0s ≤s (𝑚 +s 1s ))) | |
| 4 | breq2 5111 | . 2 ⊢ (𝑛 = 𝐴 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝐴)) | |
| 5 | 0no 28082 | . . 3 ⊢ 0s ∈ No | |
| 6 | lesid 28011 | . . 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 28596 | . . . . 5 ⊢ (𝑚 ∈ ℕ0s → 𝑚 ∈ No ) | |
| 10 | 9 | adantr 486 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ∈ No ) |
| 11 | peano2no 28257 | . . . . . 6 ⊢ (𝑚 ∈ No → (𝑚 +s 1s ) ∈ No ) | |
| 12 | 9, 11 | syl 18 | . . . . 5 ⊢ (𝑚 ∈ ℕ0s → (𝑚 +s 1s ) ∈ No ) |
| 13 | 12 | adantr 486 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 1s ) ∈ No ) |
| 14 | simpr 490 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s 𝑚) | |
| 15 | 9 | addsridd 28238 | . . . . . 6 ⊢ (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) = 𝑚) |
| 16 | 15 | adantr 486 | . . . . 5 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) = 𝑚) |
| 17 | 5 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 0s ∈ No ) |
| 18 | 1no 28083 | . . . . . . . . . 10 ⊢ 1s ∈ No | |
| 19 | 18 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 1s ∈ No ) |
| 20 | 0lt1s 28085 | . . . . . . . . . 10 ⊢ 0s <s 1s | |
| 21 | 20 | a1i 11 | . . . . . . . . 9 ⊢ (⊤ → 0s <s 1s ) |
| 22 | 17, 19, 21 | ltlesd 28017 | . . . . . . . 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 28269 | . . . . . . 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 486 | . . . . 5 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) ≤s (𝑚 +s 1s )) |
| 29 | 16, 28 | eqbrtrrd 5133 | . . . 4 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ≤s (𝑚 +s 1s )) |
| 30 | 8, 10, 13, 14, 29 | lestrd 28010 | . . 3 ⊢ ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s (𝑚 +s 1s )) |
| 31 | 30 | ex 418 | . 2 ⊢ (𝑚 ∈ ℕ0s → ( 0s ≤s 𝑚 → 0s ≤s (𝑚 +s 1s ))) |
| 32 | 1, 2, 3, 4, 7, 31 | n0sind 28606 | 1 ⊢ (𝐴 ∈ ℕ0s → 0s ≤s 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ⊤wtru 1571 ∈ wcel 2145 class class class wbr 5107 (class class class)co 7417 No csur 27884 <s clts 27885 ≤s cles 27988 0s c0s 28078 1s c1s 28079 +s cadds 28232 ℕ0scn0s 28585 |
| 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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-ot 4596 df-uni 4871 df-int 4911 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-nadd 8658 df-no 27887 df-lts 27888 df-bday 27889 df-les 27989 df-slts 28031 df-cuts 28033 df-0s 28080 df-1s 28081 df-made 28100 df-old 28101 df-left 28103 df-right 28104 df-norec2 28222 df-adds 28233 df-n0s 28587 |
| This theorem is used by: nnsgt0 28612 elnns2 28614 nnsge1 28616 n0subs 28636 n0lts1e0 28641 eln0zs 28673 bdaypw2n0bndlem 28736 bdayfinbndlem1 28740 z12bdaylem1 28743 |
| Copyright terms: Public domain | W3C validator |