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 27303

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 13021	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → 𝐴 ∈ ℝ)
2		ppicl 27257	. . . . . 6 ⊢ (𝐴 ∈ ℝ → (π‘𝐴) ∈ ℕ₀)
3	1, 2	syl 18	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) ∈ ℕ₀)
4	3	nn0red 12562	. . . 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 4197	. . . . . . 7 ⊢ ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴))
12		2eluzge1 12902	. . . . . . . . 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 12897	. . . . . . . . . . . 12 ⊢ ℕ = (ℤ_≥‘1)
17	15, 16	eleqtrdi 2879	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ (ℤ_≥‘1))
18		eluzfz1 13555	. . . . . . . . . . 11 ⊢ ((⌊‘𝐴) ∈ (ℤ_≥‘1) → 1 ∈ (1...(⌊‘𝐴)))
19	17, 18	syl 18	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → 1 ∈ (1...(⌊‘𝐴)))
20		1lt2 12409	. . . . . . . . . . . 12 ⊢ 1 < 2
21		1re 11204	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℝ
22		2re 12311	. . . . . . . . . . . . 13 ⊢ 2 ∈ ℝ
23	21, 22	ltnlei 11327	. . . . . . . . . . . 12 ⊢ (1 < 2 ↔ ¬ 2 ≤ 1)
24	20, 23	mpbi 233	. . . . . . . . . . 11 ⊢ ¬ 2 ≤ 1
25		elfzle1 13551	. . . . . . . . . . 11 ⊢ (1 ∈ (2...(⌊‘𝐴)) → 2 ≤ 1)
26	24, 25	mto 200	. . . . . . . . . 10 ⊢ ¬ 1 ∈ (2...(⌊‘𝐴))
27		nelne1 3061	. . . . . . . . . 10 ⊢ ((1 ∈ (1...(⌊‘𝐴)) ∧ ¬ 1 ∈ (2...(⌊‘𝐴))) → (1...(⌊‘𝐴)) ≠ (2...(⌊‘𝐴)))
28	19, 26, 27	sylancl 597	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (1...(⌊‘𝐴)) ≠ (2...(⌊‘𝐴)))
29	28	necomd 3019	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ≠ (1...(⌊‘𝐴)))
30		df-pss 3933	. . . . . . . 8 ⊢ ((2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴)) ↔ ((2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)) ∧ (2...(⌊‘𝐴)) ≠ (1...(⌊‘𝐴))))
31	14, 29, 30	sylanbrc 594	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴)))
32		sspsstr 4071	. . . . . . 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 27254	. . . . . . 7 ⊢ ((⌊‘𝐴) ∈ ℤ → (π‘(⌊‘𝐴)) = (♯‘((2...(⌊‘𝐴)) ∩ ℙ)))
44	42, 43	syl 18	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (π‘(⌊‘𝐴)) = (♯‘((2...(⌊‘𝐴)) ∩ ℙ)))
45		ppifl 27286	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘𝐴)) = (π‘𝐴))
46	1, 45	syl 18	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (π‘(⌊‘𝐴)) = (π‘𝐴))
47	44, 46	eqtr3d 2806	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) = (π‘𝐴))
48	47	adantr 485	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) = (π‘𝐴))
49		rpge0 13026	. . . . . . 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 5143	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) < (⌊‘𝐴))
56		flle 13828	. . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ≤ 𝐴)
57	9, 56	syl 18	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ≤ 𝐴)
58	5, 8, 9, 55, 57	ltletrd 11366	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) < 𝐴)
59	46	adantr 485	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = (π‘𝐴))
60		simpr 489	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (⌊‘𝐴) = 0)
61	60	fveq2d 6883	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = (π‘0))
62		2pos 12341	. . . . . 6 ⊢ 0 < 2
63		0re 11206	. . . . . . 7 ⊢ 0 ∈ ℝ
64		ppieq0 27302	. . . . . . 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 2820	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = 0)
68	59, 67	eqtr3d 2806	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘𝐴) = 0)
69		rpgt0 13025	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → 0 < 𝐴)
70	69	adantr 485	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → 0 < 𝐴)
71	68, 70	eqbrtrd 5134	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘𝐴) < 𝐴)
72		elnn0 12502	. . 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 1567 ∈ wcel 2149 ≠ wne 2964 ∩ cin 3912 ⊆ wss 3913 ⊊ wpss 3914 class class class wbr 5110 ‘cfv 6534 (class class class)co 7408 ≺ csdm 8938 Fincfn 8939 ℝcr 11095 0cc0 11096 1c1 11097 < clt 11239 ≤ cle 11240 ℕcn 12229 2c2 12291 ℕ₀cn0 12500 ℤcz 12587 ℤ_≥cuz 12858 ℝ⁺crp 13012 ...cfz 13531 ⌊cfl 13819 ♯chash 14362 ℙcprime 16725 πcppi 27220

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5258 ax-nul 5268 ax-pow 5334 ax-pr 5402 ax-un 7730 ax-cnex 11152 ax-resscn 11153 ax-1cn 11154 ax-icn 11155 ax-addcl 11156 ax-addrcl 11157 ax-mulcl 11158 ax-mulrcl 11159 ax-mulcom 11160 ax-addass 11161 ax-mulass 11162 ax-distr 11163 ax-i2m1 11164 ax-1ne0 11165 ax-1rid 11166 ax-rnegex 11167 ax-rrecex 11168 ax-cnre 11169 ax-pre-lttri 11170 ax-pre-lttrn 11171 ax-pre-ltadd 11172 ax-pre-mulgt0 11173 ax-pre-sup 11174

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4874 df-int 4914 df-iun 4959 df-br 5111 df-opab 5175 df-mpt 5194 df-tr 5220 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6300 df-ord 6361 df-on 6362 df-lim 6363 df-suc 6364 df-iota 6490 df-fun 6536 df-fn 6537 df-f 6538 df-f1 6539 df-fo 6540 df-f1o 6541 df-fv 6542 df-riota 7365 df-ov 7411 df-oprab 7412 df-mpo 7413 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 11241 df-mnf 11242 df-xr 11243 df-ltxr 11244 df-le 11245 df-sub 11439 df-neg 11440 df-div 11868 df-nn 12230 df-2 12299 df-3 12300 df-n0 12501 df-xnn0 12574 df-z 12588 df-uz 12859 df-rp 13013 df-icc 13375 df-fz 13532 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 16307 df-prm 16726 df-ppi 27226

This theorem is referenced by: chtppilimlem1 27599

W3C validator