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

Theorem n0sge0 28754
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 5110 . 2 (𝑛 = 0s → ( 0s ≤s 𝑛 ↔ 0s ≤s 0s ))
2 breq2 5110 . 2 (𝑛 = 𝑚 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝑚))
3 breq2 5110 . 2 (𝑛 = (𝑚 +s 1s ) → ( 0s ≤s 𝑛 ↔ 0s ≤s (𝑚 +s 1s )))
4 breq2 5110 . 2 (𝑛 = 𝐴 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝐴))
5 0no 28225 . . 3 0s ∈ No
6 lesid 28154 . . 3 ( 0s ∈ No → 0s ≤s 0s )
75, 6ax-mp 5 . 2 0s ≤s 0s
85a1i 11 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ∈ No)
9 n0no 28739 . . . . 5 (𝑚 ∈ ℕ0s → 𝑚 ∈ No)
109adantr 486 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ∈ No)
11 peano2no 28400 . . . . . 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 28381 . . . . . 6 (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) = 𝑚)
1615adantr 486 . . . . 5 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) = 𝑚)
175a1i 11 . . . . . . . . 9 (⊤ → 0s ∈ No)
18 1no 28226 . . . . . . . . . 10 1s ∈ No
1918a1i 11 . . . . . . . . 9 (⊤ → 1s ∈ No)
20 0lt1s 28228 . . . . . . . . . 10 0s <s 1s
2120a1i 11 . . . . . . . . 9 (⊤ → 0s <s 1s )
2217, 19, 21ltlesd 28160 . . . . . . . 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 28412 . . . . . . 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 5132 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ≤s (𝑚 +s 1s ))
308, 10, 13, 14, 29lestrd 28153 . . 3 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s (𝑚 +s 1s ))
3130ex 418 . 2 (𝑚 ∈ ℕ0s → ( 0s ≤s 𝑚 → 0s ≤s (𝑚 +s 1s )))
321, 2, 3, 4, 7, 31n0sind 28749 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 2147   class class class wbr 5106  (class class class)co 7443  Nocsur 28027   <s clts 28028   ≤s cles 28131   0s c0s 28221   1s c1s 28222   +s cadds 28375  ℕ0scn0s 28728
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-ot 4862  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-1o 8504  df-2o 8505  df-nadd 8703  df-no 28030  df-lts 28031  df-bday 28032  df-les 28132  df-slts 28174  df-cuts 28176  df-0s 28223  df-1s 28224  df-made 28243  df-old 28244  df-left 28246  df-right 28247  df-norec2 28365  df-adds 28376  df-n0s 28730
This theorem is used by:  nnsgt0  28755  elnns2  28757  nnsge1  28759  n0subs  28779  n0lts1e0  28784  eln0zs  28816  bdaypw2n0bndlem  28879  bdayfinbndlem1  28883  z12bdaylem1  28886
  Copyright terms: Public domain W3C validator