metustfbas - Metamath Proof Explorer

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

Theorem metustfbas 23913

Description: The filter base generated by a metric 𝐷. (Contributed by Thierry Arnoux, 26-Nov-2017.) (Revised by Thierry Arnoux, 11-Feb-2018.) (Proof shortened by Peter Mazsa, 2-Oct-2022.)

**Hypothesis**
Ref	Expression
metust.1	⊢ 𝐹 = ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑎)))

**Assertion**
Ref	Expression
metustfbas	⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → 𝐹 ∈ (fBas‘(𝑋 × 𝑋)))

Distinct variable groups: 𝐷,𝑎 𝑋,𝑎 𝐹,𝑎

Proof of Theorem metustfbas Dummy variables 𝑝 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		metust.1	. . . . . . 7 ⊢ 𝐹 = ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑎)))
2	1	metustel 23906	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝑥 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ⁺ 𝑥 = (^◡𝐷 “ (0[,)𝑎))))
3		simpr 485	. . . . . . . . 9 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 = (^◡𝐷 “ (0[,)𝑎))) → 𝑥 = (^◡𝐷 “ (0[,)𝑎)))
4		cnvimass 6033	. . . . . . . . . 10 ⊢ (^◡𝐷 “ (0[,)𝑎)) ⊆ dom 𝐷
5		psmetf 23659	. . . . . . . . . . . 12 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ^*)
6	5	fdmd 6679	. . . . . . . . . . 11 ⊢ (𝐷 ∈ (PsMet‘𝑋) → dom 𝐷 = (𝑋 × 𝑋))
7	6	adantr 481	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 = (^◡𝐷 “ (0[,)𝑎))) → dom 𝐷 = (𝑋 × 𝑋))
8	4, 7	sseqtrid 3996	. . . . . . . . 9 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 = (^◡𝐷 “ (0[,)𝑎))) → (^◡𝐷 “ (0[,)𝑎)) ⊆ (𝑋 × 𝑋))
9	3, 8	eqsstrd 3982	. . . . . . . 8 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 = (^◡𝐷 “ (0[,)𝑎))) → 𝑥 ⊆ (𝑋 × 𝑋))
10	9	ex 413	. . . . . . 7 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝑥 = (^◡𝐷 “ (0[,)𝑎)) → 𝑥 ⊆ (𝑋 × 𝑋)))
11	10	rexlimdvw 3157	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (∃𝑎 ∈ ℝ⁺ 𝑥 = (^◡𝐷 “ (0[,)𝑎)) → 𝑥 ⊆ (𝑋 × 𝑋)))
12	2, 11	sylbid 239	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝑥 ∈ 𝐹 → 𝑥 ⊆ (𝑋 × 𝑋)))
13	12	ralrimiv 3142	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑥 ∈ 𝐹 𝑥 ⊆ (𝑋 × 𝑋))
14		pwssb 5061	. . . 4 ⊢ (𝐹 ⊆ 𝒫 (𝑋 × 𝑋) ↔ ∀𝑥 ∈ 𝐹 𝑥 ⊆ (𝑋 × 𝑋))
15	13, 14	sylibr 233	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐹 ⊆ 𝒫 (𝑋 × 𝑋))
16	15	adantl 482	. 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → 𝐹 ⊆ 𝒫 (𝑋 × 𝑋))
17		cnvexg 7861	. . . . . . 7 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ^◡𝐷 ∈ V)
18		imaexg 7852	. . . . . . 7 ⊢ (^◡𝐷 ∈ V → (^◡𝐷 “ (0[,)1)) ∈ V)
19		elisset 2819	. . . . . . 7 ⊢ ((^◡𝐷 “ (0[,)1)) ∈ V → ∃𝑥 𝑥 = (^◡𝐷 “ (0[,)1)))
20		1rp 12919	. . . . . . . . 9 ⊢ 1 ∈ ℝ⁺
21		oveq2 7365	. . . . . . . . . . 11 ⊢ (𝑎 = 1 → (0[,)𝑎) = (0[,)1))
22	21	imaeq2d 6013	. . . . . . . . . 10 ⊢ (𝑎 = 1 → (^◡𝐷 “ (0[,)𝑎)) = (^◡𝐷 “ (0[,)1)))
23	22	rspceeqv 3595	. . . . . . . . 9 ⊢ ((1 ∈ ℝ⁺ ∧ 𝑥 = (^◡𝐷 “ (0[,)1))) → ∃𝑎 ∈ ℝ⁺ 𝑥 = (^◡𝐷 “ (0[,)𝑎)))
24	20, 23	mpan 688	. . . . . . . 8 ⊢ (𝑥 = (^◡𝐷 “ (0[,)1)) → ∃𝑎 ∈ ℝ⁺ 𝑥 = (^◡𝐷 “ (0[,)𝑎)))
25	24	eximi 1837	. . . . . . 7 ⊢ (∃𝑥 𝑥 = (^◡𝐷 “ (0[,)1)) → ∃𝑥∃𝑎 ∈ ℝ⁺ 𝑥 = (^◡𝐷 “ (0[,)𝑎)))
26	17, 18, 19, 25	4syl 19	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∃𝑥∃𝑎 ∈ ℝ⁺ 𝑥 = (^◡𝐷 “ (0[,)𝑎)))
27	2	exbidv 1924	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (∃𝑥 𝑥 ∈ 𝐹 ↔ ∃𝑥∃𝑎 ∈ ℝ⁺ 𝑥 = (^◡𝐷 “ (0[,)𝑎))))
28	26, 27	mpbird 256	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∃𝑥 𝑥 ∈ 𝐹)
29	28	adantl 482	. . . 4 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ∃𝑥 𝑥 ∈ 𝐹)
30		n0 4306	. . . 4 ⊢ (𝐹 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐹)
31	29, 30	sylibr 233	. . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → 𝐹 ≠ ∅)
32	1	metustid 23910	. . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝐹) → ( I ↾ 𝑋) ⊆ 𝑥)
33	32	adantll 712	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑥 ∈ 𝐹) → ( I ↾ 𝑋) ⊆ 𝑥)
34		n0 4306	. . . . . . . . . 10 ⊢ (𝑋 ≠ ∅ ↔ ∃𝑝 𝑝 ∈ 𝑋)
35	34	biimpi 215	. . . . . . . . 9 ⊢ (𝑋 ≠ ∅ → ∃𝑝 𝑝 ∈ 𝑋)
36	35	adantr 481	. . . . . . . 8 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ∃𝑝 𝑝 ∈ 𝑋)
37		opelidres 5949	. . . . . . . . . . 11 ⊢ (𝑝 ∈ 𝑋 → (⟨𝑝, 𝑝⟩ ∈ ( I ↾ 𝑋) ↔ 𝑝 ∈ 𝑋))
38	37	ibir 267	. . . . . . . . . 10 ⊢ (𝑝 ∈ 𝑋 → ⟨𝑝, 𝑝⟩ ∈ ( I ↾ 𝑋))
39	38	ne0d 4295	. . . . . . . . 9 ⊢ (𝑝 ∈ 𝑋 → ( I ↾ 𝑋) ≠ ∅)
40	39	exlimiv 1933	. . . . . . . 8 ⊢ (∃𝑝 𝑝 ∈ 𝑋 → ( I ↾ 𝑋) ≠ ∅)
41	36, 40	syl 17	. . . . . . 7 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ( I ↾ 𝑋) ≠ ∅)
42	41	adantr 481	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑥 ∈ 𝐹) → ( I ↾ 𝑋) ≠ ∅)
43		ssn0 4360	. . . . . 6 ⊢ ((( I ↾ 𝑋) ⊆ 𝑥 ∧ ( I ↾ 𝑋) ≠ ∅) → 𝑥 ≠ ∅)
44	33, 42, 43	syl2anc 584	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ 𝑥 ∈ 𝐹) → 𝑥 ≠ ∅)
45	44	nelrdva 3663	. . . 4 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ¬ ∅ ∈ 𝐹)
46		df-nel 3050	. . . 4 ⊢ (∅ ∉ 𝐹 ↔ ¬ ∅ ∈ 𝐹)
47	45, 46	sylibr 233	. . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ∅ ∉ 𝐹)
48		df-ss 3927	. . . . . . . . 9 ⊢ (𝑥 ⊆ 𝑦 ↔ (𝑥 ∩ 𝑦) = 𝑥)
49	48	biimpi 215	. . . . . . . 8 ⊢ (𝑥 ⊆ 𝑦 → (𝑥 ∩ 𝑦) = 𝑥)
50	49	adantl 482	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) ∧ 𝑥 ⊆ 𝑦) → (𝑥 ∩ 𝑦) = 𝑥)
51		simplrl 775	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) ∧ 𝑥 ⊆ 𝑦) → 𝑥 ∈ 𝐹)
52	50, 51	eqeltrd 2838	. . . . . 6 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) ∧ 𝑥 ⊆ 𝑦) → (𝑥 ∩ 𝑦) ∈ 𝐹)
53		sseqin2 4175	. . . . . . . . 9 ⊢ (𝑦 ⊆ 𝑥 ↔ (𝑥 ∩ 𝑦) = 𝑦)
54	53	biimpi 215	. . . . . . . 8 ⊢ (𝑦 ⊆ 𝑥 → (𝑥 ∩ 𝑦) = 𝑦)
55	54	adantl 482	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) ∧ 𝑦 ⊆ 𝑥) → (𝑥 ∩ 𝑦) = 𝑦)
56		simplrr 776	. . . . . . 7 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) ∧ 𝑦 ⊆ 𝑥) → 𝑦 ∈ 𝐹)
57	55, 56	eqeltrd 2838	. . . . . 6 ⊢ ((((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) ∧ 𝑦 ⊆ 𝑥) → (𝑥 ∩ 𝑦) ∈ 𝐹)
58		simplr 767	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → 𝐷 ∈ (PsMet‘𝑋))
59		simprl 769	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → 𝑥 ∈ 𝐹)
60		simprr 771	. . . . . . 7 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → 𝑦 ∈ 𝐹)
61	1	metustto 23909	. . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥))
62	58, 59, 60, 61	syl3anc 1371	. . . . . 6 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝑥 ⊆ 𝑦 ∨ 𝑦 ⊆ 𝑥))
63	52, 57, 62	mpjaodan 957	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝑥 ∩ 𝑦) ∈ 𝐹)
64		ssidd 3967	. . . . 5 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → (𝑥 ∩ 𝑦) ⊆ (𝑥 ∩ 𝑦))
65		sseq1 3969	. . . . . 6 ⊢ (𝑧 = (𝑥 ∩ 𝑦) → (𝑧 ⊆ (𝑥 ∩ 𝑦) ↔ (𝑥 ∩ 𝑦) ⊆ (𝑥 ∩ 𝑦)))
66	65	rspcev 3581	. . . . 5 ⊢ (((𝑥 ∩ 𝑦) ∈ 𝐹 ∧ (𝑥 ∩ 𝑦) ⊆ (𝑥 ∩ 𝑦)) → ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))
67	63, 64, 66	syl2anc 584	. . . 4 ⊢ (((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) ∧ (𝑥 ∈ 𝐹 ∧ 𝑦 ∈ 𝐹)) → ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))
68	67	ralrimivva 3197	. . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦))
69	31, 47, 68	3jca 1128	. 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)))
70		elfvex 6880	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
71	70	adantl 482	. . . 4 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → 𝑋 ∈ V)
72	71, 71	xpexd 7685	. . 3 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝑋 × 𝑋) ∈ V)
73		isfbas2 23186	. . 3 ⊢ ((𝑋 × 𝑋) ∈ V → (𝐹 ∈ (fBas‘(𝑋 × 𝑋)) ↔ (𝐹 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)))))
74	72, 73	syl 17	. 2 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝐹 ∈ (fBas‘(𝑋 × 𝑋)) ↔ (𝐹 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝐹 ≠ ∅ ∧ ∅ ∉ 𝐹 ∧ ∀𝑥 ∈ 𝐹 ∀𝑦 ∈ 𝐹 ∃𝑧 ∈ 𝐹 𝑧 ⊆ (𝑥 ∩ 𝑦)))))
75	16, 69, 74	mpbir2and 711	1 ⊢ ((𝑋 ≠ ∅ ∧ 𝐷 ∈ (PsMet‘𝑋)) → 𝐹 ∈ (fBas‘(𝑋 × 𝑋)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 396 ∨ wo 845 ∧ w3a 1087 = wceq 1541 ∃wex 1781 ∈ wcel 2106 ≠ wne 2943 ∉ wnel 3049 ∀wral 3064 ∃wrex 3073 Vcvv 3445 ∩ cin 3909 ⊆ wss 3910 ∅c0 4282 𝒫 cpw 4560 ⟨cop 4592 ↦ cmpt 5188 I cid 5530 × cxp 5631 ^◡ccnv 5632 dom cdm 5633 ran crn 5634 ↾ cres 5635 “ cima 5636 ‘cfv 6496 (class class class)co 7357 0cc0 11051 1c1 11052 ℝ^*cxr 11188 ℝ⁺crp 12915 [,)cico 13266 PsMetcpsmet 20780 fBascfbas 20784

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2707 ax-sep 5256 ax-nul 5263 ax-pow 5320 ax-pr 5384 ax-un 7672 ax-cnex 11107 ax-resscn 11108 ax-1cn 11109 ax-icn 11110 ax-addcl 11111 ax-addrcl 11112 ax-mulcl 11113 ax-mulrcl 11114 ax-mulcom 11115 ax-addass 11116 ax-mulass 11117 ax-distr 11118 ax-i2m1 11119 ax-1ne0 11120 ax-1rid 11121 ax-rnegex 11122 ax-rrecex 11123 ax-cnre 11124 ax-pre-lttri 11125 ax-pre-lttrn 11126 ax-pre-ltadd 11127 ax-pre-mulgt0 11128

This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2538 df-eu 2567 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3065 df-rex 3074 df-reu 3354 df-rab 3408 df-v 3447 df-sbc 3740 df-csb 3856 df-dif 3913 df-un 3915 df-in 3917 df-ss 3927 df-nul 4283 df-if 4487 df-pw 4562 df-sn 4587 df-pr 4589 df-op 4593 df-uni 4866 df-iun 4956 df-br 5106 df-opab 5168 df-mpt 5189 df-id 5531 df-po 5545 df-so 5546 df-xp 5639 df-rel 5640 df-cnv 5641 df-co 5642 df-dm 5643 df-rn 5644 df-res 5645 df-ima 5646 df-iota 6448 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-riota 7313 df-ov 7360 df-oprab 7361 df-mpo 7362 df-1st 7921 df-2nd 7922 df-er 8648 df-map 8767 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11191 df-mnf 11192 df-xr 11193 df-ltxr 11194 df-le 11195 df-sub 11387 df-neg 11388 df-rp 12916 df-ico 13270 df-psmet 20788 df-fbas 20793

This theorem is referenced by: metust 23914 cfilucfil 23915 metuel 23920 psmetutop 23923 restmetu 23926 metucn 23927

W3C validator