MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  n0sge0 Structured version   Visualization version   GIF version

Theorem n0sge0 28706
Description: A non-negative integer is greater than or equal to zero. (Contributed by Scott Fenton, 15-Apr-2025.)
Assertion
Ref Expression
n0sge0 (𝐴 ∈ ℕ0s → 0s ≤s 𝐴)

Proof of Theorem n0sge0
Dummy variables 𝑛 𝑚 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 breq2 5107 . 2 (𝑛 = 0s → ( 0s ≤s 𝑛 ↔ 0s ≤s 0s ))
2 breq2 5107 . 2 (𝑛 = 𝑚 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝑚))
3 breq2 5107 . 2 (𝑛 = (𝑚 +s 1s ) → ( 0s ≤s 𝑛 ↔ 0s ≤s (𝑚 +s 1s )))
4 breq2 5107 . 2 (𝑛 = 𝐴 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝐴))
5 0no 28177 . . 3 0s ∈ No
6 lesid 28106 . . 3 ( 0s ∈ No → 0s ≤s 0s )
75, 6ax-mp 5 . 2 0s ≤s 0s
85a1i 11 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ∈ No )
9 n0no 28691 . . . . 5 (𝑚 ∈ ℕ0s → 𝑚 ∈ No )
109adantr 486 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ∈ No )
11 peano2no 28352 . . . . . 6 (𝑚 ∈ No → (𝑚 +s 1s ) ∈ No )
129, 11syl 18 . . . . 5 (𝑚 ∈ ℕ0s → (𝑚 +s 1s ) ∈ No )
1312adantr 486 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 1s ) ∈ No )
14 simpr 490 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s 𝑚)
159addsridd 28333 . . . . . 6 (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) = 𝑚)
1615adantr 486 . . . . 5 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) = 𝑚)
175a1i 11 . . . . . . . . 9 (⊤ → 0s ∈ No )
18 1no 28178 . . . . . . . . . 10 1s ∈ No
1918a1i 11 . . . . . . . . 9 (⊤ → 1s ∈ No )
20 0lt1s 28180 . . . . . . . . . 10 0s <s 1s
2120a1i 11 . . . . . . . . 9 (⊤ → 0s <s 1s )
2217, 19, 21ltlesd 28112 . . . . . . . 8 (⊤ → 0s ≤s 1s )
2322mptru 1577 . . . . . . 7 0s ≤s 1s
245a1i 11 . . . . . . . 8 (𝑚 ∈ ℕ0s → 0s ∈ No )
2518a1i 11 . . . . . . . 8 (𝑚 ∈ ℕ0s → 1s ∈ No )
2624, 25, 9leadds2d 28364 . . . . . . 7 (𝑚 ∈ ℕ0s → ( 0s ≤s 1s ↔ (𝑚 +s 0s ) ≤s (𝑚 +s 1s )))
2723, 26mpbii 236 . . . . . 6 (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) ≤s (𝑚 +s 1s ))
2827adantr 486 . . . . 5 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) ≤s (𝑚 +s 1s ))
2916, 28eqbrtrrd 5129 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ≤s (𝑚 +s 1s ))
308, 10, 13, 14, 29lestrd 28105 . . 3 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s (𝑚 +s 1s ))
3130ex 418 . 2 (𝑚 ∈ ℕ0s → ( 0s ≤s 𝑚 → 0s ≤s (𝑚 +s 1s )))
321, 2, 3, 4, 7, 31n0sind 28701 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 5103  (class class class)co 7412   No csur 27979   <s clts 27980   ≤s cles 28083   0s c0s 28173   1s c1s 28174   +s cadds 28327  ℕ0scn0s 28680
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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  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 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 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4591  df-ot 4593  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6297  df-ord 6358  df-on 6359  df-lim 6360  df-suc 6361  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8460  df-2o 8461  df-nadd 8659  df-no 27982  df-lts 27983  df-bday 27984  df-les 28084  df-slts 28126  df-cuts 28128  df-0s 28175  df-1s 28176  df-made 28195  df-old 28196  df-left 28198  df-right 28199  df-norec2 28317  df-adds 28328  df-n0s 28682
This theorem is used by:  nnsgt0  28707  elnns2  28709  nnsge1  28711  n0subs  28731  n0lts1e0  28736  eln0zs  28768  bdaypw2n0bndlem  28831  bdayfinbndlem1  28835  z12bdaylem1  28838
  Copyright terms: Public domain W3C validator