etransclem20 - Mathbox for Glauco Siliprandi

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

Theorem etransclem20 45565

Description: 𝐻 is smooth. (Contributed by Glauco Siliprandi, 5-Apr-2020.)

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

**Assertion**
Ref	Expression
etransclem20	⊢ (𝜑 → ((𝑆 D^𝑛 (𝐻‘𝐽))‘𝑁):𝑋⟶ℂ)

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

**Proof of Theorem etransclem20**
Step	Hyp	Ref	Expression
1		iftrue 4530	. . . . . 6 ⊢ (if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁 → if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) = 0)
2		0cnd 11229	. . . . . 6 ⊢ (if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁 → 0 ∈ ℂ)
3	1, 2	eqeltrd 2828	. . . . 5 ⊢ (if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁 → if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) ∈ ℂ)
4	3	adantl 481	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) ∈ ℂ)
5		simpr 484	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁)
6	5	iffalsed 4535	. . . . 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), 𝑃) − 𝑁))))
7		etransclem20.p	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑃 ∈ ℕ)
8		nnm1nn0 12535	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ₀)
9	7, 8	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃 − 1) ∈ ℕ₀)
10	7	nnnn0d 12554	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ ℕ₀)
11	9, 10	ifcld 4570	. . . . . . . . . . 11 ⊢ (𝜑 → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℕ₀)
12	11	faccld 14267	. . . . . . . . . 10 ⊢ (𝜑 → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℕ)
13	12	nncnd 12250	. . . . . . . . 9 ⊢ (𝜑 → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℂ)
14	13	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℂ)
15	11	nn0zd 12606	. . . . . . . . . . . . 13 ⊢ (𝜑 → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℤ)
16		etransclem20.n	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
17	16	nn0zd 12606	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑁 ∈ ℤ)
18	15, 17	zsubcld 12693	. . . . . . . . . . . 12 ⊢ (𝜑 → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ)
19	18	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ)
20	16	nn0red 12555	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑁 ∈ ℝ)
21	20	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → 𝑁 ∈ ℝ)
22	11	nn0red 12555	. . . . . . . . . . . . . 14 ⊢ (𝜑 → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℝ)
23	22	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℝ)
24		simpr 484	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁)
25	21, 23, 24	nltled 11386	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → 𝑁 ≤ if(𝐽 = 0, (𝑃 − 1), 𝑃))
26	23, 21	subge0d 11826	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (0 ≤ (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ↔ 𝑁 ≤ if(𝐽 = 0, (𝑃 − 1), 𝑃)))
27	25, 26	mpbird 257	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → 0 ≤ (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))
28		elnn0z 12593	. . . . . . . . . . 11 ⊢ ((if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀ ↔ ((if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ ∧ 0 ≤ (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))
29	19, 27, 28	sylanbrc 582	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀)
30	29	faccld 14267	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ∈ ℕ)
31	30	nncnd 12250	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ∈ ℂ)
32	30	nnne0d 12284	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ≠ 0)
33	14, 31, 32	divcld 12012	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) ∈ ℂ)
34	33	adantlr 714	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) ∈ ℂ)
35		etransclem20.s	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 ∈ {ℝ, ℂ})
36		etransclem20.x	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ∈ ((TopOpen‘ℂ_fld) ↾_t 𝑆))
37	35, 36	dvdmsscn 45247	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
38	37	sselda 3978	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ ℂ)
39		etransclem20.J	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ (0...𝑀))
40		elfzelz 13525	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (0...𝑀) → 𝐽 ∈ ℤ)
41	40	zcnd 12689	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (0...𝑀) → 𝐽 ∈ ℂ)
42	39, 41	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ ℂ)
43	42	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐽 ∈ ℂ)
44	38, 43	subcld 11593	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑥 − 𝐽) ∈ ℂ)
45	44	adantr 480	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 − 𝐽) ∈ ℂ)
46	29	adantlr 714	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀)
47	45, 46	expcld 14134	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ∈ ℂ)
48	34, 47	mulcld 11256	. . . . 5 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) ∈ ℂ)
49	6, 48	eqeltrd 2828	. . . 4 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) ∈ ℂ)
50	4, 49	pm2.61dan 812	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) ∈ ℂ)
51		eqid 2727	. . 3 ⊢ (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))) = (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))))
52	50, 51	fmptd 7118	. 2 ⊢ (𝜑 → (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))):𝑋⟶ℂ)
53		etransclem20.h	. . . 4 ⊢ 𝐻 = (𝑗 ∈ (0...𝑀) ↦ (𝑥 ∈ 𝑋 ↦ ((𝑥 − 𝑗)↑if(𝑗 = 0, (𝑃 − 1), 𝑃))))
54	35, 36, 7, 53, 39, 16	etransclem17 45562	. . 3 ⊢ (𝜑 → ((𝑆 D^𝑛 (𝐻‘𝐽))‘𝑁) = (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))))
55	54	feq1d 6701	. 2 ⊢ (𝜑 → (((𝑆 D^𝑛 (𝐻‘𝐽))‘𝑁):𝑋⟶ℂ ↔ (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))):𝑋⟶ℂ))
56	52, 55	mpbird 257	1 ⊢ (𝜑 → ((𝑆 D^𝑛 (𝐻‘𝐽))‘𝑁):𝑋⟶ℂ)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ifcif 4524 {cpr 4626 class class class wbr 5142 ↦ cmpt 5225 ⟶wf 6538 ‘cfv 6542 (class class class)co 7414 ℂcc 11128 ℝcr 11129 0cc0 11130 1c1 11131 · cmul 11135 < clt 11270 ≤ cle 11271 − cmin 11466 / cdiv 11893 ℕcn 12234 ℕ₀cn0 12494 ℤcz 12580 ...cfz 13508 ↑cexp 14050 !cfa 14256 ↾_t crest 17393 TopOpenctopn 17394 ℂ_fldccnfld 21266 D^𝑛 cdvn 25780

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-inf2 9656 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207 ax-pre-sup 11208 ax-addf 11209

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-int 4945 df-iun 4993 df-iin 4994 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-se 5628 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-isom 6551 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-of 7679 df-om 7865 df-1st 7987 df-2nd 7988 df-supp 8160 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-2o 8481 df-er 8718 df-map 8838 df-pm 8839 df-ixp 8908 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-fsupp 9378 df-fi 9426 df-sup 9457 df-inf 9458 df-oi 9525 df-card 9954 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-div 11894 df-nn 12235 df-2 12297 df-3 12298 df-4 12299 df-5 12300 df-6 12301 df-7 12302 df-8 12303 df-9 12304 df-n0 12495 df-z 12581 df-dec 12700 df-uz 12845 df-q 12955 df-rp 12999 df-xneg 13116 df-xadd 13117 df-xmul 13118 df-icc 13355 df-fz 13509 df-fzo 13652 df-seq 13991 df-exp 14051 df-fac 14257 df-hash 14314 df-cj 15070 df-re 15071 df-im 15072 df-sqrt 15206 df-abs 15207 df-struct 17107 df-sets 17124 df-slot 17142 df-ndx 17154 df-base 17172 df-ress 17201 df-plusg 17237 df-mulr 17238 df-starv 17239 df-sca 17240 df-vsca 17241 df-ip 17242 df-tset 17243 df-ple 17244 df-ds 17246 df-unif 17247 df-hom 17248 df-cco 17249 df-rest 17395 df-topn 17396 df-0g 17414 df-gsum 17415 df-topgen 17416 df-pt 17417 df-prds 17420 df-xrs 17475 df-qtop 17480 df-imas 17481 df-xps 17483 df-mre 17557 df-mrc 17558 df-acs 17560 df-mgm 18591 df-sgrp 18670 df-mnd 18686 df-submnd 18732 df-mulg 19015 df-cntz 19259 df-cmn 19728 df-psmet 21258 df-xmet 21259 df-met 21260 df-bl 21261 df-mopn 21262 df-fbas 21263 df-fg 21264 df-cnfld 21267 df-top 22783 df-topon 22800 df-topsp 22822 df-bases 22836 df-cld 22910 df-ntr 22911 df-cls 22912 df-nei 22989 df-lp 23027 df-perf 23028 df-cn 23118 df-cnp 23119 df-haus 23206 df-tx 23453 df-hmeo 23646 df-fil 23737 df-fm 23829 df-flim 23830 df-flf 23831 df-xms 24213 df-ms 24214 df-tms 24215 df-cncf 24785 df-limc 25782 df-dv 25783 df-dvn 25784

This theorem is referenced by: etransclem27 45572 etransclem29 45574 etransclem31 45576 etransclem32 45577 etransclem33 45578 etransclem34 45579

W3C validator