pclogsum - Metamath Proof Explorer

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

Theorem pclogsum 27345

Description: The logarithmic analogue of pcprod 16955. The sum of the logarithms of the primes dividing 𝐴 multiplied by their powers yields the logarithm of 𝐴. (Contributed by Mario Carneiro, 15-Apr-2016.)

**Assertion**
Ref	Expression
pclogsum	⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)) = (log‘𝐴))

Distinct variable group: 𝐴,𝑝

Proof of Theorem pclogsum Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elin 3929	. . . . . 6 ⊢ (𝑝 ∈ ((1...𝐴) ∩ ℙ) ↔ (𝑝 ∈ (1...𝐴) ∧ 𝑝 ∈ ℙ))
2	1	baib 544	. . . . 5 ⊢ (𝑝 ∈ (1...𝐴) → (𝑝 ∈ ((1...𝐴) ∩ ℙ) ↔ 𝑝 ∈ ℙ))
3	2	ifbid 4516	. . . 4 ⊢ (𝑝 ∈ (1...𝐴) → if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
4		fvif 6898	. . . . 5 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), (log‘1))
5		log1 26716	. . . . . 6 ⊢ (log‘1) = 0
6		ifeq2 4497	. . . . . 6 ⊢ ((log‘1) = 0 → if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), (log‘1)) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
7	5, 6	ax-mp 5	. . . . 5 ⊢ if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), (log‘1)) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0)
8	4, 7	eqtri 2792	. . . 4 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0)
9	3, 8	eqtr4di 2822	. . 3 ⊢ (𝑝 ∈ (1...𝐴) → if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
10	9	sumeq2i 15749	. 2 ⊢ Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
11		inss1 4197	. . . 4 ⊢ ((1...𝐴) ∩ ℙ) ⊆ (1...𝐴)
12		simpr 489	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ((1...𝐴) ∩ ℙ))
13	12	elin1d 4165	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ (1...𝐴))
14		elfznn 13581	. . . . . . . . . 10 ⊢ (𝑝 ∈ (1...𝐴) → 𝑝 ∈ ℕ)
15	13, 14	syl 18	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℕ)
16	12	elin2d 4166	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℙ)
17		simpl 487	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝐴 ∈ ℕ)
18	16, 17	pccld 16910	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝 pCnt 𝐴) ∈ ℕ₀)
19	15, 18	nnexpcld 14281	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℕ)
20	19	nnrpd 13058	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℝ⁺)
21	20	relogcld 26754	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℝ)
22	21	recnd 11237	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ)
23	22	ralrimiva 3163	. . . 4 ⊢ (𝐴 ∈ ℕ → ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ)
24		fzfi 14008	. . . . . 6 ⊢ (1...𝐴) ∈ Fin
25	24	olci 879	. . . . 5 ⊢ ((1...𝐴) ⊆ (ℤ_≥‘1) ∨ (1...𝐴) ∈ Fin)
26		sumss2 15777	. . . . 5 ⊢ (((((1...𝐴) ∩ ℙ) ⊆ (1...𝐴) ∧ ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ) ∧ ((1...𝐴) ⊆ (ℤ_≥‘1) ∨ (1...𝐴) ∈ Fin)) → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
27	25, 26	mpan2 703	. . . 4 ⊢ ((((1...𝐴) ∩ ℙ) ⊆ (1...𝐴) ∧ ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ) → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
28	11, 23, 27	sylancr 598	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
29	15	nnrpd 13058	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℝ⁺)
30	18	nn0zd 12616	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝 pCnt 𝐴) ∈ ℤ)
31		relogexp 26727	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ (𝑝 pCnt 𝐴) ∈ ℤ) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) = ((𝑝 pCnt 𝐴) · (log‘𝑝)))
32	29, 30, 31	syl2anc 595	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) = ((𝑝 pCnt 𝐴) · (log‘𝑝)))
33	32	sumeq2dv 15753	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)))
34	28, 33	eqtr3d 2806	. 2 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)))
35	14	adantl 486	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → 𝑝 ∈ ℕ)
36		eleq1w 2852	. . . . . . . 8 ⊢ (𝑛 = 𝑝 → (𝑛 ∈ ℙ ↔ 𝑝 ∈ ℙ))
37		id 23	. . . . . . . . 9 ⊢ (𝑛 = 𝑝 → 𝑛 = 𝑝)
38		oveq1 7418	. . . . . . . . 9 ⊢ (𝑛 = 𝑝 → (𝑛 pCnt 𝐴) = (𝑝 pCnt 𝐴))
39	37, 38	oveq12d 7429	. . . . . . . 8 ⊢ (𝑛 = 𝑝 → (𝑛↑(𝑛 pCnt 𝐴)) = (𝑝↑(𝑝 pCnt 𝐴)))
40	36, 39	ifbieq1d 4517	. . . . . . 7 ⊢ (𝑛 = 𝑝 → if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
41	40	fveq2d 6886	. . . . . 6 ⊢ (𝑛 = 𝑝 → (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
42		eqid 2769	. . . . . 6 ⊢ (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))) = (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))
43		fvex 6895	. . . . . 6 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ V
44	41, 42, 43	fvmpt 6990	. . . . 5 ⊢ (𝑝 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝑝) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
45	35, 44	syl 18	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → ((𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝑝) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
46		elnnuz 12902	. . . . 5 ⊢ (𝐴 ∈ ℕ ↔ 𝐴 ∈ (ℤ_≥‘1))
47	46	biimpi 219	. . . 4 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ (ℤ_≥‘1))
48	35	adantr 485	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℕ)
49		simpr 489	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℙ)
50		simpll 778	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℕ)
51	49, 50	pccld 16910	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → (𝑝 pCnt 𝐴) ∈ ℕ₀)
52	48, 51	nnexpcld 14281	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℕ)
53		1nn 12244	. . . . . . . . 9 ⊢ 1 ∈ ℕ
54	53	a1i 11	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ ¬ 𝑝 ∈ ℙ) → 1 ∈ ℕ)
55	52, 54	ifclda 4528	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ ℕ)
56	55	nnrpd 13058	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ ℝ⁺)
57	56	relogcld 26754	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ ℝ)
58	57	recnd 11237	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ ℂ)
59	45, 47, 58	fsumser 15781	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = (seq1( + , (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))))‘𝐴))
60		rpmulcl 13041	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺) → (𝑝 · 𝑚) ∈ ℝ⁺)
61	60	adantl 486	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ (𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺)) → (𝑝 · 𝑚) ∈ ℝ⁺)
62		eqid 2769	. . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))
63		ovex 7444	. . . . . . . 8 ⊢ (𝑝↑(𝑝 pCnt 𝐴)) ∈ V
64		1ex 11203	. . . . . . . 8 ⊢ 1 ∈ V
65	63, 64	ifex 4543	. . . . . . 7 ⊢ if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ V
66	40, 62, 65	fvmpt 6990	. . . . . 6 ⊢ (𝑝 ∈ ℕ → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
67	35, 66	syl 18	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
68	67, 56	eqeltrd 2869	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) ∈ ℝ⁺)
69		relogmul 26723	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺) → (log‘(𝑝 · 𝑚)) = ((log‘𝑝) + (log‘𝑚)))
70	69	adantl 486	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ (𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺)) → (log‘(𝑝 · 𝑚)) = ((log‘𝑝) + (log‘𝑚)))
71	67	fveq2d 6886	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝)) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
72	71, 45	eqtr4d 2807	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝)) = ((𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝑝))
73	61, 68, 47, 70, 72	seqhomo 14085	. . 3 ⊢ (𝐴 ∈ ℕ → (log‘(seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴)) = (seq1( + , (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))))‘𝐴))
74	62	pcprod 16955	. . . 4 ⊢ (𝐴 ∈ ℕ → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴) = 𝐴)
75	74	fveq2d 6886	. . 3 ⊢ (𝐴 ∈ ℕ → (log‘(seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴)) = (log‘𝐴))
76	59, 73, 75	3eqtr2d 2810	. 2 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = (log‘𝐴))
77	10, 34, 76	3eqtr3a 2828	1 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)) = (log‘𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 400 ∨ wo 860 = wceq 1567 ∈ wcel 2149 ∀wral 3085 ∩ cin 3912 ⊆ wss 3913 ifcif 4492 ↦ cmpt 5196 ‘cfv 6537 (class class class)co 7411 Fincfn 8943 ℂcc 11098 0cc0 11100 1c1 11101 + caddc 11103 · cmul 11105 ℕcn 12233 ℤcz 12591 ℤ_≥cuz 12862 ℝ⁺crp 13016 ...cfz 13535 seqcseq 14037 ↑cexp 14097 Σcsu 15737 ℙcprime 16729 pCnt cpc 16896 logclog 26685

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-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-inf2 9610 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-pre-sup 11178 ax-addf 11179

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 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8157 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-er 8694 df-map 8826 df-pm 8827 df-ixp 8896 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fsupp 9322 df-fi 9371 df-sup 9402 df-inf 9403 df-oi 9472 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-q 12973 df-rp 13017 df-xneg 13137 df-xadd 13138 df-xmul 13139 df-ioo 13376 df-ioc 13377 df-ico 13378 df-icc 13379 df-fz 13536 df-fzo 13683 df-fl 13825 df-mod 13903 df-seq 14038 df-exp 14098 df-fac 14310 df-bc 14339 df-hash 14367 df-shft 15104 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-limsup 15522 df-clim 15539 df-rlim 15540 df-sum 15738 df-ef 16121 df-sin 16123 df-cos 16124 df-pi 16126 df-dvds 16311 df-gcd 16553 df-prm 16730 df-pc 16897 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-mulr 17324 df-starv 17325 df-sca 17326 df-vsca 17327 df-ip 17328 df-tset 17329 df-ple 17330 df-ds 17332 df-unif 17333 df-hom 17334 df-cco 17335 df-rest 17475 df-topn 17476 df-0g 17494 df-gsum 17495 df-topgen 17496 df-pt 17497 df-prds 17500 df-xrs 17556 df-qtop 17561 df-imas 17562 df-xps 17564 df-mre 17638 df-mrc 17639 df-acs 17641 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-submnd 18842 df-mulg 19134 df-cntz 19387 df-cmn 19852 df-psmet 21483 df-xmet 21484 df-met 21485 df-bl 21486 df-mopn 21487 df-fbas 21488 df-fg 21489 df-cnfld 21492 df-top 23020 df-topon 23037 df-topsp 23059 df-bases 23072 df-cld 23145 df-ntr 23146 df-cls 23147 df-nei 23224 df-lp 23262 df-perf 23263 df-cn 23353 df-cnp 23354 df-haus 23441 df-tx 23688 df-hmeo 23881 df-fil 23972 df-fm 24064 df-flim 24065 df-flf 24066 df-xms 24446 df-ms 24447 df-tms 24448 df-cncf 25006 df-limc 25994 df-dv 25995 df-log 26687

This theorem is referenced by: vmasum 27346 chebbnd1lem1 27599

W3C validator