ppiltx - Metamath Proof Explorer

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

Theorem ppiltx 27341

Description: The prime-counting function π is strictly less than the identity. (Contributed by Mario Carneiro, 22-Sep-2014.)

**Assertion**
Ref	Expression
ppiltx	⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) < 𝐴)

**Proof of Theorem ppiltx**
Step	Hyp	Ref	Expression
1		rpre 13020	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → 𝐴 ∈ ℝ)
2		ppicl 27295	. . . . . 6 ⊢ (𝐴 ∈ ℝ → (π‘𝐴) ∈ ℕ₀)
3	1, 2	syl 18	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) ∈ ℕ₀)
4	3	nn0red 12561	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) ∈ ℝ)
5	4	adantr 485	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) ∈ ℝ)
6		reflcl 13825	. . . . 5 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℝ)
7	1, 6	syl 18	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℝ)
8	7	adantr 485	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ ℝ)
9	1	adantr 485	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → 𝐴 ∈ ℝ)
10		fzfi 14004	. . . . . 6 ⊢ (1...(⌊‘𝐴)) ∈ Fin
11		inss1 4189	. . . . . . 7 ⊢ ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴))
12		2eluzge1 12901	. . . . . . . . 9 ⊢ 2 ∈ (ℤ_≥‘1)
13		fzss1 13587	. . . . . . . . 9 ⊢ (2 ∈ (ℤ_≥‘1) → (2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)))
14	12, 13	mp1i 14	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)))
15		simpr 489	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ ℕ)
16		nnuz 12896	. . . . . . . . . . . 12 ⊢ ℕ = (ℤ_≥‘1)
17	15, 16	eleqtrdi 2873	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ (ℤ_≥‘1))
18		eluzfz1 13554	. . . . . . . . . . 11 ⊢ ((⌊‘𝐴) ∈ (ℤ_≥‘1) → 1 ∈ (1...(⌊‘𝐴)))
19	17, 18	syl 18	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → 1 ∈ (1...(⌊‘𝐴)))
20		1lt2 12408	. . . . . . . . . . . 12 ⊢ 1 < 2
21		1re 11203	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℝ
22		2re 12310	. . . . . . . . . . . . 13 ⊢ 2 ∈ ℝ
23	21, 22	ltnlei 11326	. . . . . . . . . . . 12 ⊢ (1 < 2 ↔ ¬ 2 ≤ 1)
24	20, 23	mpbi 233	. . . . . . . . . . 11 ⊢ ¬ 2 ≤ 1
25		elfzle1 13550	. . . . . . . . . . 11 ⊢ (1 ∈ (2...(⌊‘𝐴)) → 2 ≤ 1)
26	24, 25	mto 200	. . . . . . . . . 10 ⊢ ¬ 1 ∈ (2...(⌊‘𝐴))
27		nelne1 3055	. . . . . . . . . 10 ⊢ ((1 ∈ (1...(⌊‘𝐴)) ∧ ¬ 1 ∈ (2...(⌊‘𝐴))) → (1...(⌊‘𝐴)) ≠ (2...(⌊‘𝐴)))
28	19, 26, 27	sylancl 597	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (1...(⌊‘𝐴)) ≠ (2...(⌊‘𝐴)))
29	28	necomd 3013	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ≠ (1...(⌊‘𝐴)))
30		df-pss 3925	. . . . . . . 8 ⊢ ((2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴)) ↔ ((2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)) ∧ (2...(⌊‘𝐴)) ≠ (1...(⌊‘𝐴))))
31	14, 29, 30	sylanbrc 594	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴)))
32		sspsstr 4063	. . . . . . 7 ⊢ ((((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴)) ∧ (2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴)))
33	11, 31, 32	sylancr 598	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴)))
34		php3 9189	. . . . . 6 ⊢ (((1...(⌊‘𝐴)) ∈ Fin ∧ ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
35	10, 33, 34	sylancr 598	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
36		fzfi 14004	. . . . . . 7 ⊢ (2...(⌊‘𝐴)) ∈ Fin
37		ssfi 9153	. . . . . . 7 ⊢ (((2...(⌊‘𝐴)) ∈ Fin ∧ ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin)
38	36, 11, 37	mp2an 704	. . . . . 6 ⊢ ((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin
39		hashsdom 14413	. . . . . 6 ⊢ ((((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin ∧ (1...(⌊‘𝐴)) ∈ Fin) → ((♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))) ↔ ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴))))
40	38, 10, 39	mp2an 704	. . . . 5 ⊢ ((♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))) ↔ ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
41	35, 40	sylibr 237	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))))
42	1	flcld 13827	. . . . . . 7 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℤ)
43		ppival2 27292	. . . . . . 7 ⊢ ((⌊‘𝐴) ∈ ℤ → (π‘(⌊‘𝐴)) = (♯‘((2...(⌊‘𝐴)) ∩ ℙ)))
44	42, 43	syl 18	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (π‘(⌊‘𝐴)) = (♯‘((2...(⌊‘𝐴)) ∩ ℙ)))
45		ppifl 27324	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘𝐴)) = (π‘𝐴))
46	1, 45	syl 18	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (π‘(⌊‘𝐴)) = (π‘𝐴))
47	44, 46	eqtr3d 2800	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) = (π‘𝐴))
48	47	adantr 485	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) = (π‘𝐴))
49		rpge0 13025	. . . . . . 7 ⊢ (𝐴 ∈ ℝ⁺ → 0 ≤ 𝐴)
50		flge0nn0 13849	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (⌊‘𝐴) ∈ ℕ₀)
51	1, 49, 50	syl2anc 595	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℕ₀)
52		hashfz1 14378	. . . . . 6 ⊢ ((⌊‘𝐴) ∈ ℕ₀ → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
53	51, 52	syl 18	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
54	53	adantr 485	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
55	41, 48, 54	3brtr3d 5142	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) < (⌊‘𝐴))
56		flle 13828	. . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ≤ 𝐴)
57	9, 56	syl 18	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ≤ 𝐴)
58	5, 8, 9, 55, 57	ltletrd 11365	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) < 𝐴)
59	46	adantr 485	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = (π‘𝐴))
60		simpr 489	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (⌊‘𝐴) = 0)
61	60	fveq2d 6885	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = (π‘0))
62		2pos 12340	. . . . . 6 ⊢ 0 < 2
63		0re 11205	. . . . . . 7 ⊢ 0 ∈ ℝ
64		ppieq0 27340	. . . . . . 7 ⊢ (0 ∈ ℝ → ((π‘0) = 0 ↔ 0 < 2))
65	63, 64	ax-mp 5	. . . . . 6 ⊢ ((π‘0) = 0 ↔ 0 < 2)
66	62, 65	mpbir 234	. . . . 5 ⊢ (π‘0) = 0
67	61, 66	eqtrdi 2814	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = 0)
68	59, 67	eqtr3d 2800	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘𝐴) = 0)
69		rpgt0 13024	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → 0 < 𝐴)
70	69	adantr 485	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → 0 < 𝐴)
71	68, 70	eqbrtrd 5133	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘𝐴) < 𝐴)
72		elnn0 12501	. . 3 ⊢ ((⌊‘𝐴) ∈ ℕ₀ ↔ ((⌊‘𝐴) ∈ ℕ ∨ (⌊‘𝐴) = 0))
73	51, 72	sylib 221	. 2 ⊢ (𝐴 ∈ ℝ⁺ → ((⌊‘𝐴) ∈ ℕ ∨ (⌊‘𝐴) = 0))
74	58, 71, 73	mpjaodan 973	1 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) < 𝐴)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 400 ∨ wo 860 = wceq 1570 ∈ wcel 2143 ≠ wne 2958 ∩ cin 3904 ⊆ wss 3905 ⊊ wpss 3906 class class class wbr 5109 ‘cfv 6536 (class class class)co 7410 ≺ csdm 8938 Fincfn 8939 ℝcr 11094 0cc0 11095 1c1 11096 < clt 11238 ≤ cle 11239 ℕcn 12228 2c2 12290 ℕ₀cn0 12499 ℤcz 12586 ℤ_≥cuz 12857 ℝ⁺crp 13011 ...cfz 13530 ⌊cfl 13819 ♯chash 14362 ℙcprime 16724 πcppi 27258

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 ax-pre-sup 11173

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-int 4913 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-oadd 8453 df-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-sup 9398 df-inf 9399 df-dju 9883 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-3 12299 df-n0 12500 df-xnn0 12573 df-z 12587 df-uz 12858 df-rp 13012 df-icc 13374 df-fz 13531 df-fl 13821 df-seq 14034 df-exp 14094 df-hash 14363 df-cj 15146 df-re 15147 df-im 15148 df-sqrt 15282 df-abs 15283 df-dvds 16306 df-prm 16725 df-ppi 27264

This theorem is referenced by: chtppilimlem1 27637

W3C validator