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 27229

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 12996	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → 𝐴 ∈ ℝ)
2		ppicl 27183	. . . . . 6 ⊢ (𝐴 ∈ ℝ → (π‘𝐴) ∈ ℕ₀)
3	1, 2	syl 17	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) ∈ ℕ₀)
4	3	nn0red 12537	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) ∈ ℝ)
5	4	adantr 484	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) ∈ ℝ)
6		reflcl 13800	. . . . 5 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ∈ ℝ)
7	1, 6	syl 17	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℝ)
8	7	adantr 484	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ ℝ)
9	1	adantr 484	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → 𝐴 ∈ ℝ)
10		fzfi 13979	. . . . . 6 ⊢ (1...(⌊‘𝐴)) ∈ Fin
11		inss1 4186	. . . . . . 7 ⊢ ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴))
12		2eluzge1 12877	. . . . . . . . 9 ⊢ 2 ∈ (ℤ_≥‘1)
13		fzss1 13562	. . . . . . . . 9 ⊢ (2 ∈ (ℤ_≥‘1) → (2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)))
14	12, 13	mp1i 13	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)))
15		simpr 488	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ ℕ)
16		nnuz 12872	. . . . . . . . . . . 12 ⊢ ℕ = (ℤ_≥‘1)
17	15, 16	eleqtrdi 2871	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ∈ (ℤ_≥‘1))
18		eluzfz1 13530	. . . . . . . . . . 11 ⊢ ((⌊‘𝐴) ∈ (ℤ_≥‘1) → 1 ∈ (1...(⌊‘𝐴)))
19	17, 18	syl 17	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → 1 ∈ (1...(⌊‘𝐴)))
20		1lt2 12384	. . . . . . . . . . . 12 ⊢ 1 < 2
21		1re 11175	. . . . . . . . . . . . 13 ⊢ 1 ∈ ℝ
22		2re 12286	. . . . . . . . . . . . 13 ⊢ 2 ∈ ℝ
23	21, 22	ltnlei 11298	. . . . . . . . . . . 12 ⊢ (1 < 2 ↔ ¬ 2 ≤ 1)
24	20, 23	mpbi 232	. . . . . . . . . . 11 ⊢ ¬ 2 ≤ 1
25		elfzle1 13526	. . . . . . . . . . 11 ⊢ (1 ∈ (2...(⌊‘𝐴)) → 2 ≤ 1)
26	24, 25	mto 199	. . . . . . . . . 10 ⊢ ¬ 1 ∈ (2...(⌊‘𝐴))
27		nelne1 3053	. . . . . . . . . 10 ⊢ ((1 ∈ (1...(⌊‘𝐴)) ∧ ¬ 1 ∈ (2...(⌊‘𝐴))) → (1...(⌊‘𝐴)) ≠ (2...(⌊‘𝐴)))
28	19, 26, 27	sylancl 595	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (1...(⌊‘𝐴)) ≠ (2...(⌊‘𝐴)))
29	28	necomd 3011	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ≠ (1...(⌊‘𝐴)))
30		df-pss 3922	. . . . . . . 8 ⊢ ((2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴)) ↔ ((2...(⌊‘𝐴)) ⊆ (1...(⌊‘𝐴)) ∧ (2...(⌊‘𝐴)) ≠ (1...(⌊‘𝐴))))
31	14, 29, 30	sylanbrc 592	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴)))
32		sspsstr 4060	. . . . . . 7 ⊢ ((((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴)) ∧ (2...(⌊‘𝐴)) ⊊ (1...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴)))
33	11, 31, 32	sylancr 596	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴)))
34		php3 9171	. . . . . 6 ⊢ (((1...(⌊‘𝐴)) ∈ Fin ∧ ((2...(⌊‘𝐴)) ∩ ℙ) ⊊ (1...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
35	10, 33, 34	sylancr 596	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
36		fzfi 13979	. . . . . . 7 ⊢ (2...(⌊‘𝐴)) ∈ Fin
37		ssfi 9135	. . . . . . 7 ⊢ (((2...(⌊‘𝐴)) ∈ Fin ∧ ((2...(⌊‘𝐴)) ∩ ℙ) ⊆ (2...(⌊‘𝐴))) → ((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin)
38	36, 11, 37	mp2an 702	. . . . . 6 ⊢ ((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin
39		hashsdom 14388	. . . . . 6 ⊢ ((((2...(⌊‘𝐴)) ∩ ℙ) ∈ Fin ∧ (1...(⌊‘𝐴)) ∈ Fin) → ((♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))) ↔ ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴))))
40	38, 10, 39	mp2an 702	. . . . 5 ⊢ ((♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))) ↔ ((2...(⌊‘𝐴)) ∩ ℙ) ≺ (1...(⌊‘𝐴)))
41	35, 40	sylibr 236	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) < (♯‘(1...(⌊‘𝐴))))
42	1	flcld 13802	. . . . . . 7 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℤ)
43		ppival2 27180	. . . . . . 7 ⊢ ((⌊‘𝐴) ∈ ℤ → (π‘(⌊‘𝐴)) = (♯‘((2...(⌊‘𝐴)) ∩ ℙ)))
44	42, 43	syl 17	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (π‘(⌊‘𝐴)) = (♯‘((2...(⌊‘𝐴)) ∩ ℙ)))
45		ppifl 27212	. . . . . . 7 ⊢ (𝐴 ∈ ℝ → (π‘(⌊‘𝐴)) = (π‘𝐴))
46	1, 45	syl 17	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (π‘(⌊‘𝐴)) = (π‘𝐴))
47	44, 46	eqtr3d 2798	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) = (π‘𝐴))
48	47	adantr 484	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘((2...(⌊‘𝐴)) ∩ ℙ)) = (π‘𝐴))
49		rpge0 13001	. . . . . . 7 ⊢ (𝐴 ∈ ℝ⁺ → 0 ≤ 𝐴)
50		flge0nn0 13824	. . . . . . 7 ⊢ ((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) → (⌊‘𝐴) ∈ ℕ₀)
51	1, 49, 50	syl2anc 593	. . . . . 6 ⊢ (𝐴 ∈ ℝ⁺ → (⌊‘𝐴) ∈ ℕ₀)
52		hashfz1 14353	. . . . . 6 ⊢ ((⌊‘𝐴) ∈ ℕ₀ → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
53	51, 52	syl 17	. . . . 5 ⊢ (𝐴 ∈ ℝ⁺ → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
54	53	adantr 484	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (♯‘(1...(⌊‘𝐴))) = (⌊‘𝐴))
55	41, 48, 54	3brtr3d 5128	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) < (⌊‘𝐴))
56		flle 13803	. . . 4 ⊢ (𝐴 ∈ ℝ → (⌊‘𝐴) ≤ 𝐴)
57	9, 56	syl 17	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (⌊‘𝐴) ≤ 𝐴)
58	5, 8, 9, 55, 57	ltletrd 11337	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) ∈ ℕ) → (π‘𝐴) < 𝐴)
59	46	adantr 484	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = (π‘𝐴))
60		simpr 488	. . . . . 6 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (⌊‘𝐴) = 0)
61	60	fveq2d 6866	. . . . 5 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = (π‘0))
62		2pos 12316	. . . . . 6 ⊢ 0 < 2
63		0re 11177	. . . . . . 7 ⊢ 0 ∈ ℝ
64		ppieq0 27228	. . . . . . 7 ⊢ (0 ∈ ℝ → ((π‘0) = 0 ↔ 0 < 2))
65	63, 64	ax-mp 5	. . . . . 6 ⊢ ((π‘0) = 0 ↔ 0 < 2)
66	62, 65	mpbir 233	. . . . 5 ⊢ (π‘0) = 0
67	61, 66	eqtrdi 2812	. . . 4 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘(⌊‘𝐴)) = 0)
68	59, 67	eqtr3d 2798	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘𝐴) = 0)
69		rpgt0 13000	. . . 4 ⊢ (𝐴 ∈ ℝ⁺ → 0 < 𝐴)
70	69	adantr 484	. . 3 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → 0 < 𝐴)
71	68, 70	eqbrtrd 5119	. 2 ⊢ ((𝐴 ∈ ℝ⁺ ∧ (⌊‘𝐴) = 0) → (π‘𝐴) < 𝐴)
72		elnn0 12477	. . 3 ⊢ ((⌊‘𝐴) ∈ ℕ₀ ↔ ((⌊‘𝐴) ∈ ℕ ∨ (⌊‘𝐴) = 0))
73	51, 72	sylib 220	. 2 ⊢ (𝐴 ∈ ℝ⁺ → ((⌊‘𝐴) ∈ ℕ ∨ (⌊‘𝐴) = 0))
74	58, 71, 73	mpjaodan 971	1 ⊢ (𝐴 ∈ ℝ⁺ → (π‘𝐴) < 𝐴)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 399 ∨ wo 858 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∩ cin 3901 ⊆ wss 3902 ⊊ wpss 3903 class class class wbr 5097 ‘cfv 6516 (class class class)co 7391 ≺ csdm 8920 Fincfn 8921 ℝcr 11066 0cc0 11067 1c1 11068 < clt 11210 ≤ cle 11211 ℕcn 12204 2c2 12266 ℕ₀cn0 12475 ℤcz 12562 ℤ_≥cuz 12833 ℝ⁺crp 12987 ...cfz 13506 ⌊cfl 13794 ♯chash 14337 ℙcprime 16696 πcppi 27146

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-2o 8432 df-oadd 8435 df-er 8672 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9382 df-inf 9383 df-dju 9853 df-card 9891 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-3 12275 df-n0 12476 df-xnn0 12549 df-z 12563 df-uz 12834 df-rp 12988 df-icc 13350 df-fz 13507 df-fl 13796 df-seq 14009 df-exp 14069 df-hash 14338 df-cj 15117 df-re 15118 df-im 15119 df-sqrt 15253 df-abs 15254 df-dvds 16278 df-prm 16697 df-ppi 27152

This theorem is referenced by: chtppilimlem1 27525

W3C validator