Theorem prmorcht 16294

Description: Relate the primorial (product of the primes up to 𝐴) to the Chebyshev function. (Contributed by Mario Carneiro, 22-Sep-2014.)

Hypothesis

Ref	Expression
prmorcht.1	⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, 𝑛, 1))

Assertion

Ref	Expression
prmorcht	⊢ (𝐴 ∈ ℕ → (exp‘(θ‘𝐴)) = (seq1( · , 𝐹)‘𝐴))

Proof of Theorem prmorcht

Dummy variables 𝑘 𝑝 𝑗 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		nnq 10050	. . . . . . 7 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℚ)
2		chtqval 16257	. . . . . . 7 ⊢ (𝐴 ∈ ℚ → (θ‘𝐴) = Σ𝑘 ∈ ((0[,]𝐴) ∩ ℙ)(log‘𝑘))
3	1, 2	syl 14	. . . . . 6 ⊢ (𝐴 ∈ ℕ → (θ‘𝐴) = Σ𝑘 ∈ ((0[,]𝐴) ∩ ℙ)(log‘𝑘))
4		2eluzge1 9993	. . . . . . . . . 10 ⊢ 2 ∈ (ℤ≥‘1)
5		ppiqsval2 16253	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℚ ∧ 2 ∈ (ℤ≥‘1)) → ((0[,]𝐴) ∩ ℙ) = ((1...(⌊‘𝐴)) ∩ ℙ))
6	1, 4, 5	sylancl 417	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → ((0[,]𝐴) ∩ ℙ) = ((1...(⌊‘𝐴)) ∩ ℙ))
7		nnz 9675	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ ℤ)
8		flid 10741	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ ℤ → (⌊‘𝐴) = 𝐴)
9	7, 8	syl 14	. . . . . . . . . . 11 ⊢ (𝐴 ∈ ℕ → (⌊‘𝐴) = 𝐴)
10	9	oveq2d 6104	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → (1...(⌊‘𝐴)) = (1...𝐴))
11	10	ineq1d 3431	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → ((1...(⌊‘𝐴)) ∩ ℙ) = ((1...𝐴) ∩ ℙ))
12	6, 11	eqtrd 2271	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ((0[,]𝐴) ∩ ℙ) = ((1...𝐴) ∩ ℙ))
13	12	sumeq1d 12158	. . . . . . 7 ⊢ (𝐴 ∈ ℕ → Σ𝑘 ∈ ((0[,]𝐴) ∩ ℙ)(log‘𝑘) = Σ𝑘 ∈ ((1...𝐴) ∩ ℙ)(log‘𝑘))
14		inss1 3451	. . . . . . . . 9 ⊢ ((1...𝐴) ∩ ℙ) ⊆ (1...𝐴)
15	14	a1i 9	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ((1...𝐴) ∩ ℙ) ⊆ (1...𝐴))
16		animorrl 838	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ 𝑗 ∈ (1...𝐴)) → (𝑗 ∈ (1...𝐴) ∨ ¬ 𝑗 ∈ (1...𝐴)))
17		df-dc 847	. . . . . . . . . . . 12 ⊢ (DECID 𝑗 ∈ (1...𝐴) ↔ (𝑗 ∈ (1...𝐴) ∨ ¬ 𝑗 ∈ (1...𝐴)))
18	16, 17	sylibr 134	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑗 ∈ (1...𝐴)) → DECID 𝑗 ∈ (1...𝐴))
19		elfzelz 10446	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (1...𝐴) → 𝑗 ∈ ℤ)
20	19	adantl 277	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ 𝑗 ∈ (1...𝐴)) → 𝑗 ∈ ℤ)
21		prmdcz 12935	. . . . . . . . . . . 12 ⊢ (𝑗 ∈ ℤ → DECID 𝑗 ∈ ℙ)
22	20, 21	syl 14	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑗 ∈ (1...𝐴)) → DECID 𝑗 ∈ ℙ)
23	18, 22	dcand 945	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑗 ∈ (1...𝐴)) → DECID (𝑗 ∈ (1...𝐴) ∧ 𝑗 ∈ ℙ))
24		elin 3412	. . . . . . . . . . 11 ⊢ (𝑗 ∈ ((1...𝐴) ∩ ℙ) ↔ (𝑗 ∈ (1...𝐴) ∧ 𝑗 ∈ ℙ))
25	24	dcbii 852	. . . . . . . . . 10 ⊢ (DECID 𝑗 ∈ ((1...𝐴) ∩ ℙ) ↔ DECID (𝑗 ∈ (1...𝐴) ∧ 𝑗 ∈ ℙ))
26	23, 25	sylibr 134	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑗 ∈ (1...𝐴)) → DECID 𝑗 ∈ ((1...𝐴) ∩ ℙ))
27	26	ralrimiva 2623	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ∀𝑗 ∈ (1...𝐴)DECID 𝑗 ∈ ((1...𝐴) ∩ ℙ))
28		elinel1 3415	. . . . . . . . . 10 ⊢ (𝑘 ∈ ((1...𝐴) ∩ ℙ) → 𝑘 ∈ (1...𝐴))
29		elfznn 10478	. . . . . . . . . . . . . 14 ⊢ (𝑘 ∈ (1...𝐴) → 𝑘 ∈ ℕ)
30	29	adantl 277	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (1...𝐴)) → 𝑘 ∈ ℕ)
31	30	nnrpd 10113	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (1...𝐴)) → 𝑘 ∈ ℝ+)
32	31	relogcld 16124	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (1...𝐴)) → (log‘𝑘) ∈ ℝ)
33	32	recnd 8361	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (1...𝐴)) → (log‘𝑘) ∈ ℂ)
34	28, 33	sylan2 286	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ((1...𝐴) ∩ ℙ)) → (log‘𝑘) ∈ ℂ)
35	34	ralrimiva 2623	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ∀𝑘 ∈ ((1...𝐴) ∩ ℙ)(log‘𝑘) ∈ ℂ)
36		1zzd 9683	. . . . . . . . . 10 ⊢ (𝐴 ∈ ℕ → 1 ∈ ℤ)
37	36, 7	fzfigd 10890	. . . . . . . . 9 ⊢ (𝐴 ∈ ℕ → (1...𝐴) ∈ Fin)
38	37	olcd 746	. . . . . . . 8 ⊢ (𝐴 ∈ ℕ → ((1 ∈ ℤ ∧ (1...𝐴) ⊆ (ℤ≥‘1) ∧ ∀𝑗 ∈ (ℤ≥‘1)DECID 𝑗 ∈ (1...𝐴)) ∨ (1...𝐴) ∈ Fin))
39	15, 27, 35, 38	isumss2 12186	. . . . . . 7 ⊢ (𝐴 ∈ ℕ → Σ𝑘 ∈ ((1...𝐴) ∩ ℙ)(log‘𝑘) = Σ𝑘 ∈ (1...𝐴)if(𝑘 ∈ ((1...𝐴) ∩ ℙ), (log‘𝑘), 0))
40	13, 39	eqtrd 2271	. . . . . 6 ⊢ (𝐴 ∈ ℕ → Σ𝑘 ∈ ((0[,]𝐴) ∩ ℙ)(log‘𝑘) = Σ𝑘 ∈ (1...𝐴)if(𝑘 ∈ ((1...𝐴) ∩ ℙ), (log‘𝑘), 0))
41	3, 40	eqtrd 2271	. . . . 5 ⊢ (𝐴 ∈ ℕ → (θ‘𝐴) = Σ𝑘 ∈ (1...𝐴)if(𝑘 ∈ ((1...𝐴) ∩ ℙ), (log‘𝑘), 0))
42		elin 3412	. . . . . . . 8 ⊢ (𝑘 ∈ ((1...𝐴) ∩ ℙ) ↔ (𝑘 ∈ (1...𝐴) ∧ 𝑘 ∈ ℙ))
43	42	baibr 932	. . . . . . 7 ⊢ (𝑘 ∈ (1...𝐴) → (𝑘 ∈ ℙ ↔ 𝑘 ∈ ((1...𝐴) ∩ ℙ)))
44	43	ifbid 3662	. . . . . 6 ⊢ (𝑘 ∈ (1...𝐴) → if(𝑘 ∈ ℙ, (log‘𝑘), 0) = if(𝑘 ∈ ((1...𝐴) ∩ ℙ), (log‘𝑘), 0))
45	44	sumeq2i 12156	. . . . 5 ⊢ Σ𝑘 ∈ (1...𝐴)if(𝑘 ∈ ℙ, (log‘𝑘), 0) = Σ𝑘 ∈ (1...𝐴)if(𝑘 ∈ ((1...𝐴) ∩ ℙ), (log‘𝑘), 0)
46	41, 45	eqtr4di 2289	. . . 4 ⊢ (𝐴 ∈ ℕ → (θ‘𝐴) = Σ𝑘 ∈ (1...𝐴)if(𝑘 ∈ ℙ, (log‘𝑘), 0))
47		eqid 2238	. . . . . 6 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))
48		eleq1w 2299	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (𝑛 ∈ ℙ ↔ 𝑘 ∈ ℙ))
49		fveq2 5698	. . . . . . 7 ⊢ (𝑛 = 𝑘 → (log‘𝑛) = (log‘𝑘))
50	48, 49	ifbieq1d 3663	. . . . . 6 ⊢ (𝑛 = 𝑘 → if(𝑛 ∈ ℙ, (log‘𝑛), 0) = if(𝑘 ∈ ℙ, (log‘𝑘), 0))
51		elnnuz 9976	. . . . . . 7 ⊢ (𝑘 ∈ ℕ ↔ 𝑘 ∈ (ℤ≥‘1))
52	51	bilanri 389	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ ℕ)
53	52	nnrpd 10113	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ ℝ+)
54	53	relogcld 16124	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → (log‘𝑘) ∈ ℝ)
55	54	recnd 8361	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → (log‘𝑘) ∈ ℂ)
56		0cnd 8326	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → 0 ∈ ℂ)
57		eluzelz 9948	. . . . . . . . 9 ⊢ (𝑘 ∈ (ℤ≥‘1) → 𝑘 ∈ ℤ)
58	57	adantl 277	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → 𝑘 ∈ ℤ)
59		prmdcz 12935	. . . . . . . 8 ⊢ (𝑘 ∈ ℤ → DECID 𝑘 ∈ ℙ)
60	58, 59	syl 14	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → DECID 𝑘 ∈ ℙ)
61	55, 56, 60	ifcldcd 3678	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → if(𝑘 ∈ ℙ, (log‘𝑘), 0) ∈ ℂ)
62	47, 50, 52, 61	fvmptd3 5802	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘) = if(𝑘 ∈ ℙ, (log‘𝑘), 0))
63		elnnuz 9976	. . . . . 6 ⊢ (𝐴 ∈ ℕ ↔ 𝐴 ∈ (ℤ≥‘1))
64	63	biimpi 120	. . . . 5 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ (ℤ≥‘1))
65	62, 64, 61	fsum3ser 12190	. . . 4 ⊢ (𝐴 ∈ ℕ → Σ𝑘 ∈ (1...𝐴)if(𝑘 ∈ ℙ, (log‘𝑘), 0) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0)))‘𝐴))
66	46, 65	eqtrd 2271	. . 3 ⊢ (𝐴 ∈ ℕ → (θ‘𝐴) = (seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0)))‘𝐴))
67	66	fveq2d 5702	. 2 ⊢ (𝐴 ∈ ℕ → (exp‘(θ‘𝐴)) = (exp‘(seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0)))‘𝐴)))
68		addcl 8311	. . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑝 ∈ ℂ) → (𝑘 + 𝑝) ∈ ℂ)
69	68	adantl 277	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ (𝑘 ∈ ℂ ∧ 𝑝 ∈ ℂ)) → (𝑘 + 𝑝) ∈ ℂ)
70	62, 61	eqeltrd 2315	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘) ∈ ℂ)
71		efadd 12468	. . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑝 ∈ ℂ) → (exp‘(𝑘 + 𝑝)) = ((exp‘𝑘) · (exp‘𝑝)))
72	71	adantl 277	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ (𝑘 ∈ ℂ ∧ 𝑝 ∈ ℂ)) → (exp‘(𝑘 + 𝑝)) = ((exp‘𝑘) · (exp‘𝑝)))
73		simpr 110	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → 𝑘 ∈ ℕ)
74		1nn 9325	. . . . . . . . 9 ⊢ 1 ∈ ℕ
75	74	a1i 9	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → 1 ∈ ℕ)
76	51, 60	sylan2b 287	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → DECID 𝑘 ∈ ℙ)
77	73, 75, 76	ifcldcd 3678	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → if(𝑘 ∈ ℙ, 𝑘, 1) ∈ ℕ)
78	77	nnrpd 10113	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → if(𝑘 ∈ ℙ, 𝑘, 1) ∈ ℝ+)
79	78	reeflogd 16125	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → (exp‘(log‘if(𝑘 ∈ ℙ, 𝑘, 1))) = if(𝑘 ∈ ℙ, 𝑘, 1))
80	51, 62	sylan2b 287	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘) = if(𝑘 ∈ ℙ, (log‘𝑘), 0))
81		prmdc 12934	. . . . . . . . . 10 ⊢ (𝑘 ∈ ℕ → DECID 𝑘 ∈ ℙ)
82		fvifdc 5720	. . . . . . . . . 10 ⊢ (DECID 𝑘 ∈ ℙ → (log‘if(𝑘 ∈ ℙ, 𝑘, 1)) = if(𝑘 ∈ ℙ, (log‘𝑘), (log‘1)))
83	81, 82	syl 14	. . . . . . . . 9 ⊢ (𝑘 ∈ ℕ → (log‘if(𝑘 ∈ ℙ, 𝑘, 1)) = if(𝑘 ∈ ℙ, (log‘𝑘), (log‘1)))
84	83	adantl 277	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → (log‘if(𝑘 ∈ ℙ, 𝑘, 1)) = if(𝑘 ∈ ℙ, (log‘𝑘), (log‘1)))
85		log1 16107	. . . . . . . . 9 ⊢ (log‘1) = 0
86		ifeq2 3644	. . . . . . . . 9 ⊢ ((log‘1) = 0 → if(𝑘 ∈ ℙ, (log‘𝑘), (log‘1)) = if(𝑘 ∈ ℙ, (log‘𝑘), 0))
87	85, 86	ax-mp 5	. . . . . . . 8 ⊢ if(𝑘 ∈ ℙ, (log‘𝑘), (log‘1)) = if(𝑘 ∈ ℙ, (log‘𝑘), 0)
88	84, 87	eqtrdi 2287	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → (log‘if(𝑘 ∈ ℙ, 𝑘, 1)) = if(𝑘 ∈ ℙ, (log‘𝑘), 0))
89	80, 88	eqtr4d 2274	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘) = (log‘if(𝑘 ∈ ℙ, 𝑘, 1)))
90	89	fveq2d 5702	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → (exp‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘)) = (exp‘(log‘if(𝑘 ∈ ℙ, 𝑘, 1))))
91		id 19	. . . . . . . 8 ⊢ (𝑛 = 𝑘 → 𝑛 = 𝑘)
92	48, 91	ifbieq1d 3663	. . . . . . 7 ⊢ (𝑛 = 𝑘 → if(𝑛 ∈ ℙ, 𝑛, 1) = if(𝑘 ∈ ℙ, 𝑘, 1))
93		prmorcht.1	. . . . . . 7 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, 𝑛, 1))
94		vex 2824	. . . . . . . 8 ⊢ 𝑘 ∈ V
95		1ex 8328	. . . . . . . 8 ⊢ 1 ∈ V
96	94, 95	ifex 4634	. . . . . . 7 ⊢ if(𝑘 ∈ ℙ, 𝑘, 1) ∈ V
97	92, 93, 96	fvmpt 5785	. . . . . 6 ⊢ (𝑘 ∈ ℕ → (𝐹‘𝑘) = if(𝑘 ∈ ℙ, 𝑘, 1))
98	97	adantl 277	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → (𝐹‘𝑘) = if(𝑘 ∈ ℙ, 𝑘, 1))
99	79, 90, 98	3eqtr4d 2281	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ ℕ) → (exp‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘)) = (𝐹‘𝑘))
100	52, 99	syldan 282	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → (exp‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘)) = (𝐹‘𝑘))
101		efcl 12457	. . . . 5 ⊢ (((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘) ∈ ℂ → (exp‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘)) ∈ ℂ)
102	70, 101	syl 14	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → (exp‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0))‘𝑘)) ∈ ℂ)
103	100, 102	eqeltrrd 2316	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ 𝑘 ∈ (ℤ≥‘1)) → (𝐹‘𝑘) ∈ ℂ)
104		mulcl 8313	. . . 4 ⊢ ((𝑘 ∈ ℂ ∧ 𝑝 ∈ ℂ) → (𝑘 · 𝑝) ∈ ℂ)
105	104	adantl 277	. . 3 ⊢ ((𝐴 ∈ ℕ ∧ (𝑘 ∈ ℂ ∧ 𝑝 ∈ ℂ)) → (𝑘 · 𝑝) ∈ ℂ)
106	69, 70, 64, 72, 100, 103, 105	seq3homo 10986	. 2 ⊢ (𝐴 ∈ ℕ → (exp‘(seq1( + , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (log‘𝑛), 0)))‘𝐴)) = (seq1( · , 𝐹)‘𝐴))
107	67, 106	eqtrd 2271	1 ⊢ (𝐴 ∈ ℕ → (exp‘(θ‘𝐴)) = (seq1( · , 𝐹)‘𝐴))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 104   ∨ wo 720  DECID wdc 846   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528   ∩ cin 3219   ⊆ wss 3220  ifcif 3638   ↦ cmpt 4193  ‘cfv 5380  (class class class)co 6088  Fincfn 7027  ℂcc 8184  0cc0 8186  1c1 8187   + caddc 8189   · cmul 8191  ℕcn 9314  2c2 9365  ℤcz 9656  ℤ_≥cuz 9938  ℚcq 10036  [,]cicc 10311  ...cfz 10429  ⌊cfl 10721  seqcseq 10906  Σcsu 12145  expce 12435  ℙcprime 12911  logclog 16097  θccht 16245

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737  ax-cnex 8277  ax-resscn 8278  ax-1cn 8279  ax-1re 8280  ax-icn 8281  ax-addcl 8282  ax-addrcl 8283  ax-mulcl 8284  ax-mulrcl 8285  ax-addcom 8286  ax-mulcom 8287  ax-addass 8288  ax-mulass 8289  ax-distr 8290  ax-i2m1 8291  ax-0lt1 8292  ax-1rid 8293  ax-0id 8294  ax-rnegex 8295  ax-precex 8296  ax-cnre 8297  ax-pre-ltirr 8298  ax-pre-ltwlin 8299  ax-pre-lttrn 8300  ax-pre-apti 8301  ax-pre-ltadd 8302  ax-pre-mulgt0 8303  ax-pre-mulext 8304  ax-arch 8305  ax-caucvg 8306  ax-pre-suploc 8307  ax-addf 8308  ax-mulf 8309

This proof depends on definitions:  df-bi 117  df-stab 843  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-if 3639  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-disj 4107  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-ilim 4516  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-isom 5389  df-riota 6041  df-ov 6091  df-oprab 6092  df-mpo 6093  df-of 6305  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-frec 6666  df-1o 6691  df-2o 6692  df-oadd 6695  df-er 6811  df-map 6928  df-pm 6929  df-en 7028  df-dom 7029  df-fin 7030  df-sup 7331  df-inf 7332  df-pnf 8369  df-mnf 8370  df-xr 8371  df-ltxr 8372  df-le 8373  df-sub 8507  df-neg 8508  df-reap 8912  df-ap 8919  df-div 9012  df-inn 9315  df-2 9373  df-3 9374  df-4 9375  df-n0 9576  df-z 9657  df-uz 9939  df-q 10037  df-rp 10073  df-xneg 10192  df-xadd 10193  df-ioo 10312  df-ico 10314  df-icc 10315  df-fz 10430  df-fzo 10568  df-fl 10723  df-mod 10782  df-seqfrec 10907  df-exp 10998  df-fac 11187  df-bc 11209  df-ihash 11238  df-shft 11603  df-cj 11630  df-re 11631  df-im 11632  df-rsqrt 11787  df-abs 11788  df-clim 12071  df-sumdc 12146  df-ef 12441  df-e 12442  df-dvds 12581  df-prm 12912  df-rest 13655  df-topgen 13674  df-psmet 14990  df-xmet 14991  df-met 14992  df-bl 14993  df-mopn 14994  df-top 15236  df-topon 15249  df-bases 15281  df-ntr 15334  df-cn 15426  df-cnp 15427  df-tx 15491  df-cncf 15809  df-limced 15894  df-dvap 15895  df-relog 16099  df-cht 16248

This theorem is used by:  chtublem  16307  bposlem6  16328