fsumvma2 - Metamath Proof Explorer

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

Theorem fsumvma2 26724

Description: Apply fsumvma 26723 for the common case of all numbers less than a real number 𝐴. (Contributed by Mario Carneiro, 30-Apr-2016.)

**Hypotheses**
Ref	Expression
fsumvma2.1	⊢ (𝑥 = (𝑝↑𝑘) → 𝐵 = 𝐶)
fsumvma2.2	⊢ (𝜑 → 𝐴 ∈ ℝ)
fsumvma2.3	⊢ ((𝜑 ∧ 𝑥 ∈ (1...(⌊‘𝐴))) → 𝐵 ∈ ℂ)
fsumvma2.4	⊢ ((𝜑 ∧ (𝑥 ∈ (1...(⌊‘𝐴)) ∧ (Λ‘𝑥) = 0)) → 𝐵 = 0)

**Assertion**
Ref	Expression
fsumvma2	⊢ (𝜑 → Σ𝑥 ∈ (1...(⌊‘𝐴))𝐵 = Σ𝑝 ∈ ((0[,]𝐴) ∩ ℙ)Σ𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))𝐶)

Distinct variable groups: 𝑘,𝑝,𝑥,𝐴 𝑥,𝐶 𝜑,𝑘,𝑝,𝑥 𝐵,𝑘,𝑝 Allowed substitution hints: 𝐵(𝑥) 𝐶(𝑘,𝑝)

**Proof of Theorem fsumvma2**
Step	Hyp	Ref	Expression
1		fsumvma2.1	. 2 ⊢ (𝑥 = (𝑝↑𝑘) → 𝐵 = 𝐶)
2		fzfid 13940	. 2 ⊢ (𝜑 → (1...(⌊‘𝐴)) ∈ Fin)
3		fz1ssnn 13534	. . 3 ⊢ (1...(⌊‘𝐴)) ⊆ ℕ
4	3	a1i 11	. 2 ⊢ (𝜑 → (1...(⌊‘𝐴)) ⊆ ℕ)
5		fsumvma2.2	. . 3 ⊢ (𝜑 → 𝐴 ∈ ℝ)
6		ppifi 26617	. . 3 ⊢ (𝐴 ∈ ℝ → ((0[,]𝐴) ∩ ℙ) ∈ Fin)
7	5, 6	syl 17	. 2 ⊢ (𝜑 → ((0[,]𝐴) ∩ ℙ) ∈ Fin)
8		elinel2 4196	. . . . 5 ⊢ (𝑝 ∈ ((0[,]𝐴) ∩ ℙ) → 𝑝 ∈ ℙ)
9		elfznn 13532	. . . . 5 ⊢ (𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝)))) → 𝑘 ∈ ℕ)
10	8, 9	anim12i 613	. . . 4 ⊢ ((𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))) → (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ))
11	10	pm4.71ri 561	. . 3 ⊢ ((𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))) ↔ ((𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ) ∧ (𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝)))))))
12	5	adantr 481	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝐴 ∈ ℝ)
13		prmnn 16613	. . . . . . . . 9 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ ℕ)
14	13	ad2antrl 726	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝑝 ∈ ℕ)
15		nnnn0 12481	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → 𝑘 ∈ ℕ₀)
16	15	ad2antll 727	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝑘 ∈ ℕ₀)
17	14, 16	nnexpcld 14210	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (𝑝↑𝑘) ∈ ℕ)
18	17	nnzd 12587	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (𝑝↑𝑘) ∈ ℤ)
19		flge 13772	. . . . . 6 ⊢ ((𝐴 ∈ ℝ ∧ (𝑝↑𝑘) ∈ ℤ) → ((𝑝↑𝑘) ≤ 𝐴 ↔ (𝑝↑𝑘) ≤ (⌊‘𝐴)))
20	12, 18, 19	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝↑𝑘) ≤ 𝐴 ↔ (𝑝↑𝑘) ≤ (⌊‘𝐴)))
21		simplrl 775	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑝 ∈ ℙ)
22	21, 13	syl 17	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑝 ∈ ℕ)
23	22	nnrpd 13016	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑝 ∈ ℝ⁺)
24		simplrr 776	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑘 ∈ ℕ)
25	24	nnzd 12587	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑘 ∈ ℤ)
26		relogexp 26111	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ ℝ⁺ ∧ 𝑘 ∈ ℤ) → (log‘(𝑝↑𝑘)) = (𝑘 · (log‘𝑝)))
27	23, 25, 26	syl2anc 584	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → (log‘(𝑝↑𝑘)) = (𝑘 · (log‘𝑝)))
28	27	breq1d 5158	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → ((log‘(𝑝↑𝑘)) ≤ (log‘𝐴) ↔ (𝑘 · (log‘𝑝)) ≤ (log‘𝐴)))
29	24	nnred 12229	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑘 ∈ ℝ)
30	12	adantr 481	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝐴 ∈ ℝ)
31		0red 11219	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 0 ∈ ℝ)
32	14	nnred 12229	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝑝 ∈ ℝ)
33	32	adantr 481	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑝 ∈ ℝ)
34	22	nngt0d 12263	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 0 < 𝑝)
35		0red 11219	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 0 ∈ ℝ)
36	14	nnnn0d 12534	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝑝 ∈ ℕ₀)
37	36	nn0ge0d 12537	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 0 ≤ 𝑝)
38		elicc2 13391	. . . . . . . . . . . . . . . . 17 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑝 ∈ (0[,]𝐴) ↔ (𝑝 ∈ ℝ ∧ 0 ≤ 𝑝 ∧ 𝑝 ≤ 𝐴)))
39		df-3an 1089	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑝 ∈ ℝ ∧ 0 ≤ 𝑝 ∧ 𝑝 ≤ 𝐴) ↔ ((𝑝 ∈ ℝ ∧ 0 ≤ 𝑝) ∧ 𝑝 ≤ 𝐴))
40	38, 39	bitrdi 286	. . . . . . . . . . . . . . . 16 ⊢ ((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) → (𝑝 ∈ (0[,]𝐴) ↔ ((𝑝 ∈ ℝ ∧ 0 ≤ 𝑝) ∧ 𝑝 ≤ 𝐴)))
41	40	baibd 540	. . . . . . . . . . . . . . 15 ⊢ (((0 ∈ ℝ ∧ 𝐴 ∈ ℝ) ∧ (𝑝 ∈ ℝ ∧ 0 ≤ 𝑝)) → (𝑝 ∈ (0[,]𝐴) ↔ 𝑝 ≤ 𝐴))
42	35, 12, 32, 37, 41	syl22anc 837	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (𝑝 ∈ (0[,]𝐴) ↔ 𝑝 ≤ 𝐴))
43	42	biimpa 477	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑝 ≤ 𝐴)
44	31, 33, 30, 34, 43	ltletrd 11376	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 0 < 𝐴)
45	30, 44	elrpd 13015	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝐴 ∈ ℝ⁺)
46	45	relogcld 26138	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → (log‘𝐴) ∈ ℝ)
47		prmuz2 16635	. . . . . . . . . . 11 ⊢ (𝑝 ∈ ℙ → 𝑝 ∈ (ℤ_≥‘2))
48		eluzelre 12835	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ (ℤ_≥‘2) → 𝑝 ∈ ℝ)
49		eluz2gt1 12906	. . . . . . . . . . . 12 ⊢ (𝑝 ∈ (ℤ_≥‘2) → 1 < 𝑝)
50	48, 49	rplogcld 26144	. . . . . . . . . . 11 ⊢ (𝑝 ∈ (ℤ_≥‘2) → (log‘𝑝) ∈ ℝ⁺)
51	21, 47, 50	3syl 18	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → (log‘𝑝) ∈ ℝ⁺)
52	29, 46, 51	lemuldivd 13067	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → ((𝑘 · (log‘𝑝)) ≤ (log‘𝐴) ↔ 𝑘 ≤ ((log‘𝐴) / (log‘𝑝))))
53	46, 51	rerpdivcld 13049	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → ((log‘𝐴) / (log‘𝑝)) ∈ ℝ)
54		flge 13772	. . . . . . . . . 10 ⊢ ((((log‘𝐴) / (log‘𝑝)) ∈ ℝ ∧ 𝑘 ∈ ℤ) → (𝑘 ≤ ((log‘𝐴) / (log‘𝑝)) ↔ 𝑘 ≤ (⌊‘((log‘𝐴) / (log‘𝑝)))))
55	53, 25, 54	syl2anc 584	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → (𝑘 ≤ ((log‘𝐴) / (log‘𝑝)) ↔ 𝑘 ≤ (⌊‘((log‘𝐴) / (log‘𝑝)))))
56	28, 52, 55	3bitrd 304	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → ((log‘(𝑝↑𝑘)) ≤ (log‘𝐴) ↔ 𝑘 ≤ (⌊‘((log‘𝐴) / (log‘𝑝)))))
57	17	adantr 481	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → (𝑝↑𝑘) ∈ ℕ)
58	57	nnrpd 13016	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → (𝑝↑𝑘) ∈ ℝ⁺)
59	58, 45	logled 26142	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → ((𝑝↑𝑘) ≤ 𝐴 ↔ (log‘(𝑝↑𝑘)) ≤ (log‘𝐴)))
60		simprr 771	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝑘 ∈ ℕ)
61		nnuz 12867	. . . . . . . . . . 11 ⊢ ℕ = (ℤ_≥‘1)
62	60, 61	eleqtrdi 2843	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝑘 ∈ (ℤ_≥‘1))
63	62	adantr 481	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → 𝑘 ∈ (ℤ_≥‘1))
64	53	flcld 13765	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → (⌊‘((log‘𝐴) / (log‘𝑝))) ∈ ℤ)
65		elfz5 13495	. . . . . . . . 9 ⊢ ((𝑘 ∈ (ℤ_≥‘1) ∧ (⌊‘((log‘𝐴) / (log‘𝑝))) ∈ ℤ) → (𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝)))) ↔ 𝑘 ≤ (⌊‘((log‘𝐴) / (log‘𝑝)))))
66	63, 64, 65	syl2anc 584	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → (𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝)))) ↔ 𝑘 ≤ (⌊‘((log‘𝐴) / (log‘𝑝)))))
67	56, 59, 66	3bitr4d 310	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) ∧ 𝑝 ∈ (0[,]𝐴)) → ((𝑝↑𝑘) ≤ 𝐴 ↔ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))))
68	67	pm5.32da 579	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝 ∈ (0[,]𝐴) ∧ (𝑝↑𝑘) ≤ 𝐴) ↔ (𝑝 ∈ (0[,]𝐴) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝)))))))
69	14	nncnd 12230	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝑝 ∈ ℂ)
70	69	exp1d 14108	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (𝑝↑1) = 𝑝)
71	14	nnge1d 12262	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 1 ≤ 𝑝)
72	32, 71, 62	leexp2ad 14219	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (𝑝↑1) ≤ (𝑝↑𝑘))
73	70, 72	eqbrtrrd 5172	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → 𝑝 ≤ (𝑝↑𝑘))
74	17	nnred 12229	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (𝑝↑𝑘) ∈ ℝ)
75		letr 11310	. . . . . . . . . 10 ⊢ ((𝑝 ∈ ℝ ∧ (𝑝↑𝑘) ∈ ℝ ∧ 𝐴 ∈ ℝ) → ((𝑝 ≤ (𝑝↑𝑘) ∧ (𝑝↑𝑘) ≤ 𝐴) → 𝑝 ≤ 𝐴))
76	32, 74, 12, 75	syl3anc 1371	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝 ≤ (𝑝↑𝑘) ∧ (𝑝↑𝑘) ≤ 𝐴) → 𝑝 ≤ 𝐴))
77	73, 76	mpand 693	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝↑𝑘) ≤ 𝐴 → 𝑝 ≤ 𝐴))
78	77, 42	sylibrd 258	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝↑𝑘) ≤ 𝐴 → 𝑝 ∈ (0[,]𝐴)))
79	78	pm4.71rd 563	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝↑𝑘) ≤ 𝐴 ↔ (𝑝 ∈ (0[,]𝐴) ∧ (𝑝↑𝑘) ≤ 𝐴)))
80		elin 3964	. . . . . . . . 9 ⊢ (𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ↔ (𝑝 ∈ (0[,]𝐴) ∧ 𝑝 ∈ ℙ))
81	80	rbaib 539	. . . . . . . 8 ⊢ (𝑝 ∈ ℙ → (𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ↔ 𝑝 ∈ (0[,]𝐴)))
82	81	ad2antrl 726	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ↔ 𝑝 ∈ (0[,]𝐴)))
83	82	anbi1d 630	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))) ↔ (𝑝 ∈ (0[,]𝐴) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝)))))))
84	68, 79, 83	3bitr4rd 311	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))) ↔ (𝑝↑𝑘) ≤ 𝐴))
85	17, 61	eleqtrdi 2843	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (𝑝↑𝑘) ∈ (ℤ_≥‘1))
86	12	flcld 13765	. . . . . 6 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → (⌊‘𝐴) ∈ ℤ)
87		elfz5 13495	. . . . . 6 ⊢ (((𝑝↑𝑘) ∈ (ℤ_≥‘1) ∧ (⌊‘𝐴) ∈ ℤ) → ((𝑝↑𝑘) ∈ (1...(⌊‘𝐴)) ↔ (𝑝↑𝑘) ≤ (⌊‘𝐴)))
88	85, 86, 87	syl2anc 584	. . . . 5 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝↑𝑘) ∈ (1...(⌊‘𝐴)) ↔ (𝑝↑𝑘) ≤ (⌊‘𝐴)))
89	20, 84, 88	3bitr4d 310	. . . 4 ⊢ ((𝜑 ∧ (𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ)) → ((𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))) ↔ (𝑝↑𝑘) ∈ (1...(⌊‘𝐴))))
90	89	pm5.32da 579	. . 3 ⊢ (𝜑 → (((𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ) ∧ (𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝)))))) ↔ ((𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ) ∧ (𝑝↑𝑘) ∈ (1...(⌊‘𝐴)))))
91	11, 90	bitrid 282	. 2 ⊢ (𝜑 → ((𝑝 ∈ ((0[,]𝐴) ∩ ℙ) ∧ 𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))) ↔ ((𝑝 ∈ ℙ ∧ 𝑘 ∈ ℕ) ∧ (𝑝↑𝑘) ∈ (1...(⌊‘𝐴)))))
92		fsumvma2.3	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ (1...(⌊‘𝐴))) → 𝐵 ∈ ℂ)
93		fsumvma2.4	. 2 ⊢ ((𝜑 ∧ (𝑥 ∈ (1...(⌊‘𝐴)) ∧ (Λ‘𝑥) = 0)) → 𝐵 = 0)
94	1, 2, 4, 7, 91, 92, 93	fsumvma 26723	1 ⊢ (𝜑 → Σ𝑥 ∈ (1...(⌊‘𝐴))𝐵 = Σ𝑝 ∈ ((0[,]𝐴) ∩ ℙ)Σ𝑘 ∈ (1...(⌊‘((log‘𝐴) / (log‘𝑝))))𝐶)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∩ cin 3947 ⊆ wss 3948 class class class wbr 5148 ‘cfv 6543 (class class class)co 7411 Fincfn 8941 ℂcc 11110 ℝcr 11111 0cc0 11112 1c1 11113 · cmul 11117 ≤ cle 11251 / cdiv 11873 ℕcn 12214 2c2 12269 ℕ₀cn0 12474 ℤcz 12560 ℤ_≥cuz 12824 ℝ⁺crp 12976 [,]cicc 13329 ...cfz 13486 ⌊cfl 13757 ↑cexp 14029 Σcsu 15634 ℙcprime 16610 logclog 26070 Λcvma 26603

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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-inf2 9638 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190 ax-addf 11191 ax-mulf 11192

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-se 5632 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-isom 6552 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7672 df-om 7858 df-1st 7977 df-2nd 7978 df-supp 8149 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-2o 8469 df-oadd 8472 df-er 8705 df-map 8824 df-pm 8825 df-ixp 8894 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-fsupp 9364 df-fi 9408 df-sup 9439 df-inf 9440 df-oi 9507 df-dju 9898 df-card 9936 df-pnf 11252 df-mnf 11253 df-xr 11254 df-ltxr 11255 df-le 11256 df-sub 11448 df-neg 11449 df-div 11874 df-nn 12215 df-2 12277 df-3 12278 df-4 12279 df-5 12280 df-6 12281 df-7 12282 df-8 12283 df-9 12284 df-n0 12475 df-z 12561 df-dec 12680 df-uz 12825 df-q 12935 df-rp 12977 df-xneg 13094 df-xadd 13095 df-xmul 13096 df-ioo 13330 df-ioc 13331 df-ico 13332 df-icc 13333 df-fz 13487 df-fzo 13630 df-fl 13759 df-mod 13837 df-seq 13969 df-exp 14030 df-fac 14236 df-bc 14265 df-hash 14293 df-shft 15016 df-cj 15048 df-re 15049 df-im 15050 df-sqrt 15184 df-abs 15185 df-limsup 15417 df-clim 15434 df-rlim 15435 df-sum 15635 df-ef 16013 df-sin 16015 df-cos 16016 df-pi 16018 df-dvds 16200 df-gcd 16438 df-prm 16611 df-pc 16772 df-struct 17082 df-sets 17099 df-slot 17117 df-ndx 17129 df-base 17147 df-ress 17176 df-plusg 17212 df-mulr 17213 df-starv 17214 df-sca 17215 df-vsca 17216 df-ip 17217 df-tset 17218 df-ple 17219 df-ds 17221 df-unif 17222 df-hom 17223 df-cco 17224 df-rest 17370 df-topn 17371 df-0g 17389 df-gsum 17390 df-topgen 17391 df-pt 17392 df-prds 17395 df-xrs 17450 df-qtop 17455 df-imas 17456 df-xps 17458 df-mre 17532 df-mrc 17533 df-acs 17535 df-mgm 18563 df-sgrp 18612 df-mnd 18628 df-submnd 18674 df-mulg 18953 df-cntz 19183 df-cmn 19652 df-psmet 20942 df-xmet 20943 df-met 20944 df-bl 20945 df-mopn 20946 df-fbas 20947 df-fg 20948 df-cnfld 20951 df-top 22403 df-topon 22420 df-topsp 22442 df-bases 22456 df-cld 22530 df-ntr 22531 df-cls 22532 df-nei 22609 df-lp 22647 df-perf 22648 df-cn 22738 df-cnp 22739 df-haus 22826 df-tx 23073 df-hmeo 23266 df-fil 23357 df-fm 23449 df-flim 23450 df-flf 23451 df-xms 23833 df-ms 23834 df-tms 23835 df-cncf 24401 df-limc 25390 df-dv 25391 df-log 26072 df-vma 26609

This theorem is referenced by: chpval2 26728 rplogsumlem2 26995 rpvmasumlem 26997

W3C validator