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 24590

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 1210	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → 𝐷 ∈ (∞Met‘𝑋))
2		simprl 767	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → 𝑧 ∈ 𝐽)
3		simprr 769	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → 𝐴 ∈ 𝑧)
4		metdscn.j	. . . . . . . 8 ⊢ 𝐽 = (MetOpen‘𝐷)
5	4	mopni2 24222	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧) → ∃𝑟 ∈ ℝ⁺ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)
6	1, 2, 3, 5	syl3anc 1369	. . . . . 6 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → ∃𝑟 ∈ ℝ⁺ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)
7		simprr 769	. . . . . . . 8 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)
8	7	ssrind 4234	. . . . . . 7 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ⊆ (𝑧 ∩ 𝑆))
9		rpgt0 12990	. . . . . . . . . 10 ⊢ (𝑟 ∈ ℝ⁺ → 0 < 𝑟)
10		0re 11220	. . . . . . . . . . 11 ⊢ 0 ∈ ℝ
11		rpre 12986	. . . . . . . . . . 11 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ)
12		ltnle 11297	. . . . . . . . . . 11 ⊢ ((0 ∈ ℝ ∧ 𝑟 ∈ ℝ) → (0 < 𝑟 ↔ ¬ 𝑟 ≤ 0))
13	10, 11, 12	sylancr 585	. . . . . . . . . 10 ⊢ (𝑟 ∈ ℝ⁺ → (0 < 𝑟 ↔ ¬ 𝑟 ≤ 0))
14	9, 13	mpbid 231	. . . . . . . . 9 ⊢ (𝑟 ∈ ℝ⁺ → ¬ 𝑟 ≤ 0)
15	14	ad2antrl 724	. . . . . . . 8 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → ¬ 𝑟 ≤ 0)
16		simpllr 772	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝐹‘𝐴) = 0)
17	16	breq2d 5159	. . . . . . . . . . 11 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑟 ≤ (𝐹‘𝐴) ↔ 𝑟 ≤ 0))
18	1	adantr 479	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → 𝐷 ∈ (∞Met‘𝑋))
19		simpl2 1190	. . . . . . . . . . . . 13 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝑆 ⊆ 𝑋)
20	19	ad2antrr 722	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → 𝑆 ⊆ 𝑋)
21		simpl3 1191	. . . . . . . . . . . . 13 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐴 ∈ 𝑋)
22	21	ad2antrr 722	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → 𝐴 ∈ 𝑋)
23		rpxr 12987	. . . . . . . . . . . . 13 ⊢ (𝑟 ∈ ℝ⁺ → 𝑟 ∈ ℝ^*)
24	23	ad2antrl 724	. . . . . . . . . . . 12 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → 𝑟 ∈ ℝ^*)
25		metdscn.f	. . . . . . . . . . . . 13 ⊢ 𝐹 = (𝑥 ∈ 𝑋 ↦ inf(ran (𝑦 ∈ 𝑆 ↦ (𝑥𝐷𝑦)), ℝ^*, < ))
26	25	metdsge 24585	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝑟 ∈ ℝ^*) → (𝑟 ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ∅))
27	18, 20, 22, 24, 26	syl31anc 1371	. . . . . . . . . . 11 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑟 ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ∅))
28	17, 27	bitr3d 280	. . . . . . . . . 10 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑟 ≤ 0 ↔ (𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ∅))
29		incom 4200	. . . . . . . . . . 11 ⊢ (𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆)
30	29	eqeq1i 2735	. . . . . . . . . 10 ⊢ ((𝑆 ∩ (𝐴(ball‘𝐷)𝑟)) = ∅ ↔ ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) = ∅)
31	28, 30	bitrdi 286	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑟 ≤ 0 ↔ ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) = ∅))
32	31	necon3bbid 2976	. . . . . . . 8 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (¬ 𝑟 ≤ 0 ↔ ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ≠ ∅))
33	15, 32	mpbid 231	. . . . . . 7 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ≠ ∅)
34		ssn0 4399	. . . . . . 7 ⊢ ((((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ⊆ (𝑧 ∩ 𝑆) ∧ ((𝐴(ball‘𝐷)𝑟) ∩ 𝑆) ≠ ∅) → (𝑧 ∩ 𝑆) ≠ ∅)
35	8, 33, 34	syl2anc 582	. . . . . 6 ⊢ (((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) ∧ (𝑟 ∈ ℝ⁺ ∧ (𝐴(ball‘𝐷)𝑟) ⊆ 𝑧)) → (𝑧 ∩ 𝑆) ≠ ∅)
36	6, 35	rexlimddv 3159	. . . . 5 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ (𝑧 ∈ 𝐽 ∧ 𝐴 ∈ 𝑧)) → (𝑧 ∩ 𝑆) ≠ ∅)
37	36	expr 455	. . . 4 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) ∧ 𝑧 ∈ 𝐽) → (𝐴 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅))
38	37	ralrimiva 3144	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → ∀𝑧 ∈ 𝐽 (𝐴 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅))
39	4	mopntopon 24165	. . . . . . 7 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝐽 ∈ (TopOn‘𝑋))
40	39	3ad2ant1 1131	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → 𝐽 ∈ (TopOn‘𝑋))
41	40	adantr 479	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐽 ∈ (TopOn‘𝑋))
42		topontop 22635	. . . . 5 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝐽 ∈ Top)
43	41, 42	syl 17	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐽 ∈ Top)
44		toponuni 22636	. . . . . 6 ⊢ (𝐽 ∈ (TopOn‘𝑋) → 𝑋 = ∪ 𝐽)
45	41, 44	syl 17	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝑋 = ∪ 𝐽)
46	19, 45	sseqtrd 4021	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝑆 ⊆ ∪ 𝐽)
47	21, 45	eleqtrd 2833	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐴 ∈ ∪ 𝐽)
48		eqid 2730	. . . . 5 ⊢ ∪ 𝐽 = ∪ 𝐽
49	48	elcls 22797	. . . 4 ⊢ ((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽 ∧ 𝐴 ∈ ∪ 𝐽) → (𝐴 ∈ ((cls‘𝐽)‘𝑆) ↔ ∀𝑧 ∈ 𝐽 (𝐴 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
50	43, 46, 47, 49	syl3anc 1369	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → (𝐴 ∈ ((cls‘𝐽)‘𝑆) ↔ ∀𝑧 ∈ 𝐽 (𝐴 ∈ 𝑧 → (𝑧 ∩ 𝑆) ≠ ∅)))
51	38, 50	mpbird 256	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) = 0) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
52		incom 4200	. . . . . . 7 ⊢ ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) = (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴)))
53	25	metdsf 24584	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) → 𝐹:𝑋⟶(0[,]+∞))
54	53	ffvelcdmda 7085	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ (0[,]+∞))
55	54	3impa 1108	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ (0[,]+∞))
56		eliccxr 13416	. . . . . . . . . 10 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → (𝐹‘𝐴) ∈ ℝ^*)
57	55, 56	syl 17	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ ℝ^*)
58	57	xrleidd 13135	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ≤ (𝐹‘𝐴))
59	25	metdsge 24585	. . . . . . . . 9 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ (𝐹‘𝐴) ∈ ℝ^*) → ((𝐹‘𝐴) ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅))
60	57, 59	mpdan 683	. . . . . . . 8 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴) ≤ (𝐹‘𝐴) ↔ (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅))
61	58, 60	mpbid 231	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝑆 ∩ (𝐴(ball‘𝐷)(𝐹‘𝐴))) = ∅)
62	52, 61	eqtrid 2782	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) = ∅)
63	62	adantr 479	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) = ∅)
64	40	ad2antrr 722	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐽 ∈ (TopOn‘𝑋))
65	64, 42	syl 17	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐽 ∈ Top)
66		simpll2 1211	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝑆 ⊆ 𝑋)
67	64, 44	syl 17	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝑋 = ∪ 𝐽)
68	66, 67	sseqtrd 4021	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝑆 ⊆ ∪ 𝐽)
69		simplr 765	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ ((cls‘𝐽)‘𝑆))
70		simpll1 1210	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐷 ∈ (∞Met‘𝑋))
71		simpll3 1212	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ 𝑋)
72	57	ad2antrr 722	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → (𝐹‘𝐴) ∈ ℝ^*)
73	4	blopn 24229	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ (𝐹‘𝐴) ∈ ℝ^*) → (𝐴(ball‘𝐷)(𝐹‘𝐴)) ∈ 𝐽)
74	70, 71, 72, 73	syl3anc 1369	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → (𝐴(ball‘𝐷)(𝐹‘𝐴)) ∈ 𝐽)
75		simpr 483	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 0 < (𝐹‘𝐴))
76		xblcntr 24137	. . . . . . . . 9 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ ((𝐹‘𝐴) ∈ ℝ^* ∧ 0 < (𝐹‘𝐴))) → 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴)))
77	70, 71, 72, 75, 76	syl112anc 1372	. . . . . . . 8 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴)))
78	48	clsndisj 22799	. . . . . . . 8 ⊢ (((𝐽 ∈ Top ∧ 𝑆 ⊆ ∪ 𝐽 ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∈ 𝐽 ∧ 𝐴 ∈ (𝐴(ball‘𝐷)(𝐹‘𝐴)))) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) ≠ ∅)
79	65, 68, 69, 74, 77, 78	syl32anc 1376	. . . . . . 7 ⊢ ((((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) ∧ 0 < (𝐹‘𝐴)) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) ≠ ∅)
80	79	ex 411	. . . . . 6 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (0 < (𝐹‘𝐴) → ((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) ≠ ∅))
81	80	necon2bd 2954	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (((𝐴(ball‘𝐷)(𝐹‘𝐴)) ∩ 𝑆) = ∅ → ¬ 0 < (𝐹‘𝐴)))
82	63, 81	mpd 15	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → ¬ 0 < (𝐹‘𝐴))
83		elxrge0 13438	. . . . . . . . 9 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) ↔ ((𝐹‘𝐴) ∈ ℝ^* ∧ 0 ≤ (𝐹‘𝐴)))
84	83	simprbi 495	. . . . . . . 8 ⊢ ((𝐹‘𝐴) ∈ (0[,]+∞) → 0 ≤ (𝐹‘𝐴))
85	55, 84	syl 17	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → 0 ≤ (𝐹‘𝐴))
86		0xr 11265	. . . . . . . 8 ⊢ 0 ∈ ℝ^*
87		xrleloe 13127	. . . . . . . 8 ⊢ ((0 ∈ ℝ^* ∧ (𝐹‘𝐴) ∈ ℝ^*) → (0 ≤ (𝐹‘𝐴) ↔ (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴))))
88	86, 57, 87	sylancr 585	. . . . . . 7 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (0 ≤ (𝐹‘𝐴) ↔ (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴))))
89	85, 88	mpbid 231	. . . . . 6 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴)))
90	89	adantr 479	. . . . 5 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (0 < (𝐹‘𝐴) ∨ 0 = (𝐹‘𝐴)))
91	90	ord 860	. . . 4 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (¬ 0 < (𝐹‘𝐴) → 0 = (𝐹‘𝐴)))
92	82, 91	mpd 15	. . 3 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → 0 = (𝐹‘𝐴))
93	92	eqcomd 2736	. 2 ⊢ (((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) ∧ 𝐴 ∈ ((cls‘𝐽)‘𝑆)) → (𝐹‘𝐴) = 0)
94	51, 93	impbida 797	1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝑆 ⊆ 𝑋 ∧ 𝐴 ∈ 𝑋) → ((𝐹‘𝐴) = 0 ↔ 𝐴 ∈ ((cls‘𝐽)‘𝑆)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 394 ∨ wo 843 ∧ w3a 1085 = wceq 1539 ∈ wcel 2104 ≠ wne 2938 ∀wral 3059 ∃wrex 3068 ∩ cin 3946 ⊆ wss 3947 ∅c0 4321 ∪ cuni 4907 class class class wbr 5147 ↦ cmpt 5230 ran crn 5676 ‘cfv 6542 (class class class)co 7411 infcinf 9438 ℝcr 11111 0cc0 11112 +∞cpnf 11249 ℝ^*cxr 11251 < clt 11252 ≤ cle 11253 ℝ⁺crp 12978 [,]cicc 13331 ∞Metcxmet 21129 ballcbl 21131 MetOpencmopn 21134 Topctop 22615 TopOnctopon 22632 clsccl 22742

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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189 ax-pre-sup 11190

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-er 8705 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-sup 9439 df-inf 9440 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-div 11876 df-nn 12217 df-2 12279 df-n0 12477 df-z 12563 df-uz 12827 df-q 12937 df-rp 12979 df-xneg 13096 df-xadd 13097 df-xmul 13098 df-icc 13335 df-topgen 17393 df-psmet 21136 df-xmet 21137 df-bl 21139 df-mopn 21140 df-top 22616 df-topon 22633 df-bases 22669 df-cld 22743 df-ntr 22744 df-cls 22745

This theorem is referenced by: metnrmlem1a 24594 lebnumlem1 24707

W3C validator