etransclem22 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > etransclem22		Structured version Visualization version GIF version

Theorem etransclem22 47265

Description: The 𝑁-th derivative of 𝐻 is continuous. (Contributed by Glauco Siliprandi, 5-Apr-2020.)

**Hypotheses**
Ref	Expression
etransclem22.s	⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
etransclem22.x	⊢ (𝜑 → 𝑋 ∈ ((TopOpen‘ℂ_fld) ↾_t 𝑆))
etransclem22.p	⊢ (𝜑 → 𝑃 ∈ ℕ)
etransclem22.h	⊢ 𝐻 = (𝑗 ∈ (0...𝑀) ↦ (𝑥 ∈ 𝑋 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
etransclem22.J	⊢ (𝜑 → 𝐽 ∈ (0...𝑀))
etransclem22.n	⊢ (𝜑 → 𝑁 ∈ ℕ₀)

**Assertion**
Ref	Expression
etransclem22	⊢ (𝜑 → ((𝑆 D^𝑛 (𝐻‘𝐽))‘𝑁) ∈ (𝑋–cn→ℂ))

Distinct variable groups: 𝑗,𝐽,𝑥 𝑗,𝑀,𝑥 𝑥,𝑁 𝑃,𝑗,𝑥 𝑥,𝑆 𝑗,𝑋,𝑥 𝜑,𝑗,𝑥 Allowed substitution hints: 𝑆(𝑗) 𝐻(𝑥, 𝑗) 𝑁(𝑗)

Proof of Theorem etransclem22 Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		etransclem22.s	. . 3 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
2		etransclem22.x	. . 3 ⊢ (𝜑 → 𝑋 ∈ ((TopOpen‘ℂ_fld) ↾_t 𝑆))
3		etransclem22.p	. . 3 ⊢ (𝜑 → 𝑃 ∈ ℕ)
4		etransclem22.h	. . 3 ⊢ 𝐻 = (𝑗 ∈ (0...𝑀) ↦ (𝑥 ∈ 𝑋 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
5		etransclem22.J	. . 3 ⊢ (𝜑 → 𝐽 ∈ (0...𝑀))
6		etransclem22.n	. . 3 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
7	1, 2, 3, 4, 5, 6	etransclem17 47260	. 2 ⊢ (𝜑 → ((𝑆 D^𝑛 (𝐻‘𝐽))‘𝑁) = (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))))
8		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁)
9	8	iftrued 4490	. . . . 5 ⊢ ((𝜑 ∧ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) = 0)
10	9	mpteq2dv 5199	. . . 4 ⊢ ((𝜑 ∧ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))) = (𝑥 ∈ 𝑋 ↦ 0))
11	1, 2	dvdmsscn 46945	. . . . . 6 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
12		0cnd 11299	. . . . . 6 ⊢ (𝜑 → 0 ∈ ℂ)
13		ssid 3953	. . . . . . 7 ⊢ ℂ ⊆ ℂ
14	13	a1i 11	. . . . . 6 ⊢ (𝜑 → ℂ ⊆ ℂ)
15	11, 12, 14	constcncfg 46881	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 0) ∈ (𝑋–cn→ℂ))
16	15	adantr 486	. . . 4 ⊢ ((𝜑 ∧ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 ∈ 𝑋 ↦ 0) ∈ (𝑋–cn→ℂ))
17	10, 16	eqeltrd 2861	. . 3 ⊢ ((𝜑 ∧ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))) ∈ (𝑋–cn→ℂ))
18		simpr 490	. . . . . 6 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁)
19	18	iffalsed 4493	. . . . 5 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) = (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))
20	19	mpteq2dv 5199	. . . 4 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))) = (𝑥 ∈ 𝑋 ↦ (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))))
21		nfv 1947	. . . . 5 ⊢ Ⅎ𝑥(𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁)
22	11, 14	idcncfg 46882	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝑥) ∈ (𝑋–cn→ℂ))
23	5	elfzelzd 13657	. . . . . . . . 9 ⊢ (𝜑 → 𝐽 ∈ ℤ)
24	23	zcnd 12804	. . . . . . . 8 ⊢ (𝜑 → 𝐽 ∈ ℂ)
25	11, 24, 14	constcncfg 46881	. . . . . . 7 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ 𝐽) ∈ (𝑋–cn→ℂ))
26	22, 25	subcncf 25766	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ (𝑥 − 𝐽)) ∈ (𝑋–cn→ℂ))
27	26	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 ∈ 𝑋 ↦ (𝑥 − 𝐽)) ∈ (𝑋–cn→ℂ))
28	13	a1i 11	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ℂ ⊆ ℂ)
29		nnm1nn0 12647	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ₀)
30	3, 29	syl 18	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃 − 1) ∈ ℕ₀)
31	3	nnnn0d 12667	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ ℕ₀)
32	30, 31	ifcld 4529	. . . . . . . . . . 11 ⊢ (𝜑 → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℕ₀)
33	32	faccld 14428	. . . . . . . . . 10 ⊢ (𝜑 → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℕ)
34	33	nncnd 12351	. . . . . . . . 9 ⊢ (𝜑 → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℂ)
35	34	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℂ)
36	32	nn0zd 12718	. . . . . . . . . . . . 13 ⊢ (𝜑 → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℤ)
37	6	nn0zd 12718	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑁 ∈ ℤ)
38	36, 37	zsubcld 12808	. . . . . . . . . . . 12 ⊢ (𝜑 → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ)
39	38	adantr 486	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ)
40	6	nn0red 12668	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑁 ∈ ℝ)
41	40	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → 𝑁 ∈ ℝ)
42	32	nn0red 12668	. . . . . . . . . . . . . 14 ⊢ (𝜑 → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℝ)
43	42	adantr 486	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℝ)
44	41, 43, 18	nltled 11460	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → 𝑁 ≤ if(𝐽 = 0, (𝑃 − 1), 𝑃))
45	43, 41	subge0d 11906	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (0 ≤ (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ↔ 𝑁 ≤ if(𝐽 = 0, (𝑃 − 1), 𝑃)))
46	44, 45	mpbird 260	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → 0 ≤ (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))
47		elnn0z 12706	. . . . . . . . . . 11 ⊢ ((if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀ ↔ ((if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ ∧ 0 ≤ (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))
48	39, 46, 47	sylanbrc 595	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀)
49	48	faccld 14428	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ∈ ℕ)
50	49	nncnd 12351	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ∈ ℂ)
51	49	nnne0d 12388	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ≠ 0)
52	35, 50, 51	divcld 12093	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) ∈ ℂ)
53	28, 52, 28	constcncfg 46881	. . . . . 6 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑦 ∈ ℂ ↦ ((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) ∈ (ℂ–cn→ℂ))
54		expcncf 25247	. . . . . . 7 ⊢ ((if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀ → (𝑦 ∈ ℂ ↦ (𝑦↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) ∈ (ℂ–cn→ℂ))
55	48, 54	syl 18	. . . . . 6 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑦 ∈ ℂ ↦ (𝑦↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) ∈ (ℂ–cn→ℂ))
56	53, 55	mulcncf 25767	. . . . 5 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑦 ∈ ℂ ↦ (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · (𝑦↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) ∈ (ℂ–cn→ℂ))
57		oveq1 7427	. . . . . 6 ⊢ (𝑦 = (𝑥 − 𝐽) → (𝑦↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) = ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))
58	57	oveq2d 7436	. . . . 5 ⊢ (𝑦 = (𝑥 − 𝐽) → (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · (𝑦↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) = (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))
59	21, 27, 56, 28, 58	cncfcompt2 25229	. . . 4 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 ∈ 𝑋 ↦ (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) ∈ (𝑋–cn→ℂ))
60	20, 59	eqeltrd 2861	. . 3 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))) ∈ (𝑋–cn→ℂ))
61	17, 60	pm2.61dan 825	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))) ∈ (𝑋–cn→ℂ))
62	7, 61	eqeltrd 2861	1 ⊢ (𝜑 → ((𝑆 D^𝑛 (𝐻‘𝐽))‘𝑁) ∈ (𝑋–cn→ℂ))

Colors of variables: wff setvar class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ifcif 4482 {cpr 4586 class class class wbr 5103 ↦ cmpt 5186 ‘cfv 6538 (class class class)co 7420 ℂcc 11198 ℝcr 11199 0cc0 11200 1c1 11201 · cmul 11205 < clt 11343 ≤ cle 11344 − cmin 11541 / cdiv 11973 ℕcn 12335 ℕ₀cn0 12606 ℤcz 12693 ...cfz 13639 ↑cexp 14204 !cfa 14417 ↾_t crest 17591 TopOpenctopn 17592 ℂ_fldccnfld 21678 –cn→ccncf 25197 D^𝑛 cdvn 26184

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-icc 13483 df-fz 13640 df-fzo 13789 df-seq 14145 df-exp 14205 df-fac 14418 df-hash 14475 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 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-dvn 26188

This theorem is used by: etransclem34 47277

W3C validator