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 25762

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 12385	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → 𝐴 ∈ ℝ)
2		ppicl 25716	. . . . . 6 ⊢ (𝐴 ∈ ℝ → (π‘𝐴) ∈ ℕ₀)
3	1, 2	syl 17	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) ∈ ℕ₀)
4	3	nn0red 11944	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) ∈ ℝ)
5	4	adantr 484	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) ∈ ℝ)
6		reflcl 13161	. . . . 5 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℝ)
7	1, 6	syl 17	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℝ)
8	7	adantr 484	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ ℝ)
9	1	adantr 484	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → 𝐴 ∈ ℝ)
10		fzfi 13335	. . . . . 6 ⊢ (1...(⌊‘𝐴)) ∈ Fin
11		inss1 4155	. . . . . . 7 ⊢ ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴))
12		2eluzge1 12282	. . . . . . . . 9 ⊢ 2 ∈ (ℤ_≥‘1)
13		fzss1 12941	. . . . . . . . 9 ⊢ (2 ∈ (ℤ_≥‘1) → (2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)))
14	12, 13	mp1i 13	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)))
15		simpr 488	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ ℕ)
16		nnuz 12269	. . . . . . . . . . . 12 ⊢ ℕ = (ℤ_≥‘1)
17	15, 16	eleqtrdi 2900	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ (ℤ_≥‘1))
18		eluzfz1 12909	. . . . . . . . . . 11 ⊢ ((⌊‘𝐴) ∈ (ℤ_≥‘1) → 1 ∈ (1...(⌊‘𝐴)))
19	17, 18	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → 1 ∈ (1...(⌊‘𝐴)))
20		1lt2 11796	. . . . . . . . . . . 12 ⊢ 1 < 2
21		1re 10630	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℝ
22		2re 11699	. . . . . . . . . . . . 13 ⊢ 2 ∈ ℝ
23	21, 22	ltnlei 10750	. . . . . . . . . . . 12 ⊢ (1 < 2 ↔ ¬ 2 ≤ 1)
24	20, 23	mpbi 233	. . . . . . . . . . 11 ⊢ ¬ 2 ≤ 1
25		elfzle1 12905	. . . . . . . . . . 11 ⊢ (1 ∈ (2...(⌊‘𝐴)) → 2 ≤ 1)
26	24, 25	mto 200	. . . . . . . . . 10 ⊢ ¬ 1 ∈ (2...(⌊‘𝐴))
27		nelne1 3083	. . . . . . . . . 10 ⊢ ((1 ∈ (1...(⌊‘𝐴)) ∧ ¬ 1 ∈ (2...(⌊‘𝐴))) → (1...(⌊‘𝐴)) ≠ (2...(⌊‘𝐴)))
28	19, 26, 27	sylancl 589	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (1...(⌊‘𝐴)) ≠ (2...(⌊‘𝐴)))
29	28	necomd 3042	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ≠ (1...(⌊‘𝐴)))
30		df-pss 3900	. . . . . . . 8 ⊢ ((2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴)) ↔ ((2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)) ∧ (2...(⌊‘𝐴)) ≠ (1...(⌊‘𝐴))))
31	14, 29, 30	sylanbrc 586	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴)))
32		sspsstr 4033	. . . . . . 7 ⊢ ((((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴)) ∧ (2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴)))
33	11, 31, 32	sylancr 590	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴)))
34		php3 8687	. . . . . 6 ⊢ (((1...(⌊‘𝐴)) ∈ Fin ∧ ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
35	10, 33, 34	sylancr 590	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
36		fzfi 13335	. . . . . . 7 ⊢ (2...(⌊‘𝐴)) ∈ Fin
37		ssfi 8722	. . . . . . 7 ⊢ (((2...(⌊‘𝐴)) ∈ Fin ∧ ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin)
38	36, 11, 37	mp2an 691	. . . . . 6 ⊢ ((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin
39		hashsdom 13738	. . . . . 6 ⊢ ((((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin ∧ (1...(⌊‘𝐴)) ∈ Fin) → ((♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))) ↔ ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴))))
40	38, 10, 39	mp2an 691	. . . . 5 ⊢ ((♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))) ↔ ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
41	35, 40	sylibr 237	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))))
42	1	flcld 13163	. . . . . . 7 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℤ)
43		ppival2 25713	. . . . . . 7 ⊢ ((⌊‘𝐴) ∈ ℤ → (π‘(⌊‘𝐴)) = (♯‘((2...(⌊‘𝐴)) ∩ ℙ)))
44	42, 43	syl 17	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (π‘(⌊‘𝐴)) = (♯‘((2...(⌊‘𝐴)) ∩ ℙ)))
45		ppifl 25745	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘𝐴)) = (π‘𝐴))
46	1, 45	syl 17	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (π‘(⌊‘𝐴)) = (π‘𝐴))
47	44, 46	eqtr3d 2835	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) = (π‘𝐴))
48	47	adantr 484	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) = (π‘𝐴))
49		rpge0 12390	. . . . . . 7 ⊢ (𝐴 ∈ ℝ⁺ → 0 ≤ 𝐴)
50		flge0nn0 13185	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (⌊‘𝐴) ∈ ℕ₀)
51	1, 49, 50	syl2anc 587	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℕ₀)
52		hashfz1 13702	. . . . . 6 ⊢ ((⌊‘𝐴) ∈ ℕ₀ → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
53	51, 52	syl 17	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
54	53	adantr 484	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
55	41, 48, 54	3brtr3d 5061	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) < (⌊‘𝐴))
56		flle 13164	. . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ≤ 𝐴)
57	9, 56	syl 17	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ≤ 𝐴)
58	5, 8, 9, 55, 57	ltletrd 10789	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) < 𝐴)
59	46	adantr 484	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = (π‘𝐴))
60		simpr 488	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (⌊‘𝐴) = 0)
61	60	fveq2d 6649	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = (π‘0))
62		2pos 11728	. . . . . 6 ⊢ 0 < 2
63		0re 10632	. . . . . . 7 ⊢ 0 ∈ ℝ
64		ppieq0 25761	. . . . . . 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 2849	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = 0)
68	59, 67	eqtr3d 2835	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘𝐴) = 0)
69		rpgt0 12389	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → 0 < 𝐴)
70	69	adantr 484	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → 0 < 𝐴)
71	68, 70	eqbrtrd 5052	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘𝐴) < 𝐴)
72		elnn0 11887	. . 3 ⊢ ((⌊‘𝐴) ∈ ℕ₀ ↔ ((⌊‘𝐴) ∈ ℕ ∨ (⌊‘𝐴) = 0))
73	51, 72	sylib 221	. 2 ⊢ (𝐴 ∈ ℝ⁺ → ((⌊‘𝐴) ∈ ℕ ∨ (⌊‘𝐴) = 0))
74	58, 71, 73	mpjaodan 956	1 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) < 𝐴)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 399 ∨ wo 844 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∩ cin 3880 ⊆ wss 3881 ⊊ wpss 3882 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 ≺ csdm 8491 Fincfn 8492 ℝcr 10525 0cc0 10526 1c1 10527 < clt 10664 ≤ cle 10665 ℕcn 11625 2c2 11680 ℕ₀cn0 11885 ℤcz 11969 ℤ_≥cuz 12231 ℝ⁺crp 12377 ...cfz 12885 ⌊cfl 13155 ♯chash 13686 ℙcprime 16005 πcppi 25679

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 ax-pre-sup 10604

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-int 4839 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-1o 8085 df-2o 8086 df-oadd 8089 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-fin 8496 df-sup 8890 df-inf 8891 df-dju 9314 df-card 9352 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-nn 11626 df-2 11688 df-3 11689 df-n0 11886 df-xnn0 11956 df-z 11970 df-uz 12232 df-rp 12378 df-icc 12733 df-fz 12886 df-fl 13157 df-seq 13365 df-exp 13426 df-hash 13687 df-cj 14450 df-re 14451 df-im 14452 df-sqrt 14586 df-abs 14587 df-dvds 15600 df-prm 16006 df-ppi 25685

This theorem is referenced by: chtppilimlem1 26057

W3C validator