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 27124

Description: The logarithmic analogue of pcprod 16807. 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 3919	. . . . . 6 ⊢ (𝑝 ∈ ((1...𝐴) ∩ ℙ) ↔ (𝑝 ∈ (1...𝐴) ∧ 𝑝 ∈ ℙ))
2	1	baib 535	. . . . 5 ⊢ (𝑝 ∈ (1...𝐴) → (𝑝 ∈ ((1...𝐴) ∩ ℙ) ↔ 𝑝 ∈ ℙ))
3	2	ifbid 4500	. . . 4 ⊢ (𝑝 ∈ (1...𝐴) → if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
4		fvif 6838	. . . . 5 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), (log‘1))
5		log1 26492	. . . . . 6 ⊢ (log‘1) = 0
6		ifeq2 4481	. . . . . 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 2752	. . . 4 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0)
9	3, 8	eqtr4di 2782	. . 3 ⊢ (𝑝 ∈ (1...𝐴) → if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
10	9	sumeq2i 15605	. 2 ⊢ Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
11		inss1 4188	. . . 4 ⊢ ((1...𝐴) ∩ ℙ) ⊆ (1...𝐴)
12		simpr 484	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ((1...𝐴) ∩ ℙ))
13	12	elin1d 4155	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ (1...𝐴))
14		elfznn 13456	. . . . . . . . . 10 ⊢ (𝑝 ∈ (1...𝐴) → 𝑝 ∈ ℕ)
15	13, 14	syl 17	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℕ)
16	12	elin2d 4156	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℙ)
17		simpl 482	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝐴 ∈ ℕ)
18	16, 17	pccld 16762	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝 pCnt 𝐴) ∈ ℕ₀)
19	15, 18	nnexpcld 14152	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℕ)
20	19	nnrpd 12935	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℝ⁺)
21	20	relogcld 26530	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℝ)
22	21	recnd 11143	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ)
23	22	ralrimiva 3121	. . . 4 ⊢ (𝐴 ∈ ℕ → ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ)
24		fzfi 13879	. . . . . 6 ⊢ (1...𝐴) ∈ Fin
25	24	olci 866	. . . . 5 ⊢ ((1...𝐴) ⊆ (ℤ_≥‘1) ∨ (1...𝐴) ∈ Fin)
26		sumss2 15633	. . . . 5 ⊢ (((((1...𝐴) ∩ ℙ) ⊆ (1...𝐴) ∧ ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ) ∧ ((1...𝐴) ⊆ (ℤ_≥‘1) ∨ (1...𝐴) ∈ Fin)) → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
27	25, 26	mpan2 691	. . . 4 ⊢ ((((1...𝐴) ∩ ℙ) ⊆ (1...𝐴) ∧ ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ) → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
28	11, 23, 27	sylancr 587	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
29	15	nnrpd 12935	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℝ⁺)
30	18	nn0zd 12497	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝 pCnt 𝐴) ∈ ℤ)
31		relogexp 26503	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ (𝑝 pCnt 𝐴) ∈ ℤ) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) = ((𝑝 pCnt 𝐴) · (log‘𝑝)))
32	29, 30, 31	syl2anc 584	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) = ((𝑝 pCnt 𝐴) · (log‘𝑝)))
33	32	sumeq2dv 15609	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)))
34	28, 33	eqtr3d 2766	. 2 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)))
35	14	adantl 481	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → 𝑝 ∈ ℕ)
36		eleq1w 2811	. . . . . . . 8 ⊢ (𝑛 = 𝑝 → (𝑛 ∈ ℙ ↔ 𝑝 ∈ ℙ))
37		id 22	. . . . . . . . 9 ⊢ (𝑛 = 𝑝 → 𝑛 = 𝑝)
38		oveq1 7356	. . . . . . . . 9 ⊢ (𝑛 = 𝑝 → (𝑛 pCnt 𝐴) = (𝑝 pCnt 𝐴))
39	37, 38	oveq12d 7367	. . . . . . . 8 ⊢ (𝑛 = 𝑝 → (𝑛↑(𝑛 pCnt 𝐴)) = (𝑝↑(𝑝 pCnt 𝐴)))
40	36, 39	ifbieq1d 4501	. . . . . . 7 ⊢ (𝑛 = 𝑝 → if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
41	40	fveq2d 6826	. . . . . 6 ⊢ (𝑛 = 𝑝 → (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
42		eqid 2729	. . . . . 6 ⊢ (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))) = (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))
43		fvex 6835	. . . . . 6 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ V
44	41, 42, 43	fvmpt 6930	. . . . 5 ⊢ (𝑝 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝑝) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
45	35, 44	syl 17	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → ((𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝑝) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
46		elnnuz 12779	. . . . 5 ⊢ (𝐴 ∈ ℕ ↔ 𝐴 ∈ (ℤ_≥‘1))
47	46	biimpi 216	. . . 4 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ (ℤ_≥‘1))
48	35	adantr 480	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℕ)
49		simpr 484	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℙ)
50		simpll 766	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℕ)
51	49, 50	pccld 16762	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → (𝑝 pCnt 𝐴) ∈ ℕ₀)
52	48, 51	nnexpcld 14152	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℕ)
53		1nn 12139	. . . . . . . . 9 ⊢ 1 ∈ ℕ
54	53	a1i 11	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ ¬ 𝑝 ∈ ℙ) → 1 ∈ ℕ)
55	52, 54	ifclda 4512	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ ℕ)
56	55	nnrpd 12935	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ ℝ⁺)
57	56	relogcld 26530	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ ℝ)
58	57	recnd 11143	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ ℂ)
59	45, 47, 58	fsumser 15637	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = (seq1( + , (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))))‘𝐴))
60		rpmulcl 12918	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺) → (𝑝 · 𝑚) ∈ ℝ⁺)
61	60	adantl 481	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ (𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺)) → (𝑝 · 𝑚) ∈ ℝ⁺)
62		eqid 2729	. . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))
63		ovex 7382	. . . . . . . 8 ⊢ (𝑝↑(𝑝 pCnt 𝐴)) ∈ V
64		1ex 11111	. . . . . . . 8 ⊢ 1 ∈ V
65	63, 64	ifex 4527	. . . . . . 7 ⊢ if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ V
66	40, 62, 65	fvmpt 6930	. . . . . 6 ⊢ (𝑝 ∈ ℕ → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
67	35, 66	syl 17	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
68	67, 56	eqeltrd 2828	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) ∈ ℝ⁺)
69		relogmul 26499	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺) → (log‘(𝑝 · 𝑚)) = ((log‘𝑝) + (log‘𝑚)))
70	69	adantl 481	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ (𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺)) → (log‘(𝑝 · 𝑚)) = ((log‘𝑝) + (log‘𝑚)))
71	67	fveq2d 6826	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝)) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
72	71, 45	eqtr4d 2767	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝)) = ((𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝑝))
73	61, 68, 47, 70, 72	seqhomo 13956	. . 3 ⊢ (𝐴 ∈ ℕ → (log‘(seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴)) = (seq1( + , (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))))‘𝐴))
74	62	pcprod 16807	. . . 4 ⊢ (𝐴 ∈ ℕ → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴) = 𝐴)
75	74	fveq2d 6826	. . 3 ⊢ (𝐴 ∈ ℕ → (log‘(seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴)) = (log‘𝐴))
76	59, 73, 75	3eqtr2d 2770	. 2 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = (log‘𝐴))
77	10, 34, 76	3eqtr3a 2788	1 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)) = (log‘𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ∀wral 3044 ∩ cin 3902 ⊆ wss 3903 ifcif 4476 ↦ cmpt 5173 ‘cfv 6482 (class class class)co 7349 Fincfn 8872 ℂcc 11007 0cc0 11009 1c1 11010 + caddc 11012 · cmul 11014 ℕcn 12128 ℤcz 12471 ℤ_≥cuz 12735 ℝ⁺crp 12893 ...cfz 13410 seqcseq 13908 ↑cexp 13968 Σcsu 15593 ℙcprime 16582 pCnt cpc 16748 logclog 26461

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5218 ax-sep 5235 ax-nul 5245 ax-pow 5304 ax-pr 5371 ax-un 7671 ax-inf2 9537 ax-cnex 11065 ax-resscn 11066 ax-1cn 11067 ax-icn 11068 ax-addcl 11069 ax-addrcl 11070 ax-mulcl 11071 ax-mulrcl 11072 ax-mulcom 11073 ax-addass 11074 ax-mulass 11075 ax-distr 11076 ax-i2m1 11077 ax-1ne0 11078 ax-1rid 11079 ax-rnegex 11080 ax-rrecex 11081 ax-cnre 11082 ax-pre-lttri 11083 ax-pre-lttrn 11084 ax-pre-ltadd 11085 ax-pre-mulgt0 11086 ax-pre-sup 11087 ax-addf 11088

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3395 df-v 3438 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-uni 4859 df-int 4897 df-iun 4943 df-iin 4944 df-br 5093 df-opab 5155 df-mpt 5174 df-tr 5200 df-id 5514 df-eprel 5519 df-po 5527 df-so 5528 df-fr 5572 df-se 5573 df-we 5574 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-pred 6249 df-ord 6310 df-on 6311 df-lim 6312 df-suc 6313 df-iota 6438 df-fun 6484 df-fn 6485 df-f 6486 df-f1 6487 df-fo 6488 df-f1o 6489 df-fv 6490 df-isom 6491 df-riota 7306 df-ov 7352 df-oprab 7353 df-mpo 7354 df-of 7613 df-om 7800 df-1st 7924 df-2nd 7925 df-supp 8094 df-frecs 8214 df-wrecs 8245 df-recs 8294 df-rdg 8332 df-1o 8388 df-2o 8389 df-er 8625 df-map 8755 df-pm 8756 df-ixp 8825 df-en 8873 df-dom 8874 df-sdom 8875 df-fin 8876 df-fsupp 9252 df-fi 9301 df-sup 9332 df-inf 9333 df-oi 9402 df-card 9835 df-pnf 11151 df-mnf 11152 df-xr 11153 df-ltxr 11154 df-le 11155 df-sub 11349 df-neg 11350 df-div 11778 df-nn 12129 df-2 12191 df-3 12192 df-4 12193 df-5 12194 df-6 12195 df-7 12196 df-8 12197 df-9 12198 df-n0 12385 df-z 12472 df-dec 12592 df-uz 12736 df-q 12850 df-rp 12894 df-xneg 13014 df-xadd 13015 df-xmul 13016 df-ioo 13252 df-ioc 13253 df-ico 13254 df-icc 13255 df-fz 13411 df-fzo 13558 df-fl 13696 df-mod 13774 df-seq 13909 df-exp 13969 df-fac 14181 df-bc 14210 df-hash 14238 df-shft 14974 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 df-limsup 15378 df-clim 15395 df-rlim 15396 df-sum 15594 df-ef 15974 df-sin 15976 df-cos 15977 df-pi 15979 df-dvds 16164 df-gcd 16406 df-prm 16583 df-pc 16749 df-struct 17058 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-mulr 17175 df-starv 17176 df-sca 17177 df-vsca 17178 df-ip 17179 df-tset 17180 df-ple 17181 df-ds 17183 df-unif 17184 df-hom 17185 df-cco 17186 df-rest 17326 df-topn 17327 df-0g 17345 df-gsum 17346 df-topgen 17347 df-pt 17348 df-prds 17351 df-xrs 17406 df-qtop 17411 df-imas 17412 df-xps 17414 df-mre 17488 df-mrc 17489 df-acs 17491 df-mgm 18514 df-sgrp 18593 df-mnd 18609 df-submnd 18658 df-mulg 18947 df-cntz 19196 df-cmn 19661 df-psmet 21253 df-xmet 21254 df-met 21255 df-bl 21256 df-mopn 21257 df-fbas 21258 df-fg 21259 df-cnfld 21262 df-top 22779 df-topon 22796 df-topsp 22818 df-bases 22831 df-cld 22904 df-ntr 22905 df-cls 22906 df-nei 22983 df-lp 23021 df-perf 23022 df-cn 23112 df-cnp 23113 df-haus 23200 df-tx 23447 df-hmeo 23640 df-fil 23731 df-fm 23823 df-flim 23824 df-flf 23825 df-xms 24206 df-ms 24207 df-tms 24208 df-cncf 24769 df-limc 25765 df-dv 25766 df-log 26463

This theorem is referenced by: vmasum 27125 chebbnd1lem1 27378

W3C validator