nnge1 - Metamath Proof Explorer

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

Theorem nnge1 12271

Description: A positive integer is one or greater. (Contributed by NM, 25-Aug-1999.)

**Assertion**
Ref	Expression
nnge1	⊢ (𝐴 ∈ ℕ → 1 ≤ 𝐴)

Proof of Theorem nnge1 Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		breq2 5152	. 2 ⊢ (𝑥 = 1 → (1 ≤ 𝑥 ↔ 1 ≤ 1))
2		breq2 5152	. 2 ⊢ (𝑥 = 𝑦 → (1 ≤ 𝑥 ↔ 1 ≤ 𝑦))
3		breq2 5152	. 2 ⊢ (𝑥 = (𝑦 + 1) → (1 ≤ 𝑥 ↔ 1 ≤ (𝑦 + 1)))
4		breq2 5152	. 2 ⊢ (𝑥 = 𝐴 → (1 ≤ 𝑥 ↔ 1 ≤ 𝐴))
5		1le1 11873	. 2 ⊢ 1 ≤ 1
6		nnre 12250	. . 3 ⊢ (𝑦 ∈ ℕ → 𝑦 ∈ ℝ)
7		recn 11229	. . . . . 6 ⊢ (𝑦 ∈ ℝ → 𝑦 ∈ ℂ)
8	7	addridd 11445	. . . . 5 ⊢ (𝑦 ∈ ℝ → (𝑦 + 0) = 𝑦)
9	8	breq2d 5160	. . . 4 ⊢ (𝑦 ∈ ℝ → (1 ≤ (𝑦 + 0) ↔ 1 ≤ 𝑦))
10		0lt1 11767	. . . . . . . 8 ⊢ 0 < 1
11		0re 11247	. . . . . . . . 9 ⊢ 0 ∈ ℝ
12		1re 11245	. . . . . . . . 9 ⊢ 1 ∈ ℝ
13		axltadd 11318	. . . . . . . . 9 ⊢ ((0 ∈ ℝ ∧ 1 ∈ ℝ ∧ 𝑦 ∈ ℝ) → (0 < 1 → (𝑦 + 0) < (𝑦 + 1)))
14	11, 12, 13	mp3an12 1448	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (0 < 1 → (𝑦 + 0) < (𝑦 + 1)))
15	10, 14	mpi 20	. . . . . . 7 ⊢ (𝑦 ∈ ℝ → (𝑦 + 0) < (𝑦 + 1))
16		readdcl 11222	. . . . . . . . 9 ⊢ ((𝑦 ∈ ℝ ∧ 0 ∈ ℝ) → (𝑦 + 0) ∈ ℝ)
17	11, 16	mpan2 690	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (𝑦 + 0) ∈ ℝ)
18		peano2re 11418	. . . . . . . 8 ⊢ (𝑦 ∈ ℝ → (𝑦 + 1) ∈ ℝ)
19		lttr 11321	. . . . . . . . 9 ⊢ (((𝑦 + 0) ∈ ℝ ∧ (𝑦 + 1) ∈ ℝ ∧ 1 ∈ ℝ) → (((𝑦 + 0) < (𝑦 + 1) ∧ (𝑦 + 1) < 1) → (𝑦 + 0) < 1))
20	12, 19	mp3an3 1447	. . . . . . . 8 ⊢ (((𝑦 + 0) ∈ ℝ ∧ (𝑦 + 1) ∈ ℝ) → (((𝑦 + 0) < (𝑦 + 1) ∧ (𝑦 + 1) < 1) → (𝑦 + 0) < 1))
21	17, 18, 20	syl2anc 583	. . . . . . 7 ⊢ (𝑦 ∈ ℝ → (((𝑦 + 0) < (𝑦 + 1) ∧ (𝑦 + 1) < 1) → (𝑦 + 0) < 1))
22	15, 21	mpand 694	. . . . . 6 ⊢ (𝑦 ∈ ℝ → ((𝑦 + 1) < 1 → (𝑦 + 0) < 1))
23	22	con3d 152	. . . . 5 ⊢ (𝑦 ∈ ℝ → (¬ (𝑦 + 0) < 1 → ¬ (𝑦 + 1) < 1))
24		lenlt 11323	. . . . . 6 ⊢ ((1 ∈ ℝ ∧ (𝑦 + 0) ∈ ℝ) → (1 ≤ (𝑦 + 0) ↔ ¬ (𝑦 + 0) < 1))
25	12, 17, 24	sylancr 586	. . . . 5 ⊢ (𝑦 ∈ ℝ → (1 ≤ (𝑦 + 0) ↔ ¬ (𝑦 + 0) < 1))
26		lenlt 11323	. . . . . 6 ⊢ ((1 ∈ ℝ ∧ (𝑦 + 1) ∈ ℝ) → (1 ≤ (𝑦 + 1) ↔ ¬ (𝑦 + 1) < 1))
27	12, 18, 26	sylancr 586	. . . . 5 ⊢ (𝑦 ∈ ℝ → (1 ≤ (𝑦 + 1) ↔ ¬ (𝑦 + 1) < 1))
28	23, 25, 27	3imtr4d 294	. . . 4 ⊢ (𝑦 ∈ ℝ → (1 ≤ (𝑦 + 0) → 1 ≤ (𝑦 + 1)))
29	9, 28	sylbird 260	. . 3 ⊢ (𝑦 ∈ ℝ → (1 ≤ 𝑦 → 1 ≤ (𝑦 + 1)))
30	6, 29	syl 17	. 2 ⊢ (𝑦 ∈ ℕ → (1 ≤ 𝑦 → 1 ≤ (𝑦 + 1)))
31	1, 2, 3, 4, 5, 30	nnind 12261	1 ⊢ (𝐴 ∈ ℕ → 1 ≤ 𝐴)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∈ wcel 2099 class class class wbr 5148 (class class class)co 7420 ℝcr 11138 0cc0 11139 1c1 11140 + caddc 11142 < clt 11279 ≤ cle 11280 ℕcn 12243

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-resscn 11196 ax-1cn 11197 ax-icn 11198 ax-addcl 11199 ax-addrcl 11200 ax-mulcl 11201 ax-mulrcl 11202 ax-mulcom 11203 ax-addass 11204 ax-mulass 11205 ax-distr 11206 ax-i2m1 11207 ax-1ne0 11208 ax-1rid 11209 ax-rnegex 11210 ax-rrecex 11211 ax-cnre 11212 ax-pre-lttri 11213 ax-pre-lttrn 11214 ax-pre-ltadd 11215 ax-pre-mulgt0 11216

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7376 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7871 df-2nd 7994 df-frecs 8287 df-wrecs 8318 df-recs 8392 df-rdg 8431 df-er 8725 df-en 8965 df-dom 8966 df-sdom 8967 df-pnf 11281 df-mnf 11282 df-xr 11283 df-ltxr 11284 df-le 11285 df-sub 11477 df-neg 11478 df-nn 12244

This theorem is referenced by: nngt1ne1 12272 nnle1eq1 12273 nngt0 12274 nnnlt1 12275 nnrecgt0 12286 nnge1d 12291 elnnnn0c 12548 zle0orge1 12606 elnnz1 12619 zltp1le 12643 nn0ledivnn 13120 fzo1fzo0n0 13716 elfzom1elp1fzo 13732 fzo0sn0fzo1 13754 addmodlteq 13944 nnlesq 14201 digit1 14232 expnngt1 14236 faclbnd 14282 faclbnd3 14284 faclbnd4lem1 14285 faclbnd4lem4 14288 len0nnbi 14534 fstwrdne0 14539 divalglem1 16371 coprmgcdb 16620 isprm3 16654 pockthg 16875 infpn2 16882 setsstruct 17145 chfacfpmmulgsum2 22780 dscmet 24494 ovolunlem1a 25438 vitali 25555 plyeq0lem 26157 logtayllem 26606 leibpi 26887 vmalelog 27151 chtublem 27157 logfaclbnd 27168 bposlem1 27230 gausslemma2dlem1a 27311 dchrisum0lem1 27462 logdivbnd 27502 pntlemn 27546 ostth2lem3 27581 clwwisshclwwslem 29837 clwlknf1oclwwlknlem2 29905 clwlknf1oclwwlknlem3 29906 clwlknf1oclwwlkn 29907 nnmulge 32533 lmatfvlem 33416 eulerpartlems 33980 eulerpartlemb 33988 ballotlem2 34108 reprlt 34251 fz0n 35325 nndivlub 35942 knoppndvlem1 35987 knoppndvlem2 35988 knoppndvlem7 35993 knoppndvlem11 35997 knoppndvlem14 36000 lcmineqlem13 41512 aks4d1p7d1 41553 metakunt26 41682 fzsplit1nn0 42174 pell1qrgaplem 42293 pellqrex 42299 monotoddzzfi 42363 jm2.23 42417 sumnnodd 45018 dvnmul 45331 wallispilem4 45456 wallispilem5 45457 wallispi 45458 wallispi2lem1 45459 stirlinglem5 45466 stirlinglem13 45474 dirkertrigeqlem1 45486 fouriersw 45619 etransclem24 45646 iccpartigtl 46763 fmtnodvds 46884 lighneallem2 46946 logbpw2m1 47640 blennnelnn 47649 blenpw2m1 47652 dignnld 47676 itcovalt2lem2lem1 47746

W3C validator

	
		OSZAR »