dchrisum0flblem2 - Metamath Proof Explorer

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

Theorem dchrisum0flblem2 27473

Description: Lemma for dchrisum0flb 27474. Induction over relatively prime factors, with the prime power case handled in dchrisum0flblem1 . (Contributed by Mario Carneiro, 5-May-2016.) Replace reference to OLD theorem. (Revised by Wolf Lammen, 8-Sep-2020.)

**Hypotheses**
Ref	Expression
rpvmasum.z	⊢ 𝑍 = (ℤ/nℤ‘𝑁)
rpvmasum.l	⊢ 𝐿 = (ℤRHom‘𝑍)
rpvmasum.a	⊢ (𝜑 → 𝑁 ∈ ℕ)
rpvmasum2.g	⊢ 𝐺 = (DChr‘𝑁)
rpvmasum2.d	⊢ 𝐷 = (Base‘𝐺)
rpvmasum2.1	⊢ 1 = (0_g‘𝐺)
dchrisum0f.f	⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣)))
dchrisum0f.x	⊢ (𝜑 → 𝑋 ∈ 𝐷)
dchrisum0flb.r	⊢ (𝜑 → 𝑋:(Base‘𝑍)⟶ℝ)
dchrisum0flb.1	⊢ (𝜑 → 𝐴 ∈ (ℤ_≥‘2))
dchrisum0flb.2	⊢ (𝜑 → 𝑃 ∈ ℙ)
dchrisum0flb.3	⊢ (𝜑 → 𝑃 ∥ 𝐴)
dchrisum0flb.4	⊢ (𝜑 → ∀𝑦 ∈ (1..^𝐴)if((√‘𝑦) ∈ ℕ, 1, 0) ≤ (𝐹‘𝑦))

**Assertion**
Ref	Expression
dchrisum0flblem2	⊢ (𝜑 → if((√‘𝐴) ∈ ℕ, 1, 0) ≤ (𝐹‘𝐴))

Distinct variable groups: 𝑦, 1 𝑦,𝐹 𝑞,𝑏,𝑣,𝑦,𝐴 𝑁,𝑞,𝑦 𝑃,𝑏,𝑞,𝑣,𝑦 𝑦,𝑍 𝑦,𝐷 𝐿,𝑏,𝑣,𝑦 𝑋,𝑏,𝑣,𝑦 Allowed substitution hints: 𝜑(𝑦,𝑣,𝑞,𝑏) 𝐷(𝑣,𝑞,𝑏) 1 (𝑣,𝑞,𝑏) 𝐹(𝑣,𝑞,𝑏) 𝐺(𝑦,𝑣,𝑞,𝑏) 𝐿(𝑞) 𝑁(𝑣,𝑏) 𝑋(𝑞) 𝑍(𝑣,𝑞,𝑏)

**Proof of Theorem dchrisum0flblem2**
Step	Hyp	Ref	Expression
1		breq1 5151	. . 3 ⊢ (1 = if((√‘𝐴) ∈ ℕ, 1, 0) → (1 ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))) ↔ if((√‘𝐴) ∈ ℕ, 1, 0) ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))))
2		breq1 5151	. . 3 ⊢ (0 = if((√‘𝐴) ∈ ℕ, 1, 0) → (0 ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))) ↔ if((√‘𝐴) ∈ ℕ, 1, 0) ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))))
3		1t1e1 12404	. . . 4 ⊢ (1 · 1) = 1
4		dchrisum0flb.2	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → 𝑃 ∈ ℙ)
5	4	adantr 479	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 𝑃 ∈ ℙ)
6		nnq 12976	. . . . . . . . . . . . . . 15 ⊢ ((√‘𝐴) ∈ ℕ → (√‘𝐴) ∈ ℚ)
7	6	adantl 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘𝐴) ∈ ℚ)
8		nnne0 12276	. . . . . . . . . . . . . . 15 ⊢ ((√‘𝐴) ∈ ℕ → (√‘𝐴) ≠ 0)
9	8	adantl 480	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘𝐴) ≠ 0)
10		2z 12624	. . . . . . . . . . . . . . 15 ⊢ 2 ∈ ℤ
11	10	a1i 11	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 2 ∈ ℤ)
12		pcexp 16828	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℙ ∧ ((√‘𝐴) ∈ ℚ ∧ (√‘𝐴) ≠ 0) ∧ 2 ∈ ℤ) → (𝑃 pCnt ((√‘𝐴)↑2)) = (2 · (𝑃 pCnt (√‘𝐴))))
13	5, 7, 9, 11, 12	syl121anc 1372	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃 pCnt ((√‘𝐴)↑2)) = (2 · (𝑃 pCnt (√‘𝐴))))
14		dchrisum0flb.1	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → 𝐴 ∈ (ℤ_≥‘2))
15		eluz2nn 12898	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐴 ∈ (ℤ_≥‘2) → 𝐴 ∈ ℕ)
16	14, 15	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐴 ∈ ℕ)
17	16	nncnd 12258	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → 𝐴 ∈ ℂ)
18	17	adantr 479	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 𝐴 ∈ ℂ)
19	18	sqsqrtd 15419	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → ((√‘𝐴)↑2) = 𝐴)
20	19	oveq2d 7433	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃 pCnt ((√‘𝐴)↑2)) = (𝑃 pCnt 𝐴))
21		2cnd 12320	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 2 ∈ ℂ)
22		simpr 483	. . . . . . . . . . . . . . . 16 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘𝐴) ∈ ℕ)
23	5, 22	pccld 16819	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃 pCnt (√‘𝐴)) ∈ ℕ₀)
24	23	nn0cnd 12564	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃 pCnt (√‘𝐴)) ∈ ℂ)
25	21, 24	mulcomd 11265	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (2 · (𝑃 pCnt (√‘𝐴))) = ((𝑃 pCnt (√‘𝐴)) · 2))
26	13, 20, 25	3eqtr3rd 2774	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → ((𝑃 pCnt (√‘𝐴)) · 2) = (𝑃 pCnt 𝐴))
27	26	oveq2d 7433	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃↑((𝑃 pCnt (√‘𝐴)) · 2)) = (𝑃↑(𝑃 pCnt 𝐴)))
28		prmnn 16645	. . . . . . . . . . . . . 14 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℕ)
29	5, 28	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 𝑃 ∈ ℕ)
30	29	nncnd 12258	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 𝑃 ∈ ℂ)
31		2nn0 12519	. . . . . . . . . . . . 13 ⊢ 2 ∈ ℕ₀
32	31	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 2 ∈ ℕ₀)
33	30, 32, 23	expmuld 14146	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃↑((𝑃 pCnt (√‘𝐴)) · 2)) = ((𝑃↑(𝑃 pCnt (√‘𝐴)))↑2))
34	27, 33	eqtr3d 2767	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) = ((𝑃↑(𝑃 pCnt (√‘𝐴)))↑2))
35	34	fveq2d 6898	. . . . . . . . 9 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘(𝑃↑(𝑃 pCnt 𝐴))) = (√‘((𝑃↑(𝑃 pCnt (√‘𝐴)))↑2)))
36	29, 23	nnexpcld 14240	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃↑(𝑃 pCnt (√‘𝐴))) ∈ ℕ)
37	36	nnrpd 13046	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃↑(𝑃 pCnt (√‘𝐴))) ∈ ℝ⁺)
38	37	rprege0d 13055	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → ((𝑃↑(𝑃 pCnt (√‘𝐴))) ∈ ℝ ∧ 0 ≤ (𝑃↑(𝑃 pCnt (√‘𝐴)))))
39		sqrtsq 15249	. . . . . . . . . 10 ⊢ (((𝑃↑(𝑃 pCnt (√‘𝐴))) ∈ ℝ ∧ 0 ≤ (𝑃↑(𝑃 pCnt (√‘𝐴)))) → (√‘((𝑃↑(𝑃 pCnt (√‘𝐴)))↑2)) = (𝑃↑(𝑃 pCnt (√‘𝐴))))
40	38, 39	syl 17	. . . . . . . . 9 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘((𝑃↑(𝑃 pCnt (√‘𝐴)))↑2)) = (𝑃↑(𝑃 pCnt (√‘𝐴))))
41	35, 40	eqtrd 2765	. . . . . . . 8 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘(𝑃↑(𝑃 pCnt 𝐴))) = (𝑃↑(𝑃 pCnt (√‘𝐴))))
42	41, 36	eqeltrd 2825	. . . . . . 7 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ)
43	42	iftrued 4537	. . . . . 6 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0) = 1)
44		rpvmasum.z	. . . . . . . 8 ⊢ 𝑍 = (ℤ/nℤ‘𝑁)
45		rpvmasum.l	. . . . . . . 8 ⊢ 𝐿 = (ℤRHom‘𝑍)
46		rpvmasum.a	. . . . . . . 8 ⊢ (𝜑 → 𝑁 ∈ ℕ)
47		rpvmasum2.g	. . . . . . . 8 ⊢ 𝐺 = (DChr‘𝑁)
48		rpvmasum2.d	. . . . . . . 8 ⊢ 𝐷 = (Base‘𝐺)
49		rpvmasum2.1	. . . . . . . 8 ⊢ 1 = (0_g‘𝐺)
50		dchrisum0f.f	. . . . . . . 8 ⊢ 𝐹 = (𝑏 ∈ ℕ ↦ Σ𝑣 ∈ {𝑞 ∈ ℕ ∣ 𝑞 ∥ 𝑏} (𝑋‘(𝐿‘𝑣)))
51		dchrisum0f.x	. . . . . . . 8 ⊢ (𝜑 → 𝑋 ∈ 𝐷)
52		dchrisum0flb.r	. . . . . . . 8 ⊢ (𝜑 → 𝑋:(Base‘𝑍)⟶ℝ)
53	4, 16	pccld 16819	. . . . . . . 8 ⊢ (𝜑 → (𝑃 pCnt 𝐴) ∈ ℕ₀)
54	44, 45, 46, 47, 48, 49, 50, 51, 52, 4, 53	dchrisum0flblem1 27472	. . . . . . 7 ⊢ (𝜑 → if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0) ≤ (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))))
55	54	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0) ≤ (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))))
56	43, 55	eqbrtrrd 5172	. . . . 5 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 1 ≤ (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))))
57		pcdvds 16833	. . . . . . . . . . . . 13 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴)
58	4, 16, 57	syl2anc 582	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴)
59	4, 28	syl 17	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑃 ∈ ℕ)
60	59, 53	nnexpcld 14240	. . . . . . . . . . . . 13 ⊢ (𝜑 → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ)
61		nndivdvds 16240	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ ℕ ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ) → ((𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴 ↔ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ))
62	16, 60, 61	syl2anc 582	. . . . . . . . . . . 12 ⊢ (𝜑 → ((𝑃↑(𝑃 pCnt 𝐴)) ∥ 𝐴 ↔ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ))
63	58, 62	mpbid 231	. . . . . . . . . . 11 ⊢ (𝜑 → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ)
64	63	nnzd 12615	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℤ)
65	64	adantr 479	. . . . . . . . 9 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℤ)
66	16	adantr 479	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 𝐴 ∈ ℕ)
67	66	nnrpd 13046	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 𝐴 ∈ ℝ⁺)
68	67	rprege0d 13055	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝐴 ∈ ℝ ∧ 0 ≤ 𝐴))
69	60	adantr 479	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℕ)
70	69	nnrpd 13046	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℝ⁺)
71		sqrtdiv 15245	. . . . . . . . . . 11 ⊢ (((𝐴 ∈ ℝ ∧ 0 ≤ 𝐴) ∧ (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℝ⁺) → (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = ((√‘𝐴) / (√‘(𝑃↑(𝑃 pCnt 𝐴)))))
72	68, 70, 71	syl2anc 582	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = ((√‘𝐴) / (√‘(𝑃↑(𝑃 pCnt 𝐴)))))
73		nnz 12609	. . . . . . . . . . 11 ⊢ ((√‘𝐴) ∈ ℕ → (√‘𝐴) ∈ ℤ)
74		znq 12966	. . . . . . . . . . 11 ⊢ (((√‘𝐴) ∈ ℤ ∧ (√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ) → ((√‘𝐴) / (√‘(𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℚ)
75	73, 42, 74	syl2an2 684	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → ((√‘𝐴) / (√‘(𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℚ)
76	72, 75	eqeltrd 2825	. . . . . . . . 9 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℚ)
77		zsqrtelqelz 16730	. . . . . . . . 9 ⊢ (((𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℤ ∧ (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℚ) → (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℤ)
78	65, 76, 77	syl2anc 582	. . . . . . . 8 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℤ)
79	63	adantr 479	. . . . . . . . . 10 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ)
80	79	nnrpd 13046	. . . . . . . . 9 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℝ⁺)
81	80	sqrtgt0d 15392	. . . . . . . 8 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 0 < (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))
82		elnnz 12598	. . . . . . . 8 ⊢ ((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ ↔ ((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℤ ∧ 0 < (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
83	78, 81, 82	sylanbrc 581	. . . . . . 7 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ)
84	83	iftrued 4537	. . . . . 6 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0) = 1)
85		fveq2 6894	. . . . . . . . . . 11 ⊢ (𝑦 = (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) → (√‘𝑦) = (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))
86	85	eleq1d 2810	. . . . . . . . . 10 ⊢ (𝑦 = (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) → ((√‘𝑦) ∈ ℕ ↔ (√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ))
87	86	ifbid 4552	. . . . . . . . 9 ⊢ (𝑦 = (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) → if((√‘𝑦) ∈ ℕ, 1, 0) = if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0))
88		fveq2 6894	. . . . . . . . 9 ⊢ (𝑦 = (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) → (𝐹‘𝑦) = (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))
89	87, 88	breq12d 5161	. . . . . . . 8 ⊢ (𝑦 = (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) → (if((√‘𝑦) ∈ ℕ, 1, 0) ≤ (𝐹‘𝑦) ↔ if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0) ≤ (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
90		dchrisum0flb.4	. . . . . . . 8 ⊢ (𝜑 → ∀𝑦 ∈ (1..^𝐴)if((√‘𝑦) ∈ ℕ, 1, 0) ≤ (𝐹‘𝑦))
91		nnuz 12895	. . . . . . . . . 10 ⊢ ℕ = (ℤ_≥‘1)
92	63, 91	eleqtrdi 2835	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ (ℤ_≥‘1))
93	16	nnzd 12615	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℤ)
94	59	nnred 12257	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ ℝ)
95		dchrisum0flb.3	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑃 ∥ 𝐴)
96		pcelnn 16839	. . . . . . . . . . . . . 14 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → ((𝑃 pCnt 𝐴) ∈ ℕ ↔ 𝑃 ∥ 𝐴))
97	4, 16, 96	syl2anc 582	. . . . . . . . . . . . 13 ⊢ (𝜑 → ((𝑃 pCnt 𝐴) ∈ ℕ ↔ 𝑃 ∥ 𝐴))
98	95, 97	mpbird 256	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃 pCnt 𝐴) ∈ ℕ)
99		prmuz2 16667	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ (ℤ_≥‘2))
100		eluz2gt1 12934	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ (ℤ_≥‘2) → 1 < 𝑃)
101	4, 99, 100	3syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → 1 < 𝑃)
102		expgt1 14098	. . . . . . . . . . . 12 ⊢ ((𝑃 ∈ ℝ ∧ (𝑃 pCnt 𝐴) ∈ ℕ ∧ 1 < 𝑃) → 1 < (𝑃↑(𝑃 pCnt 𝐴)))
103	94, 98, 101, 102	syl3anc 1368	. . . . . . . . . . 11 ⊢ (𝜑 → 1 < (𝑃↑(𝑃 pCnt 𝐴)))
104		1red 11245	. . . . . . . . . . . 12 ⊢ (𝜑 → 1 ∈ ℝ)
105		0lt1 11766	. . . . . . . . . . . . 13 ⊢ 0 < 1
106	105	a1i 11	. . . . . . . . . . . 12 ⊢ (𝜑 → 0 < 1)
107	60	nnred 12257	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℝ)
108	60	nngt0d 12291	. . . . . . . . . . . 12 ⊢ (𝜑 → 0 < (𝑃↑(𝑃 pCnt 𝐴)))
109	16	nnred 12257	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝐴 ∈ ℝ)
110	16	nngt0d 12291	. . . . . . . . . . . 12 ⊢ (𝜑 → 0 < 𝐴)
111		ltdiv2 12130	. . . . . . . . . . . 12 ⊢ (((1 ∈ ℝ ∧ 0 < 1) ∧ ((𝑃↑(𝑃 pCnt 𝐴)) ∈ ℝ ∧ 0 < (𝑃↑(𝑃 pCnt 𝐴))) ∧ (𝐴 ∈ ℝ ∧ 0 < 𝐴)) → (1 < (𝑃↑(𝑃 pCnt 𝐴)) ↔ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) < (𝐴 / 1)))
112	104, 106, 107, 108, 109, 110, 111	syl222anc 1383	. . . . . . . . . . 11 ⊢ (𝜑 → (1 < (𝑃↑(𝑃 pCnt 𝐴)) ↔ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) < (𝐴 / 1)))
113	103, 112	mpbid 231	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) < (𝐴 / 1))
114	17	div1d 12012	. . . . . . . . . 10 ⊢ (𝜑 → (𝐴 / 1) = 𝐴)
115	113, 114	breqtrd 5174	. . . . . . . . 9 ⊢ (𝜑 → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) < 𝐴)
116		elfzo2 13667	. . . . . . . . 9 ⊢ ((𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ (1..^𝐴) ↔ ((𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ (ℤ_≥‘1) ∧ 𝐴 ∈ ℤ ∧ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) < 𝐴))
117	92, 93, 115, 116	syl3anbrc 1340	. . . . . . . 8 ⊢ (𝜑 → (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ (1..^𝐴))
118	89, 90, 117	rspcdva 3608	. . . . . . 7 ⊢ (𝜑 → if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0) ≤ (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))
119	118	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0) ≤ (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))
120	84, 119	eqbrtrrd 5172	. . . . 5 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 1 ≤ (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))
121		1re 11244	. . . . . . . 8 ⊢ 1 ∈ ℝ
122		0le1 11767	. . . . . . . 8 ⊢ 0 ≤ 1
123	121, 122	pm3.2i 469	. . . . . . 7 ⊢ (1 ∈ ℝ ∧ 0 ≤ 1)
124	123	a1i 11	. . . . . 6 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (1 ∈ ℝ ∧ 0 ≤ 1))
125	44, 45, 46, 47, 48, 49, 50, 51, 52	dchrisum0ff 27471	. . . . . . . 8 ⊢ (𝜑 → 𝐹:ℕ⟶ℝ)
126	125, 60	ffvelcdmd 7092	. . . . . . 7 ⊢ (𝜑 → (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℝ)
127	126	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℝ)
128	125, 63	ffvelcdmd 7092	. . . . . . 7 ⊢ (𝜑 → (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℝ)
129	128	adantr 479	. . . . . 6 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℝ)
130		lemul12a 12102	. . . . . 6 ⊢ ((((1 ∈ ℝ ∧ 0 ≤ 1) ∧ (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℝ) ∧ ((1 ∈ ℝ ∧ 0 ≤ 1) ∧ (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℝ)) → ((1 ≤ (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) ∧ 1 ≤ (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))) → (1 · 1) ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))))
131	124, 127, 124, 129, 130	syl22anc 837	. . . . 5 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → ((1 ≤ (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) ∧ 1 ≤ (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))) → (1 · 1) ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))))
132	56, 120, 131	mp2and 697	. . . 4 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → (1 · 1) ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
133	3, 132	eqbrtrrid 5184	. . 3 ⊢ ((𝜑 ∧ (√‘𝐴) ∈ ℕ) → 1 ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
134		0red 11247	. . . . . 6 ⊢ (𝜑 → 0 ∈ ℝ)
135		0re 11246	. . . . . . . 8 ⊢ 0 ∈ ℝ
136	121, 135	ifcli 4576	. . . . . . 7 ⊢ if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0) ∈ ℝ
137	136	a1i 11	. . . . . 6 ⊢ (𝜑 → if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0) ∈ ℝ)
138		breq2 5152	. . . . . . . 8 ⊢ (1 = if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0) → (0 ≤ 1 ↔ 0 ≤ if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0)))
139		breq2 5152	. . . . . . . 8 ⊢ (0 = if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0) → (0 ≤ 0 ↔ 0 ≤ if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0)))
140		0le0 12343	. . . . . . . 8 ⊢ 0 ≤ 0
141	138, 139, 122, 140	keephyp 4600	. . . . . . 7 ⊢ 0 ≤ if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0)
142	141	a1i 11	. . . . . 6 ⊢ (𝜑 → 0 ≤ if((√‘(𝑃↑(𝑃 pCnt 𝐴))) ∈ ℕ, 1, 0))
143	134, 137, 126, 142, 54	letrd 11401	. . . . 5 ⊢ (𝜑 → 0 ≤ (𝐹‘(𝑃↑(𝑃 pCnt 𝐴))))
144	121, 135	ifcli 4576	. . . . . . 7 ⊢ if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0) ∈ ℝ
145	144	a1i 11	. . . . . 6 ⊢ (𝜑 → if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0) ∈ ℝ)
146		breq2 5152	. . . . . . . 8 ⊢ (1 = if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0) → (0 ≤ 1 ↔ 0 ≤ if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0)))
147		breq2 5152	. . . . . . . 8 ⊢ (0 = if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0) → (0 ≤ 0 ↔ 0 ≤ if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0)))
148	146, 147, 122, 140	keephyp 4600	. . . . . . 7 ⊢ 0 ≤ if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0)
149	148	a1i 11	. . . . . 6 ⊢ (𝜑 → 0 ≤ if((√‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) ∈ ℕ, 1, 0))
150	134, 145, 128, 149, 118	letrd 11401	. . . . 5 ⊢ (𝜑 → 0 ≤ (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))))
151	126, 128, 143, 150	mulge0d 11821	. . . 4 ⊢ (𝜑 → 0 ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
152	151	adantr 479	. . 3 ⊢ ((𝜑 ∧ ¬ (√‘𝐴) ∈ ℕ) → 0 ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
153	1, 2, 133, 152	ifbothda 4567	. 2 ⊢ (𝜑 → if((√‘𝐴) ∈ ℕ, 1, 0) ≤ ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
154	60	nncnd 12258	. . . . 5 ⊢ (𝜑 → (𝑃↑(𝑃 pCnt 𝐴)) ∈ ℂ)
155	60	nnne0d 12292	. . . . 5 ⊢ (𝜑 → (𝑃↑(𝑃 pCnt 𝐴)) ≠ 0)
156	17, 154, 155	divcan2d 12022	. . . 4 ⊢ (𝜑 → ((𝑃↑(𝑃 pCnt 𝐴)) · (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 𝐴)
157	156	fveq2d 6898	. . 3 ⊢ (𝜑 → (𝐹‘((𝑃↑(𝑃 pCnt 𝐴)) · (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))) = (𝐹‘𝐴))
158		pcndvds2 16837	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ 𝐴 ∈ ℕ) → ¬ 𝑃 ∥ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))
159	4, 16, 158	syl2anc 582	. . . . . 6 ⊢ (𝜑 → ¬ 𝑃 ∥ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))
160		coprm 16682	. . . . . . 7 ⊢ ((𝑃 ∈ ℙ ∧ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℤ) → (¬ 𝑃 ∥ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ↔ (𝑃 gcd (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 1))
161	4, 64, 160	syl2anc 582	. . . . . 6 ⊢ (𝜑 → (¬ 𝑃 ∥ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ↔ (𝑃 gcd (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 1))
162	159, 161	mpbid 231	. . . . 5 ⊢ (𝜑 → (𝑃 gcd (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 1)
163		prmz 16646	. . . . . . 7 ⊢ (𝑃 ∈ ℙ → 𝑃 ∈ ℤ)
164	4, 163	syl 17	. . . . . 6 ⊢ (𝜑 → 𝑃 ∈ ℤ)
165		rpexp1i 16695	. . . . . 6 ⊢ ((𝑃 ∈ ℤ ∧ (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))) ∈ ℤ ∧ (𝑃 pCnt 𝐴) ∈ ℕ₀) → ((𝑃 gcd (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 1 → ((𝑃↑(𝑃 pCnt 𝐴)) gcd (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 1))
166	164, 64, 53, 165	syl3anc 1368	. . . . 5 ⊢ (𝜑 → ((𝑃 gcd (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 1 → ((𝑃↑(𝑃 pCnt 𝐴)) gcd (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 1))
167	162, 166	mpd 15	. . . 4 ⊢ (𝜑 → ((𝑃↑(𝑃 pCnt 𝐴)) gcd (𝐴 / (𝑃↑(𝑃 pCnt 𝐴)))) = 1)
168	44, 45, 46, 47, 48, 49, 50, 51, 60, 63, 167	dchrisum0fmul 27470	. . 3 ⊢ (𝜑 → (𝐹‘((𝑃↑(𝑃 pCnt 𝐴)) · (𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))) = ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
169	157, 168	eqtr3d 2767	. 2 ⊢ (𝜑 → (𝐹‘𝐴) = ((𝐹‘(𝑃↑(𝑃 pCnt 𝐴))) · (𝐹‘(𝐴 / (𝑃↑(𝑃 pCnt 𝐴))))))
170	153, 169	breqtrrd 5176	1 ⊢ (𝜑 → if((√‘𝐴) ∈ ℕ, 1, 0) ≤ (𝐹‘𝐴))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ≠ wne 2930 ∀wral 3051 {crab 3419 ifcif 4529 class class class wbr 5148 ↦ cmpt 5231 ⟶wf 6543 ‘cfv 6547 (class class class)co 7417 ℂcc 11136 ℝcr 11137 0cc0 11138 1c1 11139 · cmul 11143 < clt 11278 ≤ cle 11279 / cdiv 11901 ℕcn 12242 2c2 12297 ℕ₀cn0 12502 ℤcz 12588 ℤ_≥cuz 12852 ℚcq 12962 ℝ⁺crp 13006 ..^cfzo 13659 ↑cexp 14059 √csqrt 15213 Σcsu 15665 ∥ cdvds 16231 gcd cgcd 16469 ℙcprime 16642 pCnt cpc 16805 Basecbs 17180 0_gc0g 17421 ℤRHomczrh 21430 ℤ/nℤczn 21433 DChrcdchr 27196

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 ax-inf2 9664 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 ax-pre-sup 11216 ax-addf 11217 ax-mulf 11218

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3965 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4909 df-int 4950 df-iun 4998 df-iin 4999 df-disj 5114 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-se 5633 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-isom 6556 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-of 7683 df-om 7870 df-1st 7992 df-2nd 7993 df-supp 8164 df-tpos 8230 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-2o 8486 df-oadd 8489 df-omul 8490 df-er 8723 df-ec 8725 df-qs 8729 df-map 8845 df-pm 8846 df-ixp 8915 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-fsupp 9386 df-fi 9434 df-sup 9465 df-inf 9466 df-oi 9533 df-card 9962 df-acn 9965 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-div 11902 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-dec 12708 df-uz 12853 df-q 12963 df-rp 13007 df-xneg 13124 df-xadd 13125 df-xmul 13126 df-ioo 13360 df-ioc 13361 df-ico 13362 df-icc 13363 df-fz 13517 df-fzo 13660 df-fl 13790 df-mod 13868 df-seq 14000 df-exp 14060 df-fac 14266 df-bc 14295 df-hash 14323 df-shft 15047 df-cj 15079 df-re 15080 df-im 15081 df-sqrt 15215 df-abs 15216 df-limsup 15448 df-clim 15465 df-rlim 15466 df-sum 15666 df-ef 16044 df-sin 16046 df-cos 16047 df-pi 16049 df-dvds 16232 df-gcd 16470 df-prm 16643 df-numer 16707 df-denom 16708 df-pc 16806 df-struct 17116 df-sets 17133 df-slot 17151 df-ndx 17163 df-base 17181 df-ress 17210 df-plusg 17246 df-mulr 17247 df-starv 17248 df-sca 17249 df-vsca 17250 df-ip 17251 df-tset 17252 df-ple 17253 df-ds 17255 df-unif 17256 df-hom 17257 df-cco 17258 df-rest 17404 df-topn 17405 df-0g 17423 df-gsum 17424 df-topgen 17425 df-pt 17426 df-prds 17429 df-xrs 17484 df-qtop 17489 df-imas 17490 df-qus 17491 df-xps 17492 df-mre 17566 df-mrc 17567 df-acs 17569 df-mgm 18600 df-sgrp 18679 df-mnd 18695 df-mhm 18740 df-submnd 18741 df-grp 18898 df-minusg 18899 df-sbg 18900 df-mulg 19029 df-subg 19083 df-nsg 19084 df-eqg 19085 df-ghm 19173 df-cntz 19273 df-od 19488 df-cmn 19742 df-abl 19743 df-mgp 20080 df-rng 20098 df-ur 20127 df-ring 20180 df-cring 20181 df-oppr 20278 df-dvdsr 20301 df-unit 20302 df-invr 20332 df-dvr 20345 df-rhm 20416 df-subrng 20488 df-subrg 20513 df-drng 20631 df-lmod 20750 df-lss 20821 df-lsp 20861 df-sra 21063 df-rgmod 21064 df-lidl 21109 df-rsp 21110 df-2idl 21149 df-psmet 21276 df-xmet 21277 df-met 21278 df-bl 21279 df-mopn 21280 df-fbas 21281 df-fg 21282 df-cnfld 21285 df-zring 21378 df-zrh 21434 df-zn 21437 df-top 22827 df-topon 22844 df-topsp 22866 df-bases 22880 df-cld 22954 df-ntr 22955 df-cls 22956 df-nei 23033 df-lp 23071 df-perf 23072 df-cn 23162 df-cnp 23163 df-haus 23250 df-tx 23497 df-hmeo 23690 df-fil 23781 df-fm 23873 df-flim 23874 df-flf 23875 df-xms 24257 df-ms 24258 df-tms 24259 df-cncf 24829 df-limc 25826 df-dv 25827 df-log 26521 df-cxp 26522 df-dchr 27197

This theorem is referenced by: dchrisum0flb 27474

W3C validator