metdseq0 - Metamath Proof Explorer

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

Theorem metdseq0 24895

Description: The distance from a point to a set is zero iff the point is in the closure set. (Contributed by Mario Carneiro, 14-Feb-2015.)

**Hypotheses**
Ref	Expression
metdscn.f	⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ^*, < ))
metdscn.j	⊢ 𝐽 = (MetOpen‘𝐷)

**Assertion**
Ref	Expression
metdseq0	⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴) = 0 ↔ 𝐴 ∈ ((cls‘𝐽)‘𝑆)))

Distinct variable groups: 𝑥,𝑦,𝐴 𝑥,𝐷,𝑦 𝑦,𝐽 𝑥,𝑆,𝑦 𝑥,𝑋,𝑦 Allowed substitution hints: 𝐹(𝑥,𝑦) 𝐽(𝑥)

Proof of Theorem metdseq0 Dummy variables 𝑟 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll1 1212	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → 𝐷 ∈ (∞Met‘𝑋))
2		simprl 770	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → 𝑧 ∈ 𝐽)
3		simprr 772	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → 𝐴 ∈ 𝑧)
4		metdscn.j	. . . . . . . 8 ⊢ 𝐽 = (MetOpen‘𝐷)
5	4	mopni2 24527	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧) → ∃𝑟 ∈ ℝ⁺ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)
6	1, 2, 3, 5	syl3anc 1371	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → ∃𝑟 ∈ ℝ⁺ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)
7		simprr 772	. . . . . . . 8 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)
8	7	ssrind 4265	. . . . . . 7 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ⊆ (𝑧 ∩ 𝑆))
9		rpgt0 13069	. . . . . . . . . 10 ⊢ (𝑟 ∈ ℝ⁺ → 0 < 𝑟)
10		0re 11292	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
11		rpre 13065	. . . . . . . . . . 11 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ)
12		ltnle 11369	. . . . . . . . . . 11 ⊢ ((0 ∈ ℝ ∧ 𝑟 ∈ ℝ) → (0 < 𝑟 ↔ ¬ 𝑟 ≤ 0))
13	10, 11, 12	sylancr 586	. . . . . . . . . 10 ⊢ (𝑟 ∈ ℝ⁺ → (0 < 𝑟 ↔ ¬ 𝑟 ≤ 0))
14	9, 13	mpbid 232	. . . . . . . . 9 ⊢ (𝑟 ∈ ℝ⁺ → ¬ 𝑟 ≤ 0)
15	14	ad2antrl 727	. . . . . . . 8 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → ¬ 𝑟 ≤ 0)
16		simpllr 775	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝐹‘𝐴) = 0)
17	16	breq2d 5178	. . . . . . . . . . 11 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑟 ≤ (𝐹‘𝐴) ↔ 𝑟 ≤ 0))
18	1	adantr 480	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → 𝐷 ∈ (∞Met‘𝑋))
19		simpl2 1192	. . . . . . . . . . . . 13 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝑆 ⊆ 𝑋)
20	19	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → 𝑆 ⊆ 𝑋)
21		simpl3 1193	. . . . . . . . . . . . 13 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐴 ∈ 𝑋)
22	21	ad2antrr 725	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → 𝐴 ∈ 𝑋)
23		rpxr 13066	. . . . . . . . . . . . 13 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ^*)
24	23	ad2antrl 727	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → 𝑟 ∈ ℝ^*)
25		metdscn.f	. . . . . . . . . . . . 13 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ^*, < ))
26	25	metdsge 24890	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝑟 ∈ ℝ^*) → (𝑟 ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ∅))
27	18, 20, 22, 24, 26	syl31anc 1373	. . . . . . . . . . 11 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑟 ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ∅))
28	17, 27	bitr3d 281	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑟 ≤ 0 ↔ (𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ∅))
29		incom 4230	. . . . . . . . . . 11 ⊢ (𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆)
30	29	eqeq1i 2745	. . . . . . . . . 10 ⊢ ((𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ∅ ↔ ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) = ∅)
31	28, 30	bitrdi 287	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑟 ≤ 0 ↔ ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) = ∅))
32	31	necon3bbid 2984	. . . . . . . 8 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (¬ 𝑟 ≤ 0 ↔ ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ≠ ∅))
33	15, 32	mpbid 232	. . . . . . 7 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ≠ ∅)
34		ssn0 4427	. . . . . . 7 ⊢ ((((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ⊆ (𝑧 ∩ 𝑆) ∧ ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ≠ ∅) → (𝑧 ∩ 𝑆) ≠ ∅)
35	8, 33, 34	syl2anc 583	. . . . . 6 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑧 ∩ 𝑆) ≠ ∅)
36	6, 35	rexlimddv 3167	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → (𝑧 ∩ 𝑆) ≠ ∅)
37	36	expr 456	. . . 4 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ 𝑧 ∈ 𝐽) → (𝐴 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅))
38	37	ralrimiva 3152	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → ∀𝑧 ∈ 𝐽 (𝐴 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅))
39	4	mopntopon 24470	. . . . . . 7 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
40	39	3ad2ant1 1133	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
41	40	adantr 480	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐽 ∈ (TopOn‘𝑋))
42		topontop 22940	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
43	41, 42	syl 17	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐽 ∈ Top)
44		toponuni 22941	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
45	41, 44	syl 17	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝑋 = ∪ 𝐽)
46	19, 45	sseqtrd 4049	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝑆 ⊆ ∪ 𝐽)
47	21, 45	eleqtrd 2846	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐴 ∈ ∪ 𝐽)
48		eqid 2740	. . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽
49	48	elcls 23102	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽 ∧ 𝐴 ∈ ∪ 𝐽) → (𝐴 ∈ ((cls‘𝐽)‘𝑆) ↔ ∀𝑧 ∈ 𝐽 (𝐴 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
50	43, 46, 47, 49	syl3anc 1371	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → (𝐴 ∈ ((cls‘𝐽)‘𝑆) ↔ ∀𝑧 ∈ 𝐽 (𝐴 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
51	38, 50	mpbird 257	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
52		incom 4230	. . . . . . 7 ⊢ ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) = (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴)))
53	25	metdsf 24889	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → 𝐹:𝑋⟶(0[,]+∞))
54	53	ffvelcdmda 7118	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ (0[,]+∞))
55	54	3impa 1110	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ (0[,]+∞))
56		eliccxr 13495	. . . . . . . . . 10 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → (𝐹‘𝐴) ∈ ℝ^*)
57	55, 56	syl 17	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ℝ^*)
58	57	xrleidd 13214	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ≤ (𝐹‘𝐴))
59	25	metdsge 24890	. . . . . . . . 9 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) ∈ ℝ^*) → ((𝐹‘𝐴) ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅))
60	57, 59	mpdan 686	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴) ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅))
61	58, 60	mpbid 232	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅)
62	52, 61	eqtrid 2792	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) = ∅)
63	62	adantr 480	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) = ∅)
64	40	ad2antrr 725	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐽 ∈ (TopOn‘𝑋))
65	64, 42	syl 17	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐽 ∈ Top)
66		simpll2 1213	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝑆 ⊆ 𝑋)
67	64, 44	syl 17	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝑋 = ∪ 𝐽)
68	66, 67	sseqtrd 4049	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝑆 ⊆ ∪ 𝐽)
69		simplr 768	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
70		simpll1 1212	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐷 ∈ (∞Met‘𝑋))
71		simpll3 1214	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ 𝑋)
72	57	ad2antrr 725	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → (𝐹‘𝐴) ∈ ℝ^*)
73	4	blopn 24534	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ ℝ^*) → (𝐴(ball‘𝐷)(𝐹‘𝐴)) ∈ 𝐽)
74	70, 71, 72, 73	syl3anc 1371	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → (𝐴(ball‘𝐷)(𝐹‘𝐴)) ∈ 𝐽)
75		simpr 484	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 0 < (𝐹‘𝐴))
76		xblcntr 24442	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ ((𝐹‘𝐴) ∈ ℝ^* ∧ 0 < (𝐹‘𝐴))) → 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴)))
77	70, 71, 72, 75, 76	syl112anc 1374	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴)))
78	48	clsndisj 23104	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽 ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∈ 𝐽 ∧ 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴)))) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) ≠ ∅)
79	65, 68, 69, 74, 77, 78	syl32anc 1378	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) ≠ ∅)
80	79	ex 412	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (0 < (𝐹‘𝐴) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) ≠ ∅))
81	80	necon2bd 2962	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) = ∅ → ¬ 0 < (𝐹‘𝐴)))
82	63, 81	mpd 15	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → ¬ 0 < (𝐹‘𝐴))
83		elxrge0 13517	. . . . . . . . 9 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) ↔ ((𝐹‘𝐴) ∈ ℝ^* ∧ 0 ≤ (𝐹‘𝐴)))
84	83	simprbi 496	. . . . . . . 8 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → 0 ≤ (𝐹‘𝐴))
85	55, 84	syl 17	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → 0 ≤ (𝐹‘𝐴))
86		0xr 11337	. . . . . . . 8 ⊢ 0 ∈ ℝ^*
87		xrleloe 13206	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ (𝐹‘𝐴) ∈ ℝ^*) → (0 ≤ (𝐹‘𝐴) ↔ (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴))))
88	86, 57, 87	sylancr 586	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (0 ≤ (𝐹‘𝐴) ↔ (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴))))
89	85, 88	mpbid 232	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴)))
90	89	adantr 480	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴)))
91	90	ord 863	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (¬ 0 < (𝐹‘𝐴) → 0 = (𝐹‘𝐴)))
92	82, 91	mpd 15	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → 0 = (𝐹‘𝐴))
93	92	eqcomd 2746	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (𝐹‘𝐴) = 0)
94	51, 93	impbida 800	1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴) = 0 ↔ 𝐴 ∈ ((cls‘𝐽)‘𝑆)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 846 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ∀wral 3067 ∃wrex 3076 ∩ cin 3975 ⊆ wss 3976 ∅c0 4352 ∪ cuni 4931 class class class wbr 5166 ↦ cmpt 5249 ran crn 5701 ‘cfv 6573 (class class class)co 7448 infcinf 9510 ℝcr 11183 0cc0 11184 +∞cpnf 11321 ℝ^*cxr 11323 < clt 11324 ≤ cle 11325 ℝ⁺crp 13057 [,]cicc 13410 ∞Metcxmet 21372 ballcbl 21374 MetOpencmopn 21377 Topctop 22920 TopOnctopon 22937 clsccl 23047

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-int 4971 df-iun 5017 df-iin 5018 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-map 8886 df-en 9004 df-dom 9005 df-sdom 9006 df-sup 9511 df-inf 9512 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-2 12356 df-n0 12554 df-z 12640 df-uz 12904 df-q 13014 df-rp 13058 df-xneg 13175 df-xadd 13176 df-xmul 13177 df-icc 13414 df-topgen 17503 df-psmet 21379 df-xmet 21380 df-bl 21382 df-mopn 21383 df-top 22921 df-topon 22938 df-bases 22974 df-cld 23048 df-ntr 23049 df-cls 23050

This theorem is referenced by: metnrmlem1a 24899 lebnumlem1 25012

W3C validator