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 27542

Description: The logarithmic analogue of pcprod 17073. 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 3915	. . . . . 6 ⊢ (𝑝 ∈ ((1...𝐴) ∩ ℙ) ↔ (𝑝 ∈ (1...𝐴) ∧ 𝑝 ∈ ℙ))
2	1	baib 545	. . . . 5 ⊢ (𝑝 ∈ (1...𝐴) → (𝑝 ∈ ((1...𝐴) ∩ ℙ) ↔ 𝑝 ∈ ℙ))
3	2	ifbid 4506	. . . 4 ⊢ (𝑝 ∈ (1...𝐴) → if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
4		fvif 6901	. . . . 5 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), (log‘1))
5		log1 26913	. . . . . 6 ⊢ (log‘1) = 0
6		ifeq2 4487	. . . . . 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 2784	. . . 4 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = if(𝑝 ∈ ℙ, (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0)
9	3, 8	eqtr4di 2814	. . 3 ⊢ (𝑝 ∈ (1...𝐴) → if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
10	9	sumeq2i 15865	. 2 ⊢ Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
11		inss1 4182	. . . 4 ⊢ ((1...𝐴) ∩ ℙ) ⊆ (1...𝐴)
12		simpr 490	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ((1...𝐴) ∩ ℙ))
13	12	elin1d 4150	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ (1...𝐴))
14		elfznn 13687	. . . . . . . . . 10 ⊢ (𝑝 ∈ (1...𝐴) → 𝑝 ∈ ℕ)
15	13, 14	syl 18	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℕ)
16	12	elin2d 4151	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℙ)
17		simpl 488	. . . . . . . . . 10 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝐴 ∈ ℕ)
18	16, 17	pccld 17028	. . . . . . . . 9 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝 pCnt 𝐴) ∈ ℕ₀)
19	15, 18	nnexpcld 14389	. . . . . . . 8 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℕ)
20	19	nnrpd 13162	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℝ⁺)
21	20	relogcld 26951	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℝ)
22	21	recnd 11337	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ)
23	22	ralrimiva 3155	. . . 4 ⊢ (𝐴 ∈ ℕ → ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ)
24		fzfi 14115	. . . . . 6 ⊢ (1...𝐴) ∈ Fin
25	24	olci 880	. . . . 5 ⊢ ((1...𝐴) ⊆ (ℤ_≥‘1) ∨ (1...𝐴) ∈ Fin)
26		sumss2 15892	. . . . 5 ⊢ (((((1...𝐴) ∩ ℙ) ⊆ (1...𝐴) ∧ ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ) ∧ ((1...𝐴) ⊆ (ℤ_≥‘1) ∨ (1...𝐴) ∈ Fin)) → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
27	25, 26	mpan2 704	. . . 4 ⊢ ((((1...𝐴) ∩ ℙ) ⊆ (1...𝐴) ∧ ∀𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) ∈ ℂ) → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
28	11, 23, 27	sylancr 599	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0))
29	15	nnrpd 13162	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → 𝑝 ∈ ℝ⁺)
30	18	nn0zd 12718	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (𝑝 pCnt 𝐴) ∈ ℤ)
31		relogexp 26924	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ (𝑝 pCnt 𝐴) ∈ ℤ) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) = ((𝑝 pCnt 𝐴) · (log‘𝑝)))
32	29, 30, 31	syl2anc 596	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ ((1...𝐴) ∩ ℙ)) → (log‘(𝑝↑(𝑝 pCnt 𝐴))) = ((𝑝 pCnt 𝐴) · (log‘𝑝)))
33	32	sumeq2dv 15869	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)(log‘(𝑝↑(𝑝 pCnt 𝐴))) = Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)))
34	28, 33	eqtr3d 2798	. 2 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)if(𝑝 ∈ ((1...𝐴) ∩ ℙ), (log‘(𝑝↑(𝑝 pCnt 𝐴))), 0) = Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)))
35	14	adantl 487	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → 𝑝 ∈ ℕ)
36		eleq1w 2844	. . . . . . . 8 ⊢ (𝑛 = 𝑝 → (𝑛 ∈ ℙ ↔ 𝑝 ∈ ℙ))
37		id 23	. . . . . . . . 9 ⊢ (𝑛 = 𝑝 → 𝑛 = 𝑝)
38		oveq1 7427	. . . . . . . . 9 ⊢ (𝑛 = 𝑝 → (𝑛 pCnt 𝐴) = (𝑝 pCnt 𝐴))
39	37, 38	oveq12d 7438	. . . . . . . 8 ⊢ (𝑛 = 𝑝 → (𝑛↑(𝑛 pCnt 𝐴)) = (𝑝↑(𝑝 pCnt 𝐴)))
40	36, 39	ifbieq1d 4507	. . . . . . 7 ⊢ (𝑛 = 𝑝 → if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
41	40	fveq2d 6889	. . . . . 6 ⊢ (𝑛 = 𝑝 → (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
42		eqid 2761	. . . . . 6 ⊢ (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))) = (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))
43		fvex 6898	. . . . . 6 ⊢ (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ V
44	41, 42, 43	fvmpt 6993	. . . . 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 13005	. . . . 5 ⊢ (𝐴 ∈ ℕ ↔ 𝐴 ∈ (ℤ_≥‘1))
47	46	biimpi 219	. . . 4 ⊢ (𝐴 ∈ ℕ → 𝐴 ∈ (ℤ_≥‘1))
48	35	adantr 486	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℕ)
49		simpr 490	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝑝 ∈ ℙ)
50		simpll 779	. . . . . . . . . 10 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → 𝐴 ∈ ℕ)
51	49, 50	pccld 17028	. . . . . . . . 9 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → (𝑝 pCnt 𝐴) ∈ ℕ₀)
52	48, 51	nnexpcld 14389	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ 𝑝 ∈ ℙ) → (𝑝↑(𝑝 pCnt 𝐴)) ∈ ℕ)
53		1nn 12346	. . . . . . . . 9 ⊢ 1 ∈ ℕ
54	53	a1i 11	. . . . . . . 8 ⊢ (((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) ∧ ¬ 𝑝 ∈ ℙ) → 1 ∈ ℕ)
55	52, 54	ifclda 4518	. . . . . . 7 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ ℕ)
56	55	nnrpd 13162	. . . . . 6 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ ℝ⁺)
57	56	relogcld 26951	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ ℝ)
58	57	recnd 11337	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) ∈ ℂ)
59	45, 47, 58	fsumser 15896	. . 3 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = (seq1( + , (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))))‘𝐴))
60		rpmulcl 13145	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺) → (𝑝 · 𝑚) ∈ ℝ⁺)
61	60	adantl 487	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ (𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺)) → (𝑝 · 𝑚) ∈ ℝ⁺)
62		eqid 2761	. . . . . . 7 ⊢ (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)) = (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))
63		ovex 7453	. . . . . . . 8 ⊢ (𝑝↑(𝑝 pCnt 𝐴)) ∈ V
64		1ex 11303	. . . . . . . 8 ⊢ 1 ∈ V
65	63, 64	ifex 4533	. . . . . . 7 ⊢ if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1) ∈ V
66	40, 62, 65	fvmpt 6993	. . . . . 6 ⊢ (𝑝 ∈ ℕ → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
67	35, 66	syl 18	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) = if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1))
68	67, 56	eqeltrd 2861	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → ((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝) ∈ ℝ⁺)
69		relogmul 26920	. . . . 5 ⊢ ((𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺) → (log‘(𝑝 · 𝑚)) = ((log‘𝑝) + (log‘𝑚)))
70	69	adantl 487	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ (𝑝 ∈ ℝ⁺ ∧ 𝑚 ∈ ℝ⁺)) → (log‘(𝑝 · 𝑚)) = ((log‘𝑝) + (log‘𝑚)))
71	67	fveq2d 6889	. . . . 5 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝)) = (log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)))
72	71, 45	eqtr4d 2799	. . . 4 ⊢ ((𝐴 ∈ ℕ ∧ 𝑝 ∈ (1...𝐴)) → (log‘((𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))‘𝑝)) = ((𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝑝))
73	61, 68, 47, 70, 72	seqhomo 14192	. . 3 ⊢ (𝐴 ∈ ℕ → (log‘(seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴)) = (seq1( + , (𝑛 ∈ ℕ ↦ (log‘if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1))))‘𝐴))
74	62	pcprod 17073	. . . 4 ⊢ (𝐴 ∈ ℕ → (seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴) = 𝐴)
75	74	fveq2d 6889	. . 3 ⊢ (𝐴 ∈ ℕ → (log‘(seq1( · , (𝑛 ∈ ℕ ↦ if(𝑛 ∈ ℙ, (𝑛↑(𝑛 pCnt 𝐴)), 1)))‘𝐴)) = (log‘𝐴))
76	59, 73, 75	3eqtr2d 2802	. 2 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ (1...𝐴)(log‘if(𝑝 ∈ ℙ, (𝑝↑(𝑝 pCnt 𝐴)), 1)) = (log‘𝐴))
77	10, 34, 76	3eqtr3a 2820	1 ⊢ (𝐴 ∈ ℕ → Σ𝑝 ∈ ((1...𝐴) ∩ ℙ)((𝑝 pCnt 𝐴) · (log‘𝑝)) = (log‘𝐴))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∨ wo 861 = wceq 1570 ∈ wcel 2145 ∀wral 3077 ∩ cin 3898 ⊆ wss 3899 ifcif 4482 ↦ cmpt 5186 ‘cfv 6538 (class class class)co 7420 Fincfn 8973 ℂcc 11198 0cc0 11200 1c1 11201 + caddc 11203 · cmul 11205 ℕcn 12335 ℤcz 12693 ℤ_≥cuz 12965 ℝ⁺crp 13120 ...cfz 13639 seqcseq 14144 ↑cexp 14204 Σcsu 15853 ℙcprime 16846 pCnt cpc 17014 logclog 26882

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-inf2 9642 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 ax-addf 11279

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-isom 6547 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-of 7693 df-om 7878 df-1st 8001 df-2nd 8002 df-supp 8178 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-2o 8477 df-er 8717 df-map 8849 df-pm 8850 df-ixp 8926 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-fsupp 9354 df-fi 9403 df-sup 9434 df-inf 9435 df-oi 9504 df-card 10020 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-q 13076 df-rp 13121 df-xneg 13241 df-xadd 13242 df-xmul 13243 df-ioo 13480 df-ioc 13481 df-ico 13482 df-icc 13483 df-fz 13640 df-fzo 13789 df-fl 13932 df-mod 14010 df-seq 14145 df-exp 14205 df-fac 14418 df-bc 14447 df-hash 14475 df-shft 15220 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-limsup 15638 df-clim 15655 df-rlim 15656 df-sum 15854 df-ef 16233 df-sin 16235 df-cos 16236 df-pi 16238 df-dvds 16423 df-gcd 16665 df-prm 16847 df-pc 17015 df-struct 17325 df-sets 17342 df-slot 17360 df-ndx 17372 df-base 17388 df-ress 17409 df-plusg 17441 df-mulr 17442 df-starv 17443 df-sca 17444 df-vsca 17445 df-ip 17446 df-tset 17447 df-ple 17448 df-ds 17450 df-unif 17451 df-hom 17452 df-cco 17453 df-rest 17593 df-topn 17594 df-0g 17612 df-gsum 17613 df-topgen 17614 df-pt 17615 df-prds 17618 df-xrs 17674 df-qtop 17679 df-imas 17680 df-xps 17682 df-mre 17756 df-mrc 17757 df-acs 17759 df-mgm 18816 df-sgrp 18908 df-mnd 18924 df-submnd 18979 df-mulg 19278 df-cntz 19531 df-cmn 19996 df-psmet 21670 df-xmet 21671 df-met 21672 df-bl 21673 df-mopn 21674 df-fbas 21675 df-fg 21676 df-cnfld 21679 df-top 23212 df-topon 23229 df-topsp 23251 df-bases 23264 df-cld 23337 df-ntr 23338 df-cls 23339 df-nei 23416 df-lp 23454 df-perf 23455 df-cn 23545 df-cnp 23546 df-haus 23633 df-tx 23881 df-hmeo 24074 df-fil 24165 df-fm 24257 df-flim 24258 df-flf 24259 df-xms 24639 df-ms 24640 df-tms 24641 df-cncf 25199 df-limc 26186 df-dv 26187 df-log 26884

This theorem is used by: vmasum 27543 chebbnd1lem1 27796

W3C validator