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

Theorem n0sge0 28729
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 5106 . 2 (𝑛 = 0s → ( 0s ≤s 𝑛 ↔ 0s ≤s 0s ))
2 breq2 5106 . 2 (𝑛 = 𝑚 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝑚))
3 breq2 5106 . 2 (𝑛 = (𝑚 +s 1s ) → ( 0s ≤s 𝑛 ↔ 0s ≤s (𝑚 +s 1s )))
4 breq2 5106 . 2 (𝑛 = 𝐴 → ( 0s ≤s 𝑛 ↔ 0s ≤s 𝐴))
5 0no 28200 . . 3 0s ∈ No
6 lesid 28129 . . 3 ( 0s ∈ No → 0s ≤s 0s )
75, 6ax-mp 5 . 2 0s ≤s 0s
85a1i 11 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ∈ No)
9 n0no 28714 . . . . 5 (𝑚 ∈ ℕ0s → 𝑚 ∈ No)
109adantr 486 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ∈ No)
11 peano2no 28375 . . . . . 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 28356 . . . . . 6 (𝑚 ∈ ℕ0s → (𝑚 +s 0s ) = 𝑚)
1615adantr 486 . . . . 5 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → (𝑚 +s 0s ) = 𝑚)
175a1i 11 . . . . . . . . 9 (⊤ → 0s ∈ No)
18 1no 28201 . . . . . . . . . 10 1s ∈ No
1918a1i 11 . . . . . . . . 9 (⊤ → 1s ∈ No)
20 0lt1s 28203 . . . . . . . . . 10 0s <s 1s
2120a1i 11 . . . . . . . . 9 (⊤ → 0s <s 1s )
2217, 19, 21ltlesd 28135 . . . . . . . 8 (⊤ → 0s ≤s 1s )
2322mptru 1576 . . . . . . 7 0s ≤s 1s
245a1i 11 . . . . . . . 8 (𝑚 ∈ ℕ0s → 0s ∈ No)
2518a1i 11 . . . . . . . 8 (𝑚 ∈ ℕ0s → 1s ∈ No)
2624, 25, 9leadds2d 28387 . . . . . . 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 5128 . . . 4 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 𝑚 ≤s (𝑚 +s 1s ))
308, 10, 13, 14, 29lestrd 28128 . . 3 ((𝑚 ∈ ℕ0s ∧ 0s ≤s 𝑚) → 0s ≤s (𝑚 +s 1s ))
3130ex 418 . 2 (𝑚 ∈ ℕ0s → ( 0s ≤s 𝑚 → 0s ≤s (𝑚 +s 1s )))
321, 2, 3, 4, 7, 31n0sind 28724 1 (𝐴 ∈ ℕ0s → 0s ≤s 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569  ⊤wtru 1570   ∈ wcel 2144   class class class wbr 5102  (class class class)co 7420  Nocsur 28002   <s clts 28003   ≤s cles 28106   0s c0s 28196   1s c1s 28197   +s cadds 28350  ℕ0scn0s 28703
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-tp 4589  df-op 4835  df-ot 4858  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-se 5604  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  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 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8302  df-wrecs 8333  df-recs 8382  df-rdg 8421  df-1o 8479  df-2o 8480  df-nadd 8678  df-no 28005  df-lts 28006  df-bday 28007  df-les 28107  df-slts 28149  df-cuts 28151  df-0s 28198  df-1s 28199  df-made 28218  df-old 28219  df-left 28221  df-right 28222  df-norec2 28340  df-adds 28351  df-n0s 28705
This theorem is used by:  nnsgt0  28730  elnns2  28732  nnsge1  28734  n0subs  28754  n0lts1e0  28759  eln0zs  28791  bdaypw2n0bndlem  28854  bdayfinbndlem1  28858  z12bdaylem1  28861
  Copyright terms: Public domain W3C validator