dvnfre - Metamath Proof Explorer

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

Theorem dvnfre 24551

Description: The 𝑁-th derivative of a real function is real. (Contributed by Mario Carneiro, 1-Jan-2017.)

**Assertion**
Ref	Expression
dvnfre	⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ ∧ 𝑁 ∈ ℕ₀) → ((ℝ D^𝑛 𝐹)‘𝑁):dom ((ℝ D^𝑛 𝐹)‘𝑁)⟶ℝ)

Proof of Theorem dvnfre Dummy variables 𝑥 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6672	. . . . . 6 ⊢ (𝑥 = 0 → ((ℝ D^𝑛 𝐹)‘𝑥) = ((ℝ D^𝑛 𝐹)‘0))
2	1	dmeqd 5776	. . . . . 6 ⊢ (𝑥 = 0 → dom ((ℝ D^𝑛 𝐹)‘𝑥) = dom ((ℝ D^𝑛 𝐹)‘0))
3	1, 2	feq12d 6504	. . . . 5 ⊢ (𝑥 = 0 → (((ℝ D^𝑛 𝐹)‘𝑥):dom ((ℝ D^𝑛 𝐹)‘𝑥)⟶ℝ ↔ ((ℝ D^𝑛 𝐹)‘0):dom ((ℝ D^𝑛 𝐹)‘0)⟶ℝ))
4	3	imbi2d 343	. . . 4 ⊢ (𝑥 = 0 → (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘𝑥):dom ((ℝ D^𝑛 𝐹)‘𝑥)⟶ℝ) ↔ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘0):dom ((ℝ D^𝑛 𝐹)‘0)⟶ℝ)))
5		fveq2 6672	. . . . . 6 ⊢ (𝑥 = 𝑛 → ((ℝ D^𝑛 𝐹)‘𝑥) = ((ℝ D^𝑛 𝐹)‘𝑛))
6	5	dmeqd 5776	. . . . . 6 ⊢ (𝑥 = 𝑛 → dom ((ℝ D^𝑛 𝐹)‘𝑥) = dom ((ℝ D^𝑛 𝐹)‘𝑛))
7	5, 6	feq12d 6504	. . . . 5 ⊢ (𝑥 = 𝑛 → (((ℝ D^𝑛 𝐹)‘𝑥):dom ((ℝ D^𝑛 𝐹)‘𝑥)⟶ℝ ↔ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ))
8	7	imbi2d 343	. . . 4 ⊢ (𝑥 = 𝑛 → (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘𝑥):dom ((ℝ D^𝑛 𝐹)‘𝑥)⟶ℝ) ↔ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)))
9		fveq2 6672	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → ((ℝ D^𝑛 𝐹)‘𝑥) = ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)))
10	9	dmeqd 5776	. . . . . 6 ⊢ (𝑥 = (𝑛 + 1) → dom ((ℝ D^𝑛 𝐹)‘𝑥) = dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)))
11	9, 10	feq12d 6504	. . . . 5 ⊢ (𝑥 = (𝑛 + 1) → (((ℝ D^𝑛 𝐹)‘𝑥):dom ((ℝ D^𝑛 𝐹)‘𝑥)⟶ℝ ↔ ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)):dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1))⟶ℝ))
12	11	imbi2d 343	. . . 4 ⊢ (𝑥 = (𝑛 + 1) → (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘𝑥):dom ((ℝ D^𝑛 𝐹)‘𝑥)⟶ℝ) ↔ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)):dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1))⟶ℝ)))
13		fveq2 6672	. . . . . 6 ⊢ (𝑥 = 𝑁 → ((ℝ D^𝑛 𝐹)‘𝑥) = ((ℝ D^𝑛 𝐹)‘𝑁))
14	13	dmeqd 5776	. . . . . 6 ⊢ (𝑥 = 𝑁 → dom ((ℝ D^𝑛 𝐹)‘𝑥) = dom ((ℝ D^𝑛 𝐹)‘𝑁))
15	13, 14	feq12d 6504	. . . . 5 ⊢ (𝑥 = 𝑁 → (((ℝ D^𝑛 𝐹)‘𝑥):dom ((ℝ D^𝑛 𝐹)‘𝑥)⟶ℝ ↔ ((ℝ D^𝑛 𝐹)‘𝑁):dom ((ℝ D^𝑛 𝐹)‘𝑁)⟶ℝ))
16	15	imbi2d 343	. . . 4 ⊢ (𝑥 = 𝑁 → (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘𝑥):dom ((ℝ D^𝑛 𝐹)‘𝑥)⟶ℝ) ↔ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘𝑁):dom ((ℝ D^𝑛 𝐹)‘𝑁)⟶ℝ)))
17		simpl 485	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → 𝐹:𝐴⟶ℝ)
18		ax-resscn 10596	. . . . . . 7 ⊢ ℝ ⊆ ℂ
19		fss 6529	. . . . . . . . 9 ⊢ ((𝐹:𝐴⟶ℝ ∧ ℝ ⊆ ℂ) → 𝐹:𝐴⟶ℂ)
20	18, 19	mpan2 689	. . . . . . . 8 ⊢ (𝐹:𝐴⟶ℝ → 𝐹:𝐴⟶ℂ)
21		cnex 10620	. . . . . . . . 9 ⊢ ℂ ∈ V
22		reex 10630	. . . . . . . . 9 ⊢ ℝ ∈ V
23		elpm2r 8426	. . . . . . . . 9 ⊢ (((ℂ ∈ V ∧ ℝ ∈ V) ∧ (𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ)) → 𝐹 ∈ (ℂ ↑_pm ℝ))
24	21, 22, 23	mpanl12 700	. . . . . . . 8 ⊢ ((𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ ℝ) → 𝐹 ∈ (ℂ ↑_pm ℝ))
25	20, 24	sylan 582	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → 𝐹 ∈ (ℂ ↑_pm ℝ))
26		dvn0 24523	. . . . . . 7 ⊢ ((ℝ ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑_pm ℝ)) → ((ℝ D^𝑛 𝐹)‘0) = 𝐹)
27	18, 25, 26	sylancr 589	. . . . . 6 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘0) = 𝐹)
28	27	dmeqd 5776	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → dom ((ℝ D^𝑛 𝐹)‘0) = dom 𝐹)
29		fdm 6524	. . . . . . . 8 ⊢ (𝐹:𝐴⟶ℝ → dom 𝐹 = 𝐴)
30	29	adantr 483	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → dom 𝐹 = 𝐴)
31	28, 30	eqtrd 2858	. . . . . 6 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → dom ((ℝ D^𝑛 𝐹)‘0) = 𝐴)
32	27, 31	feq12d 6504	. . . . 5 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → (((ℝ D^𝑛 𝐹)‘0):dom ((ℝ D^𝑛 𝐹)‘0)⟶ℝ ↔ 𝐹:𝐴⟶ℝ))
33	17, 32	mpbird 259	. . . 4 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘0):dom ((ℝ D^𝑛 𝐹)‘0)⟶ℝ)
34		simprr 771	. . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)
35	22	prid1 4700	. . . . . . . . . . . 12 ⊢ ℝ ∈ {ℝ, ℂ}
36		simprl 769	. . . . . . . . . . . 12 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → 𝑛 ∈ ℕ₀)
37		dvnbss 24527	. . . . . . . . . . . 12 ⊢ ((ℝ ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm ℝ) ∧ 𝑛 ∈ ℕ₀) → dom ((ℝ D^𝑛 𝐹)‘𝑛) ⊆ dom 𝐹)
38	35, 25, 36, 37	mp3an2ani 1464	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → dom ((ℝ D^𝑛 𝐹)‘𝑛) ⊆ dom 𝐹)
39	30	adantr 483	. . . . . . . . . . 11 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → dom 𝐹 = 𝐴)
40	38, 39	sseqtrd 4009	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → dom ((ℝ D^𝑛 𝐹)‘𝑛) ⊆ 𝐴)
41		simplr 767	. . . . . . . . . 10 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → 𝐴 ⊆ ℝ)
42	40, 41	sstrd 3979	. . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → dom ((ℝ D^𝑛 𝐹)‘𝑛) ⊆ ℝ)
43		dvfre 24550	. . . . . . . . 9 ⊢ ((((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ ∧ dom ((ℝ D^𝑛 𝐹)‘𝑛) ⊆ ℝ) → (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛)):dom (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛))⟶ℝ)
44	34, 42, 43	syl2anc 586	. . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛)):dom (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛))⟶ℝ)
45		dvnp1 24524	. . . . . . . . . 10 ⊢ ((ℝ ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑_pm ℝ) ∧ 𝑛 ∈ ℕ₀) → ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)) = (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛)))
46	18, 25, 36, 45	mp3an2ani 1464	. . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)) = (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛)))
47	46	dmeqd 5776	. . . . . . . . 9 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)) = dom (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛)))
48	46, 47	feq12d 6504	. . . . . . . 8 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → (((ℝ D^𝑛 𝐹)‘(𝑛 + 1)):dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1))⟶ℝ ↔ (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛)):dom (ℝ D ((ℝ D^𝑛 𝐹)‘𝑛))⟶ℝ))
49	44, 48	mpbird 259	. . . . . . 7 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ (𝑛 ∈ ℕ₀ ∧ ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ)) → ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)):dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1))⟶ℝ)
50	49	expr 459	. . . . . 6 ⊢ (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) ∧ 𝑛 ∈ ℕ₀) → (((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ → ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)):dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1))⟶ℝ))
51	50	expcom 416	. . . . 5 ⊢ (𝑛 ∈ ℕ₀ → ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → (((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ → ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)):dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1))⟶ℝ)))
52	51	a2d 29	. . . 4 ⊢ (𝑛 ∈ ℕ₀ → (((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘𝑛):dom ((ℝ D^𝑛 𝐹)‘𝑛)⟶ℝ) → ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘(𝑛 + 1)):dom ((ℝ D^𝑛 𝐹)‘(𝑛 + 1))⟶ℝ)))
53	4, 8, 12, 16, 33, 52	nn0ind 12080	. . 3 ⊢ (𝑁 ∈ ℕ₀ → ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → ((ℝ D^𝑛 𝐹)‘𝑁):dom ((ℝ D^𝑛 𝐹)‘𝑁)⟶ℝ))
54	53	com12 32	. 2 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ) → (𝑁 ∈ ℕ₀ → ((ℝ D^𝑛 𝐹)‘𝑁):dom ((ℝ D^𝑛 𝐹)‘𝑁)⟶ℝ))
55	54	3impia 1113	1 ⊢ ((𝐹:𝐴⟶ℝ ∧ 𝐴 ⊆ ℝ ∧ 𝑁 ∈ ℕ₀) → ((ℝ D^𝑛 𝐹)‘𝑁):dom ((ℝ D^𝑛 𝐹)‘𝑁)⟶ℝ)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ⊆ wss 3938 {cpr 4571 dom cdm 5557 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ↑_pm cpm 8409 ℂcc 10537 ℝcr 10538 0cc0 10539 1c1 10540 + caddc 10542 ℕ₀cn0 11900 D cdv 24463 D^𝑛 cdvn 24464

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-inf2 9106 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-pm 8411 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-fi 8877 df-sup 8908 df-inf 8909 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-q 12352 df-rp 12393 df-xneg 12510 df-xadd 12511 df-xmul 12512 df-ioo 12745 df-icc 12748 df-fz 12896 df-seq 13373 df-exp 13433 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-plusg 16580 df-mulr 16581 df-starv 16582 df-tset 16586 df-ple 16587 df-ds 16589 df-unif 16590 df-rest 16698 df-topn 16699 df-topgen 16719 df-psmet 20539 df-xmet 20540 df-met 20541 df-bl 20542 df-mopn 20543 df-fbas 20544 df-fg 20545 df-cnfld 20548 df-top 21504 df-topon 21521 df-topsp 21543 df-bases 21556 df-cld 21629 df-ntr 21630 df-cls 21631 df-nei 21708 df-lp 21746 df-perf 21747 df-cn 21837 df-cnp 21838 df-haus 21925 df-fil 22456 df-fm 22548 df-flim 22549 df-flf 22550 df-xms 22932 df-ms 22933 df-cncf 23488 df-limc 24466 df-dv 24467 df-dvn 24468

This theorem is referenced by: taylthlem2 24964

W3C validator