| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > chordthm | Structured version Visualization version GIF version | ||
| Description: The intersecting chords theorem. If points A, B, C, and D lie on a circle (with center Q, say), and the point P is on the interior of the segments AB and CD, then the two products of lengths PA · PB and PC · PD are equal. The Euclidean plane is identified with the complex plane, and the fact that P is on AB and on CD is expressed by the hypothesis that the angles APB and CPD are equal to π. The result is proven by using chordthmlem5 26967 twice to show that PA · PB and PC · PD both equal BQ 2 − PQ 2 . This is similar to the proof of the theorem given in Euclid's Elements, where it is Proposition III.35. This is Metamath 100 proof #55. (Contributed by David Moews, 28-Feb-2017.) |
| Ref | Expression |
|---|---|
| chordthm.angdef | ⊢ 𝐹 = (𝑥 ∈ (ℂ ∖ {0}), 𝑦 ∈ (ℂ ∖ {0}) ↦ (ℑ‘(log‘(𝑦 / 𝑥)))) |
| chordthm.A | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| chordthm.B | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| chordthm.C | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| chordthm.D | ⊢ (𝜑 → 𝐷 ∈ ℂ) |
| chordthm.P | ⊢ (𝜑 → 𝑃 ∈ ℂ) |
| chordthm.AneP | ⊢ (𝜑 → 𝐴 ≠ 𝑃) |
| chordthm.BneP | ⊢ (𝜑 → 𝐵 ≠ 𝑃) |
| chordthm.CneP | ⊢ (𝜑 → 𝐶 ≠ 𝑃) |
| chordthm.DneP | ⊢ (𝜑 → 𝐷 ≠ 𝑃) |
| chordthm.APB | ⊢ (𝜑 → ((𝐴 − 𝑃)𝐹(𝐵 − 𝑃)) = π) |
| chordthm.CPD | ⊢ (𝜑 → ((𝐶 − 𝑃)𝐹(𝐷 − 𝑃)) = π) |
| chordthm.Q | ⊢ (𝜑 → 𝑄 ∈ ℂ) |
| chordthm.ABcirc | ⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐵 − 𝑄))) |
| chordthm.ACcirc | ⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐶 − 𝑄))) |
| chordthm.ADcirc | ⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐷 − 𝑄))) |
| Ref | Expression |
|---|---|
| chordthm | ⊢ (𝜑 → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = ((abs‘(𝑃 − 𝐶)) · (abs‘(𝑃 − 𝐷)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | chordthm.CPD | . . 3 ⊢ (𝜑 → ((𝐶 − 𝑃)𝐹(𝐷 − 𝑃)) = π) | |
| 2 | chordthm.angdef | . . . 4 ⊢ 𝐹 = (𝑥 ∈ (ℂ ∖ {0}), 𝑦 ∈ (ℂ ∖ {0}) ↦ (ℑ‘(log‘(𝑦 / 𝑥)))) | |
| 3 | chordthm.C | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
| 4 | chordthm.P | . . . 4 ⊢ (𝜑 → 𝑃 ∈ ℂ) | |
| 5 | chordthm.D | . . . 4 ⊢ (𝜑 → 𝐷 ∈ ℂ) | |
| 6 | chordthm.CneP | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 𝑃) | |
| 7 | chordthm.DneP | . . . . 5 ⊢ (𝜑 → 𝐷 ≠ 𝑃) | |
| 8 | 7 | necomd 3019 | . . . 4 ⊢ (𝜑 → 𝑃 ≠ 𝐷) |
| 9 | 2, 3, 4, 5, 6, 8 | angpieqvd 26962 | . . 3 ⊢ (𝜑 → (((𝐶 − 𝑃)𝐹(𝐷 − 𝑃)) = π ↔ ∃𝑣 ∈ (0(,)1)𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) |
| 10 | 1, 9 | mpbid 235 | . 2 ⊢ (𝜑 → ∃𝑣 ∈ (0(,)1)𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷))) |
| 11 | chordthm.APB | . . . . 5 ⊢ (𝜑 → ((𝐴 − 𝑃)𝐹(𝐵 − 𝑃)) = π) | |
| 12 | chordthm.A | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
| 13 | chordthm.B | . . . . . 6 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
| 14 | chordthm.AneP | . . . . . 6 ⊢ (𝜑 → 𝐴 ≠ 𝑃) | |
| 15 | chordthm.BneP | . . . . . . 7 ⊢ (𝜑 → 𝐵 ≠ 𝑃) | |
| 16 | 15 | necomd 3019 | . . . . . 6 ⊢ (𝜑 → 𝑃 ≠ 𝐵) |
| 17 | 2, 12, 4, 13, 14, 16 | angpieqvd 26962 | . . . . 5 ⊢ (𝜑 → (((𝐴 − 𝑃)𝐹(𝐵 − 𝑃)) = π ↔ ∃𝑤 ∈ (0(,)1)𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) |
| 18 | 11, 17 | mpbid 235 | . . . 4 ⊢ (𝜑 → ∃𝑤 ∈ (0(,)1)𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵))) |
| 19 | 18 | adantr 485 | . . 3 ⊢ ((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) → ∃𝑤 ∈ (0(,)1)𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵))) |
| 20 | chordthm.ABcirc | . . . . . . . 8 ⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐵 − 𝑄))) | |
| 21 | 20 | ad2antrr 738 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐵 − 𝑄))) |
| 22 | chordthm.ADcirc | . . . . . . . 8 ⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐷 − 𝑄))) | |
| 23 | 22 | ad2antrr 738 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐷 − 𝑄))) |
| 24 | 21, 23 | eqtr3d 2806 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → (abs‘(𝐵 − 𝑄)) = (abs‘(𝐷 − 𝑄))) |
| 25 | 24 | oveq1d 7426 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → ((abs‘(𝐵 − 𝑄))↑2) = ((abs‘(𝐷 − 𝑄))↑2)) |
| 26 | 25 | oveq1d 7426 | . . . 4 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → (((abs‘(𝐵 − 𝑄))↑2) − ((abs‘(𝑃 − 𝑄))↑2)) = (((abs‘(𝐷 − 𝑄))↑2) − ((abs‘(𝑃 − 𝑄))↑2))) |
| 27 | 12 | ad2antrr 738 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝐴 ∈ ℂ) |
| 28 | 13 | ad2antrr 738 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝐵 ∈ ℂ) |
| 29 | chordthm.Q | . . . . . 6 ⊢ (𝜑 → 𝑄 ∈ ℂ) | |
| 30 | 29 | ad2antrr 738 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝑄 ∈ ℂ) |
| 31 | ioossicc 13460 | . . . . . 6 ⊢ (0(,)1) ⊆ (0[,]1) | |
| 32 | simprl 782 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝑤 ∈ (0(,)1)) | |
| 33 | 31, 32 | sselid 3943 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝑤 ∈ (0[,]1)) |
| 34 | simprr 784 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵))) | |
| 35 | 27, 28, 30, 33, 34, 21 | chordthmlem5 26967 | . . . 4 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = (((abs‘(𝐵 − 𝑄))↑2) − ((abs‘(𝑃 − 𝑄))↑2))) |
| 36 | 3 | ad2antrr 738 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝐶 ∈ ℂ) |
| 37 | 5 | ad2antrr 738 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝐷 ∈ ℂ) |
| 38 | simplrl 788 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝑣 ∈ (0(,)1)) | |
| 39 | 31, 38 | sselid 3943 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝑣 ∈ (0[,]1)) |
| 40 | simplrr 789 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷))) | |
| 41 | chordthm.ACcirc | . . . . . . 7 ⊢ (𝜑 → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐶 − 𝑄))) | |
| 42 | 41 | ad2antrr 738 | . . . . . 6 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → (abs‘(𝐴 − 𝑄)) = (abs‘(𝐶 − 𝑄))) |
| 43 | 42, 23 | eqtr3d 2806 | . . . . 5 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → (abs‘(𝐶 − 𝑄)) = (abs‘(𝐷 − 𝑄))) |
| 44 | 36, 37, 30, 39, 40, 43 | chordthmlem5 26967 | . . . 4 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → ((abs‘(𝑃 − 𝐶)) · (abs‘(𝑃 − 𝐷))) = (((abs‘(𝐷 − 𝑄))↑2) − ((abs‘(𝑃 − 𝑄))↑2))) |
| 45 | 26, 35, 44 | 3eqtr4d 2814 | . . 3 ⊢ (((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) ∧ (𝑤 ∈ (0(,)1) ∧ 𝑃 = ((𝑤 · 𝐴) + ((1 − 𝑤) · 𝐵)))) → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = ((abs‘(𝑃 − 𝐶)) · (abs‘(𝑃 − 𝐷)))) |
| 46 | 19, 45 | rexlimddv 3178 | . 2 ⊢ ((𝜑 ∧ (𝑣 ∈ (0(,)1) ∧ 𝑃 = ((𝑣 · 𝐶) + ((1 − 𝑣) · 𝐷)))) → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = ((abs‘(𝑃 − 𝐶)) · (abs‘(𝑃 − 𝐷)))) |
| 47 | 10, 46 | rexlimddv 3178 | 1 ⊢ (𝜑 → ((abs‘(𝑃 − 𝐴)) · (abs‘(𝑃 − 𝐵))) = ((abs‘(𝑃 − 𝐶)) · (abs‘(𝑃 − 𝐷)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ≠ wne 2964 ∃wrex 3095 ∖ cdif 3910 {csn 4594 ‘cfv 6537 (class class class)co 7411 ∈ cmpo 7413 ℂcc 11098 0cc0 11100 1c1 11101 + caddc 11103 · cmul 11105 − cmin 11441 / cdiv 11871 2c2 12295 (,)cioo 13372 [,]cicc 13375 ↑cexp 14097 ℑcim 15149 abscabs 15285 πcpi 16120 logclog 26685 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-inf2 9610 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 ax-pre-sup 11178 ax-addf 11179 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-of 7675 df-om 7863 df-1st 7986 df-2nd 7987 df-supp 8157 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-er 8694 df-map 8826 df-pm 8827 df-ixp 8896 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-fsupp 9322 df-fi 9371 df-sup 9402 df-inf 9403 df-oi 9472 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-div 11872 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-dec 12712 df-uz 12863 df-q 12973 df-rp 13017 df-xneg 13137 df-xadd 13138 df-xmul 13139 df-ioo 13376 df-ioc 13377 df-ico 13378 df-icc 13379 df-fz 13536 df-fzo 13683 df-fl 13825 df-mod 13903 df-seq 14038 df-exp 14098 df-fac 14310 df-bc 14339 df-hash 14367 df-shft 15104 df-cj 15150 df-re 15151 df-im 15152 df-sqrt 15286 df-abs 15287 df-limsup 15522 df-clim 15539 df-rlim 15540 df-sum 15738 df-ef 16121 df-sin 16123 df-cos 16124 df-pi 16126 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-mulr 17324 df-starv 17325 df-sca 17326 df-vsca 17327 df-ip 17328 df-tset 17329 df-ple 17330 df-ds 17332 df-unif 17333 df-hom 17334 df-cco 17335 df-rest 17475 df-topn 17476 df-0g 17494 df-gsum 17495 df-topgen 17496 df-pt 17497 df-prds 17500 df-xrs 17556 df-qtop 17561 df-imas 17562 df-xps 17564 df-mre 17638 df-mrc 17639 df-acs 17641 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-submnd 18842 df-mulg 19134 df-cntz 19387 df-cmn 19852 df-psmet 21483 df-xmet 21484 df-met 21485 df-bl 21486 df-mopn 21487 df-fbas 21488 df-fg 21489 df-cnfld 21492 df-top 23020 df-topon 23037 df-topsp 23059 df-bases 23072 df-cld 23145 df-ntr 23146 df-cls 23147 df-nei 23224 df-lp 23262 df-perf 23263 df-cn 23353 df-cnp 23354 df-haus 23441 df-tx 23688 df-hmeo 23881 df-fil 23972 df-fm 24064 df-flim 24065 df-flf 24066 df-xms 24446 df-ms 24447 df-tms 24448 df-cncf 25006 df-limc 25994 df-dv 25995 df-log 26687 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |