cncfmet - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > cncfmet		GIF version

Theorem cncfmet 14049

Description: Relate complex function continuity to metric space continuity. (Contributed by Paul Chapman, 26-Nov-2007.) (Revised by Mario Carneiro, 7-Sep-2015.)

**Hypotheses**
Ref	Expression
cncfmet.1	⊢ 𝐶 = ((abs ∘ − ) ↾ (𝐴 × 𝐴))
cncfmet.2	⊢ 𝐷 = ((abs ∘ − ) ↾ (𝐵 × 𝐵))
cncfmet.3	⊢ 𝐽 = (MetOpen‘𝐶)
cncfmet.4	⊢ 𝐾 = (MetOpen‘𝐷)

**Assertion**
Ref	Expression
cncfmet	⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐴–cn→𝐵) = (𝐽 Cn 𝐾))

Proof of Theorem cncfmet Dummy variables 𝑤 𝑓 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simplll 533	. . . . . . . . . . . 12 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝐴 ⊆ ℂ)
2		simprl 529	. . . . . . . . . . . 12 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝑥 ∈ 𝐴)
3		simprr 531	. . . . . . . . . . . 12 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝑤 ∈ 𝐴)
4		cncfmet.1	. . . . . . . . . . . . . . . 16 ⊢ 𝐶 = ((abs ∘ − ) ↾ (𝐴 × 𝐴))
5	4	oveqi 5887	. . . . . . . . . . . . . . 15 ⊢ (𝑥𝐶𝑤) = (𝑥((abs ∘ − ) ↾ (𝐴 × 𝐴))𝑤)
6		ovres 6013	. . . . . . . . . . . . . . 15 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) → (𝑥((abs ∘ − ) ↾ (𝐴 × 𝐴))𝑤) = (𝑥(abs ∘ − )𝑤))
7	5, 6	eqtrid 2222	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴) → (𝑥𝐶𝑤) = (𝑥(abs ∘ − )𝑤))
8	7	ad2ant2l 508	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ ℂ ∧ 𝑥 ∈ 𝐴) ∧ (𝐴 ⊆ ℂ ∧ 𝑤 ∈ 𝐴)) → (𝑥𝐶𝑤) = (𝑥(abs ∘ − )𝑤))
9		ssel2 3150	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℂ ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ ℂ)
10		ssel2 3150	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ⊆ ℂ ∧ 𝑤 ∈ 𝐴) → 𝑤 ∈ ℂ)
11		eqid 2177	. . . . . . . . . . . . . . 15 ⊢ (abs ∘ − ) = (abs ∘ − )
12	11	cnmetdval 13999	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ ℂ ∧ 𝑤 ∈ ℂ) → (𝑥(abs ∘ − )𝑤) = (abs‘(𝑥 − 𝑤)))
13	9, 10, 12	syl2an 289	. . . . . . . . . . . . 13 ⊢ (((𝐴 ⊆ ℂ ∧ 𝑥 ∈ 𝐴) ∧ (𝐴 ⊆ ℂ ∧ 𝑤 ∈ 𝐴)) → (𝑥(abs ∘ − )𝑤) = (abs‘(𝑥 − 𝑤)))
14	8, 13	eqtrd 2210	. . . . . . . . . . . 12 ⊢ (((𝐴 ⊆ ℂ ∧ 𝑥 ∈ 𝐴) ∧ (𝐴 ⊆ ℂ ∧ 𝑤 ∈ 𝐴)) → (𝑥𝐶𝑤) = (abs‘(𝑥 − 𝑤)))
15	1, 2, 1, 3, 14	syl22anc 1239	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑥𝐶𝑤) = (abs‘(𝑥 − 𝑤)))
16	15	breq1d 4013	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑥𝐶𝑤) < 𝑧 ↔ (abs‘(𝑥 − 𝑤)) < 𝑧))
17		ffvelcdm 5649	. . . . . . . . . . . . . 14 ⊢ ((𝑓:𝐴⟶𝐵 ∧ 𝑥 ∈ 𝐴) → (𝑓‘𝑥) ∈ 𝐵)
18	17	ad2ant2lr 510	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑓‘𝑥) ∈ 𝐵)
19		ffvelcdm 5649	. . . . . . . . . . . . . 14 ⊢ ((𝑓:𝐴⟶𝐵 ∧ 𝑤 ∈ 𝐴) → (𝑓‘𝑤) ∈ 𝐵)
20	19	ad2ant2l 508	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑓‘𝑤) ∈ 𝐵)
21		cncfmet.2	. . . . . . . . . . . . . . 15 ⊢ 𝐷 = ((abs ∘ − ) ↾ (𝐵 × 𝐵))
22	21	oveqi 5887	. . . . . . . . . . . . . 14 ⊢ ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) = ((𝑓‘𝑥)((abs ∘ − ) ↾ (𝐵 × 𝐵))(𝑓‘𝑤))
23		ovres 6013	. . . . . . . . . . . . . 14 ⊢ (((𝑓‘𝑥) ∈ 𝐵 ∧ (𝑓‘𝑤) ∈ 𝐵) → ((𝑓‘𝑥)((abs ∘ − ) ↾ (𝐵 × 𝐵))(𝑓‘𝑤)) = ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑤)))
24	22, 23	eqtrid 2222	. . . . . . . . . . . . 13 ⊢ (((𝑓‘𝑥) ∈ 𝐵 ∧ (𝑓‘𝑤) ∈ 𝐵) → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) = ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑤)))
25	18, 20, 24	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) = ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑤)))
26		simpllr 534	. . . . . . . . . . . . . 14 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → 𝐵 ⊆ ℂ)
27	26, 18	sseldd 3156	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑓‘𝑥) ∈ ℂ)
28	26, 20	sseldd 3156	. . . . . . . . . . . . 13 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (𝑓‘𝑤) ∈ ℂ)
29	11	cnmetdval 13999	. . . . . . . . . . . . 13 ⊢ (((𝑓‘𝑥) ∈ ℂ ∧ (𝑓‘𝑤) ∈ ℂ) → ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑤)) = (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))))
30	27, 28, 29	syl2anc 411	. . . . . . . . . . . 12 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑓‘𝑥)(abs ∘ − )(𝑓‘𝑤)) = (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))))
31	25, 30	eqtrd 2210	. . . . . . . . . . 11 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) = (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))))
32	31	breq1d 4013	. . . . . . . . . 10 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦 ↔ (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦))
33	16, 32	imbi12d 234	. . . . . . . . 9 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ (𝑥 ∈ 𝐴 ∧ 𝑤 ∈ 𝐴)) → (((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦) ↔ ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
34	33	anassrs 400	. . . . . . . 8 ⊢ (((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ 𝑥 ∈ 𝐴) ∧ 𝑤 ∈ 𝐴) → (((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦) ↔ ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
35	34	ralbidva 2473	. . . . . . 7 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ 𝑥 ∈ 𝐴) → (∀𝑤 ∈ 𝐴 ((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦) ↔ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
36	35	rexbidv 2478	. . . . . 6 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ 𝑥 ∈ 𝐴) → (∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦) ↔ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
37	36	ralbidv 2477	. . . . 5 ⊢ ((((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) ∧ 𝑥 ∈ 𝐴) → (∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦) ↔ ∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
38	37	ralbidva 2473	. . . 4 ⊢ (((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) ∧ 𝑓:𝐴⟶𝐵) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦)))
39	38	pm5.32da 452	. . 3 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → ((𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦)) ↔ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦))))
40		cnxmet 14001	. . . . . 6 ⊢ (abs ∘ − ) ∈ (∞Met‘ℂ)
41		xmetres2 13849	. . . . . 6 ⊢ (((abs ∘ − ) ∈ (∞Met‘ℂ) ∧ 𝐴 ⊆ ℂ) → ((abs ∘ − ) ↾ (𝐴 × 𝐴)) ∈ (∞Met‘𝐴))
42	40, 41	mpan 424	. . . . 5 ⊢ (𝐴 ⊆ ℂ → ((abs ∘ − ) ↾ (𝐴 × 𝐴)) ∈ (∞Met‘𝐴))
43	4, 42	eqeltrid 2264	. . . 4 ⊢ (𝐴 ⊆ ℂ → 𝐶 ∈ (∞Met‘𝐴))
44		xmetres2 13849	. . . . . 6 ⊢ (((abs ∘ − ) ∈ (∞Met‘ℂ) ∧ 𝐵 ⊆ ℂ) → ((abs ∘ − ) ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵))
45	40, 44	mpan 424	. . . . 5 ⊢ (𝐵 ⊆ ℂ → ((abs ∘ − ) ↾ (𝐵 × 𝐵)) ∈ (∞Met‘𝐵))
46	21, 45	eqeltrid 2264	. . . 4 ⊢ (𝐵 ⊆ ℂ → 𝐷 ∈ (∞Met‘𝐵))
47		cncfmet.3	. . . . 5 ⊢ 𝐽 = (MetOpen‘𝐶)
48		cncfmet.4	. . . . 5 ⊢ 𝐾 = (MetOpen‘𝐷)
49	47, 48	metcn 13984	. . . 4 ⊢ ((𝐶 ∈ (∞Met‘𝐴) ∧ 𝐷 ∈ (∞Met‘𝐵)) → (𝑓 ∈ (𝐽 Cn 𝐾) ↔ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦))))
50	43, 46, 49	syl2an 289	. . 3 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝑓 ∈ (𝐽 Cn 𝐾) ↔ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((𝑥𝐶𝑤) < 𝑧 → ((𝑓‘𝑥)𝐷(𝑓‘𝑤)) < 𝑦))))
51		elcncf 14030	. . 3 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝑓 ∈ (𝐴–cn→𝐵) ↔ (𝑓:𝐴⟶𝐵 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ ℝ⁺ ∃𝑧 ∈ ℝ⁺ ∀𝑤 ∈ 𝐴 ((abs‘(𝑥 − 𝑤)) < 𝑧 → (abs‘((𝑓‘𝑥) − (𝑓‘𝑤))) < 𝑦))))
52	39, 50, 51	3bitr4rd 221	. 2 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝑓 ∈ (𝐴–cn→𝐵) ↔ 𝑓 ∈ (𝐽 Cn 𝐾)))
53	52	eqrdv 2175	1 ⊢ ((𝐴 ⊆ ℂ ∧ 𝐵 ⊆ ℂ) → (𝐴–cn→𝐵) = (𝐽 Cn 𝐾))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1353 ∈ wcel 2148 ∀wral 2455 ∃wrex 2456 ⊆ wss 3129 class class class wbr 4003 × cxp 4624 ↾ cres 4628 ∘ ccom 4630 ⟶wf 5212 ‘cfv 5216 (class class class)co 5874 ℂcc 7808 < clt 7991 − cmin 8127 ℝ⁺crp 9652 abscabs 11005 ∞Metcxmet 13410 MetOpencmopn 13415 Cn ccn 13655 –cn→ccncf 14027

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4118 ax-sep 4121 ax-nul 4129 ax-pow 4174 ax-pr 4209 ax-un 4433 ax-setind 4536 ax-iinf 4587 ax-cnex 7901 ax-resscn 7902 ax-1cn 7903 ax-1re 7904 ax-icn 7905 ax-addcl 7906 ax-addrcl 7907 ax-mulcl 7908 ax-mulrcl 7909 ax-addcom 7910 ax-mulcom 7911 ax-addass 7912 ax-mulass 7913 ax-distr 7914 ax-i2m1 7915 ax-0lt1 7916 ax-1rid 7917 ax-0id 7918 ax-rnegex 7919 ax-precex 7920 ax-cnre 7921 ax-pre-ltirr 7922 ax-pre-ltwlin 7923 ax-pre-lttrn 7924 ax-pre-apti 7925 ax-pre-ltadd 7926 ax-pre-mulgt0 7927 ax-pre-mulext 7928 ax-arch 7929 ax-caucvg 7930

This theorem depends on definitions: df-bi 117 df-stab 831 df-dc 835 df-3or 979 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ne 2348 df-nel 2443 df-ral 2460 df-rex 2461 df-reu 2462 df-rmo 2463 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-if 3535 df-pw 3577 df-sn 3598 df-pr 3599 df-op 3601 df-uni 3810 df-int 3845 df-iun 3888 df-br 4004 df-opab 4065 df-mpt 4066 df-tr 4102 df-id 4293 df-po 4296 df-iso 4297 df-iord 4366 df-on 4368 df-ilim 4369 df-suc 4371 df-iom 4590 df-xp 4632 df-rel 4633 df-cnv 4634 df-co 4635 df-dm 4636 df-rn 4637 df-res 4638 df-ima 4639 df-iota 5178 df-fun 5218 df-fn 5219 df-f 5220 df-f1 5221 df-fo 5222 df-f1o 5223 df-fv 5224 df-isom 5225 df-riota 5830 df-ov 5877 df-oprab 5878 df-mpo 5879 df-1st 6140 df-2nd 6141 df-recs 6305 df-frec 6391 df-map 6649 df-sup 6982 df-inf 6983 df-pnf 7993 df-mnf 7994 df-xr 7995 df-ltxr 7996 df-le 7997 df-sub 8129 df-neg 8130 df-reap 8531 df-ap 8538 df-div 8629 df-inn 8919 df-2 8977 df-3 8978 df-4 8979 df-n0 9176 df-z 9253 df-uz 9528 df-q 9619 df-rp 9653 df-xneg 9771 df-xadd 9772 df-seqfrec 10445 df-exp 10519 df-cj 10850 df-re 10851 df-im 10852 df-rsqrt 11006 df-abs 11007 df-topgen 12708 df-psmet 13417 df-xmet 13418 df-met 13419 df-bl 13420 df-mopn 13421 df-top 13468 df-topon 13481 df-bases 13513 df-cn 13658 df-cnp 13659 df-cncf 14028

This theorem is referenced by: cncfcncntop 14050

W3C validator