Theorem metustid 23710

Description: The identity diagonal is included in all elements of the filter base generated by the metric 𝐷. (Contributed by Thierry Arnoux, 22-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
metustid	⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → ( I ↾ 𝑋) ⊆ 𝐴)

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

Proof of Theorem metustid

Dummy variables 𝑝 𝑞 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relres 5920	. . 3 ⊢ Rel ( I ↾ 𝑋)
2	1	a1i 11	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → Rel ( I ↾ 𝑋))
3		vex 3436	. . . . . . . . . . . . . . 15 ⊢ 𝑞 ∈ V
4	3	brresi 5900	. . . . . . . . . . . . . 14 ⊢ (𝑝( I ↾ 𝑋)𝑞 ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 I 𝑞))
5		df-br 5075	. . . . . . . . . . . . . 14 ⊢ (𝑝( I ↾ 𝑋)𝑞 ↔ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋))
6	3	ideq 5761	. . . . . . . . . . . . . . 15 ⊢ (𝑝 I 𝑞 ↔ 𝑝 = 𝑞)
7	6	anbi2i 623	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ 𝑋 ∧ 𝑝 I 𝑞) ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
8	4, 5, 7	3bitr3i 301	. . . . . . . . . . . . 13 ⊢ (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
9	8	biimpi 215	. . . . . . . . . . . 12 ⊢ (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) → (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
10	9	ad2antlr 724	. . . . . . . . . . 11 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
11	10	simprd 496	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 𝑝 = 𝑞)
12		df-ov 7278	. . . . . . . . . . 11 ⊢ (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑝⟩)
13		opeq2 4805	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑞 → ⟨𝑝, 𝑝⟩ = ⟨𝑝, 𝑞⟩)
14	13	fveq2d 6778	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑞 → (𝐷‘⟨𝑝, 𝑝⟩) = (𝐷‘⟨𝑝, 𝑞⟩))
15	12, 14	eqtrid 2790	. . . . . . . . . 10 ⊢ (𝑝 = 𝑞 → (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑞⟩))
16	11, 15	syl 17	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑞⟩))
17		simplll 772	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 𝐷 ∈ (PsMet‘𝑋))
18	10	simpld 495	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 𝑝 ∈ 𝑋)
19		psmet0 23461	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑝 ∈ 𝑋) → (𝑝𝐷𝑝) = 0)
20	17, 18, 19	syl2anc 584	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝑝𝐷𝑝) = 0)
21	16, 20	eqtr3d 2780	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝐷‘⟨𝑝, 𝑞⟩) = 0)
22		0xr 11022	. . . . . . . . . 10 ⊢ 0 ∈ ℝ*
23		rpxr 12739	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℝ+ → 𝑎 ∈ ℝ*)
24		rpgt0 12742	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℝ+ → 0 < 𝑎)
25		lbico1 13133	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ* ∧ 𝑎 ∈ ℝ* ∧ 0 < 𝑎) → 0 ∈ (0[,)𝑎))
26	22, 23, 24, 25	mp3an2i 1465	. . . . . . . . 9 ⊢ (𝑎 ∈ ℝ+ → 0 ∈ (0[,)𝑎))
27	26	adantl 482	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 0 ∈ (0[,)𝑎))
28	21, 27	eqeltrd 2839	. . . . . . 7 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝐷‘⟨𝑝, 𝑞⟩) ∈ (0[,)𝑎))
29		psmetf 23459	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
30	29	ffund 6604	. . . . . . . . 9 ⊢ (𝐷 ∈ (PsMet‘𝑋) → Fun 𝐷)
31	30	ad3antrrr 727	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → Fun 𝐷)
32	11, 18	eqeltrrd 2840	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 𝑞 ∈ 𝑋)
33	18, 32	opelxpd 5627	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → ⟨𝑝, 𝑞⟩ ∈ (𝑋 × 𝑋))
34	29	fdmd 6611	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → dom 𝐷 = (𝑋 × 𝑋))
35	34	ad3antrrr 727	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → dom 𝐷 = (𝑋 × 𝑋))
36	33, 35	eleqtrrd 2842	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → ⟨𝑝, 𝑞⟩ ∈ dom 𝐷)
37		fvimacnv 6930	. . . . . . . 8 ⊢ ((Fun 𝐷 ∧ ⟨𝑝, 𝑞⟩ ∈ dom 𝐷) → ((𝐷‘⟨𝑝, 𝑞⟩) ∈ (0[,)𝑎) ↔ ⟨𝑝, 𝑞⟩ ∈ (◡𝐷 “ (0[,)𝑎))))
38	31, 36, 37	syl2anc 584	. . . . . . 7 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → ((𝐷‘⟨𝑝, 𝑞⟩) ∈ (0[,)𝑎) ↔ ⟨𝑝, 𝑞⟩ ∈ (◡𝐷 “ (0[,)𝑎))))
39	28, 38	mpbid 231	. . . . . 6 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → ⟨𝑝, 𝑞⟩ ∈ (◡𝐷 “ (0[,)𝑎)))
40	39	adantr 481	. . . . 5 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) ∧ 𝐴 = (◡𝐷 “ (0[,)𝑎))) → ⟨𝑝, 𝑞⟩ ∈ (◡𝐷 “ (0[,)𝑎)))
41		simpr 485	. . . . 5 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) ∧ 𝐴 = (◡𝐷 “ (0[,)𝑎))) → 𝐴 = (◡𝐷 “ (0[,)𝑎)))
42	40, 41	eleqtrrd 2842	. . . 4 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) ∧ 𝐴 = (◡𝐷 “ (0[,)𝑎))) → ⟨𝑝, 𝑞⟩ ∈ 𝐴)
43		simplr 766	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → 𝐴 ∈ 𝐹)
44		metust.1	. . . . . . 7 ⊢ 𝐹 = ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))
45	44	metustel 23706	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐴 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎))))
46	45	ad2antrr 723	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → (𝐴 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎))))
47	43, 46	mpbid 231	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎)))
48	42, 47	r19.29a 3218	. . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → ⟨𝑝, 𝑞⟩ ∈ 𝐴)
49	48	ex 413	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) → ⟨𝑝, 𝑞⟩ ∈ 𝐴))
50	2, 49	relssdv 5698	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → ( I ↾ 𝑋) ⊆ 𝐴)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   = wceq 1539   ∈ wcel 2106  ∃wrex 3065   ⊆ wss 3887  ⟨cop 4567   class class class wbr 5074   ↦ cmpt 5157   I cid 5488   × cxp 5587  ^◡ccnv 5588  dom cdm 5589  ran crn 5590   ↾ cres 5591   “ cima 5592  Rel wrel 5594  Fun wfun 6427  ‘cfv 6433  (class class class)co 7275  0cc0 10871  ℝ^*cxr 11008   < clt 11009  ℝ⁺crp 12730  [,)cico 13081  PsMetcpsmet 20581

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-addrcl 10932  ax-rnegex 10942  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-po 5503  df-so 5504  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-rp 12731  df-ico 13085  df-psmet 20589

This theorem is referenced by:  metustfbas  23713  metust  23714