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 46235

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 4482	. . . . . 6 ⊢ (if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁 → if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))) = 0)
2		0cnd 11108	. . . . . 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 4487	. . . . 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 12425	. . . . . . . . . . . . 13 ⊢ (𝑃 ∈ ℕ → (𝑃 − 1) ∈ ℕ₀)
9	7, 8	syl 17	. . . . . . . . . . . 12 ⊢ (𝜑 → (𝑃 − 1) ∈ ℕ₀)
10	7	nnnn0d 12445	. . . . . . . . . . . 12 ⊢ (𝜑 → 𝑃 ∈ ℕ₀)
11	9, 10	ifcld 4523	. . . . . . . . . . 11 ⊢ (𝜑 → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℕ₀)
12	11	faccld 14191	. . . . . . . . . 10 ⊢ (𝜑 → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℕ)
13	12	nncnd 12144	. . . . . . . . 9 ⊢ (𝜑 → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℂ)
14	13	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) ∈ ℂ)
15	11	nn0zd 12497	. . . . . . . . . . . . 13 ⊢ (𝜑 → if(𝐽 = 0, (𝑃 − 1), 𝑃) ∈ ℤ)
16		etransclem20.n	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑁 ∈ ℕ₀)
17	16	nn0zd 12497	. . . . . . . . . . . . 13 ⊢ (𝜑 → 𝑁 ∈ ℤ)
18	15, 17	zsubcld 12585	. . . . . . . . . . . 12 ⊢ (𝜑 → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ)
19	18	adantr 480	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ)
20	16	nn0red 12446	. . . . . . . . . . . . . 14 ⊢ (𝜑 → 𝑁 ∈ ℝ)
21	20	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → 𝑁 ∈ ℝ)
22	11	nn0red 12446	. . . . . . . . . . . . . 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 11266	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → 𝑁 ≤ if(𝐽 = 0, (𝑃 − 1), 𝑃))
26	23, 21	subge0d 11710	. . . . . . . . . . . 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 12484	. . . . . . . . . . 11 ⊢ ((if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀ ↔ ((if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℤ ∧ 0 ≤ (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)))
29	19, 27, 28	sylanbrc 583	. . . . . . . . . 10 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀)
30	29	faccld 14191	. . . . . . . . 9 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ∈ ℕ)
31	30	nncnd 12144	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ∈ ℂ)
32	30	nnne0d 12178	. . . . . . . 8 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ≠ 0)
33	14, 31, 32	divcld 11900	. . . . . . 7 ⊢ ((𝜑 ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) ∈ ℂ)
34	33	adantlr 715	. . . . . 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 45917	. . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ⊆ ℂ)
38	37	sselda 3935	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝑥 ∈ ℂ)
39		etransclem20.J	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐽 ∈ (0...𝑀))
40		elfzelz 13427	. . . . . . . . . . . 12 ⊢ (𝐽 ∈ (0...𝑀) → 𝐽 ∈ ℤ)
41	40	zcnd 12581	. . . . . . . . . . 11 ⊢ (𝐽 ∈ (0...𝑀) → 𝐽 ∈ ℂ)
42	39, 41	syl 17	. . . . . . . . . 10 ⊢ (𝜑 → 𝐽 ∈ ℂ)
43	42	adantr 480	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → 𝐽 ∈ ℂ)
44	38, 43	subcld 11475	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑋) → (𝑥 − 𝐽) ∈ ℂ)
45	44	adantr 480	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (𝑥 − 𝐽) ∈ ℂ)
46	29	adantlr 715	. . . . . . 7 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → (if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁) ∈ ℕ₀)
47	45, 46	expcld 14053	. . . . . 6 ⊢ (((𝜑 ∧ 𝑥 ∈ 𝑋) ∧ ¬ if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁) → ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁)) ∈ ℂ)
48	34, 47	mulcld 11135	. . . . 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 2729	. . 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 7048	. 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 46232	. . 3 ⊢ (𝜑 → ((𝑆 D^𝑛 (𝐻‘𝐽))‘𝑁) = (𝑥 ∈ 𝑋 ↦ if(if(𝐽 = 0, (𝑃 − 1), 𝑃) < 𝑁, 0, (((!‘if(𝐽 = 0, (𝑃 − 1), 𝑃)) / (!‘(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))) · ((𝑥 − 𝐽)↑(if(𝐽 = 0, (𝑃 − 1), 𝑃) − 𝑁))))))
55	54	feq1d 6634	. 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 1540 ∈ wcel 2109 ifcif 4476 {cpr 4579 class class class wbr 5092 ↦ cmpt 5173 ⟶wf 6478 ‘cfv 6482 (class class class)co 7349 ℂcc 11007 ℝcr 11008 0cc0 11009 1c1 11010 · cmul 11014 < clt 11149 ≤ cle 11150 − cmin 11347 / cdiv 11777 ℕcn 12128 ℕ₀cn0 12384 ℤcz 12471 ...cfz 13410 ↑cexp 13968 !cfa 14180 ↾_t crest 17324 TopOpenctopn 17325 ℂ_fldccnfld 21261 D^𝑛 cdvn 25763

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-icc 13255 df-fz 13411 df-fzo 13558 df-seq 13909 df-exp 13969 df-fac 14181 df-hash 14238 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 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-dvn 25767

This theorem is referenced by: etransclem27 46242 etransclem29 46244 etransclem31 46246 etransclem32 46247 etransclem33 46248 etransclem34 46249

W3C validator