Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > nnge1 | Structured version Visualization version GIF version |
Description: A positive integer is one or greater. (Contributed by NM, 25-Aug-1999.) |
Ref | Expression |
---|---|
nnge1 | ⊢ (𝐴 ∈ ℕ → 1 ≤ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | breq2 5063 | . 2 ⊢ (𝑥 = 1 → (1 ≤ 𝑥 ↔ 1 ≤ 1)) | |
2 | breq2 5063 | . 2 ⊢ (𝑥 = 𝑦 → (1 ≤ 𝑥 ↔ 1 ≤ 𝑦)) | |
3 | breq2 5063 | . 2 ⊢ (𝑥 = (𝑦 + 1) → (1 ≤ 𝑥 ↔ 1 ≤ (𝑦 + 1))) | |
4 | breq2 5063 | . 2 ⊢ (𝑥 = 𝐴 → (1 ≤ 𝑥 ↔ 1 ≤ 𝐴)) | |
5 | 1le1 11261 | . 2 ⊢ 1 ≤ 1 | |
6 | nnre 11638 | . . 3 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℝ) | |
7 | recn 10620 | . . . . . 6 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ) | |
8 | 7 | addid1d 10833 | . . . . 5 ⊢ (𝑦 ∈ ℝ → (𝑦 + 0) = 𝑦) |
9 | 8 | breq2d 5071 | . . . 4 ⊢ (𝑦 ∈ ℝ → (1 ≤ (𝑦 + 0) ↔ 1 ≤ 𝑦)) |
10 | 0lt1 11155 | . . . . . . . 8 ⊢ 0 < 1 | |
11 | 0re 10636 | . . . . . . . . 9 ⊢ 0 ∈ ℝ | |
12 | 1re 10634 | . . . . . . . . 9 ⊢ 1 ∈ ℝ | |
13 | axltadd 10707 | . . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 < 1 → (𝑦 + 0) < (𝑦 + 1))) | |
14 | 11, 12, 13 | mp3an12 1446 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (0 < 1 → (𝑦 + 0) < (𝑦 + 1))) |
15 | 10, 14 | mpi 20 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (𝑦 + 0) < (𝑦 + 1)) |
16 | readdcl 10613 | . . . . . . . . 9 ⊢ ((𝑦 ∈ ℝ ∧ 0 ∈ ℝ) → (𝑦 + 0) ∈ ℝ) | |
17 | 11, 16 | mpan2 689 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (𝑦 + 0) ∈ ℝ) |
18 | peano2re 10806 | . . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (𝑦 + 1) ∈ ℝ) | |
19 | lttr 10710 | . . . . . . . . 9 ⊢ (((𝑦 + 0) ∈ ℝ ∧ (𝑦 + 1) ∈ ℝ ∧ 1 ∈ ℝ) → (((𝑦 + 0) < (𝑦 + 1) ∧ (𝑦 + 1) < 1) → (𝑦 + 0) < 1)) | |
20 | 12, 19 | mp3an3 1445 | . . . . . . . 8 ⊢ (((𝑦 + 0) ∈ ℝ ∧ (𝑦 + 1) ∈ ℝ) → (((𝑦 + 0) < (𝑦 + 1) ∧ (𝑦 + 1) < 1) → (𝑦 + 0) < 1)) |
21 | 17, 18, 20 | syl2anc 586 | . . . . . . 7 ⊢ (𝑦 ∈ ℝ → (((𝑦 + 0) < (𝑦 + 1) ∧ (𝑦 + 1) < 1) → (𝑦 + 0) < 1)) |
22 | 15, 21 | mpand 693 | . . . . . 6 ⊢ (𝑦 ∈ ℝ → ((𝑦 + 1) < 1 → (𝑦 + 0) < 1)) |
23 | 22 | con3d 155 | . . . . 5 ⊢ (𝑦 ∈ ℝ → (¬ (𝑦 + 0) < 1 → ¬ (𝑦 + 1) < 1)) |
24 | lenlt 10712 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ (𝑦 + 0) ∈ ℝ) → (1 ≤ (𝑦 + 0) ↔ ¬ (𝑦 + 0) < 1)) | |
25 | 12, 17, 24 | sylancr 589 | . . . . 5 ⊢ (𝑦 ∈ ℝ → (1 ≤ (𝑦 + 0) ↔ ¬ (𝑦 + 0) < 1)) |
26 | lenlt 10712 | . . . . . 6 ⊢ ((1 ∈ ℝ ∧ (𝑦 + 1) ∈ ℝ) → (1 ≤ (𝑦 + 1) ↔ ¬ (𝑦 + 1) < 1)) | |
27 | 12, 18, 26 | sylancr 589 | . . . . 5 ⊢ (𝑦 ∈ ℝ → (1 ≤ (𝑦 + 1) ↔ ¬ (𝑦 + 1) < 1)) |
28 | 23, 25, 27 | 3imtr4d 296 | . . . 4 ⊢ (𝑦 ∈ ℝ → (1 ≤ (𝑦 + 0) → 1 ≤ (𝑦 + 1))) |
29 | 9, 28 | sylbird 262 | . . 3 ⊢ (𝑦 ∈ ℝ → (1 ≤ 𝑦 → 1 ≤ (𝑦 + 1))) |
30 | 6, 29 | syl 17 | . 2 ⊢ (𝑦 ∈ ℕ → (1 ≤ 𝑦 → 1 ≤ (𝑦 + 1))) |
31 | 1, 2, 3, 4, 5, 30 | nnind 11649 | 1 ⊢ (𝐴 ∈ ℕ → 1 ≤ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∈ wcel 2113 class class class wbr 5059 (class class class)co 7149 ℝcr 10529 0cc0 10530 1c1 10531 + caddc 10533 < clt 10668 ≤ cle 10669 ℕcn 11631 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 ax-resscn 10587 ax-1cn 10588 ax-icn 10589 ax-addcl 10590 ax-addrcl 10591 ax-mulcl 10592 ax-mulrcl 10593 ax-mulcom 10594 ax-addass 10595 ax-mulass 10596 ax-distr 10597 ax-i2m1 10598 ax-1ne0 10599 ax-1rid 10600 ax-rnegex 10601 ax-rrecex 10602 ax-cnre 10603 ax-pre-lttri 10604 ax-pre-lttrn 10605 ax-pre-ltadd 10606 ax-pre-mulgt0 10607 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-reu 3144 df-rab 3146 df-v 3493 df-sbc 3769 df-csb 3877 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-pss 3947 df-nul 4285 df-if 4461 df-pw 4534 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7107 df-ov 7152 df-oprab 7153 df-mpo 7154 df-om 7574 df-wrecs 7940 df-recs 8001 df-rdg 8039 df-er 8282 df-en 8503 df-dom 8504 df-sdom 8505 df-pnf 10670 df-mnf 10671 df-xr 10672 df-ltxr 10673 df-le 10674 df-sub 10865 df-neg 10866 df-nn 11632 |
This theorem is referenced by: nngt1ne1 11660 nnle1eq1 11661 nngt0 11662 nnnlt1 11663 nnrecgt0 11674 nnge1d 11679 elnnnn0c 11936 zle0orge1 11992 elnnz1 12002 zltp1le 12026 nn0ledivnn 12496 fzo1fzo0n0 13085 elfzom1elp1fzo 13101 fzo0sn0fzo1 13123 addmodlteq 13311 nnlesq 13565 digit1 13595 expnngt1 13599 faclbnd 13647 faclbnd3 13649 faclbnd4lem1 13650 faclbnd4lem4 13653 len0nnbi 13898 fstwrdne0 13903 divalglem1 15740 coprmgcdb 15988 isprm3 16022 pockthg 16237 infpn2 16244 setsstruct 16518 chfacfpmmulgsum2 21468 dscmet 23177 ovolunlem1a 24092 vitali 24209 plyeq0lem 24798 logtayllem 25240 leibpi 25518 vmalelog 25779 chtublem 25785 logfaclbnd 25796 bposlem1 25858 gausslemma2dlem1a 25939 dchrisum0lem1 26090 logdivbnd 26130 pntlemn 26174 ostth2lem3 26209 clwwisshclwwslem 27790 clwlknf1oclwwlknlem2 27859 clwlknf1oclwwlknlem3 27860 clwlknf1oclwwlkn 27861 nnmulge 30474 lmatfvlem 31104 eulerpartlems 31639 eulerpartlemb 31647 ballotlem2 31767 reprlt 31911 fz0n 32983 nndivlub 33827 knoppndvlem1 33872 knoppndvlem2 33873 knoppndvlem7 33878 knoppndvlem11 33882 knoppndvlem14 33885 fzsplit1nn0 39427 pell1qrgaplem 39546 pellqrex 39552 monotoddzzfi 39615 jm2.23 39669 sumnnodd 41985 dvnmul 42302 wallispilem4 42427 wallispilem5 42428 wallispi 42429 wallispi2lem1 42430 stirlinglem5 42437 stirlinglem13 42445 dirkertrigeqlem1 42457 fouriersw 42590 etransclem24 42617 iccpartigtl 43657 fmtnodvds 43780 lighneallem2 43845 logbpw2m1 44701 blennnelnn 44710 blenpw2m1 44713 dignnld 44737 |
Copyright terms: Public domain | W3C validator |