Theorem metustid 24458

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 5960	. . 3 ⊢ Rel ( I ↾ 𝑋)
2	1	a1i 11	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → Rel ( I ↾ 𝑋))
3		vex 3442	. . . . . . . . . . . . . . 15 ⊢ 𝑞 ∈ V
4	3	brresi 5943	. . . . . . . . . . . . . 14 ⊢ (𝑝( I ↾ 𝑋)𝑞 ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 I 𝑞))
5		df-br 5096	. . . . . . . . . . . . . 14 ⊢ (𝑝( I ↾ 𝑋)𝑞 ↔ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋))
6	3	ideq 5799	. . . . . . . . . . . . . . 15 ⊢ (𝑝 I 𝑞 ↔ 𝑝 = 𝑞)
7	6	anbi2i 623	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ 𝑋 ∧ 𝑝 I 𝑞) ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
8	4, 5, 7	3bitr3i 301	. . . . . . . . . . . . 13 ⊢ (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
9	8	biimpi 216	. . . . . . . . . . . 12 ⊢ (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) → (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
10	9	ad2antlr 727	. . . . . . . . . . 11 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
11	10	simprd 495	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 𝑝 = 𝑞)
12		df-ov 7356	. . . . . . . . . . 11 ⊢ (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑝⟩)
13		opeq2 4828	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑞 → ⟨𝑝, 𝑝⟩ = ⟨𝑝, 𝑞⟩)
14	13	fveq2d 6830	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑞 → (𝐷‘⟨𝑝, 𝑝⟩) = (𝐷‘⟨𝑝, 𝑞⟩))
15	12, 14	eqtrid 2776	. . . . . . . . . 10 ⊢ (𝑝 = 𝑞 → (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑞⟩))
16	11, 15	syl 17	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑞⟩))
17		simplll 774	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 𝐷 ∈ (PsMet‘𝑋))
18	10	simpld 494	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 𝑝 ∈ 𝑋)
19		psmet0 24212	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑝 ∈ 𝑋) → (𝑝𝐷𝑝) = 0)
20	17, 18, 19	syl2anc 584	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝑝𝐷𝑝) = 0)
21	16, 20	eqtr3d 2766	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝐷‘⟨𝑝, 𝑞⟩) = 0)
22		0xr 11181	. . . . . . . . . 10 ⊢ 0 ∈ ℝ*
23		rpxr 12921	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℝ+ → 𝑎 ∈ ℝ*)
24		rpgt0 12924	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℝ+ → 0 < 𝑎)
25		lbico1 13321	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ* ∧ 𝑎 ∈ ℝ* ∧ 0 < 𝑎) → 0 ∈ (0[,)𝑎))
26	22, 23, 24, 25	mp3an2i 1468	. . . . . . . . 9 ⊢ (𝑎 ∈ ℝ+ → 0 ∈ (0[,)𝑎))
27	26	adantl 481	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 0 ∈ (0[,)𝑎))
28	21, 27	eqeltrd 2828	. . . . . . 7 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → (𝐷‘⟨𝑝, 𝑞⟩) ∈ (0[,)𝑎))
29		psmetf 24210	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
30	29	ffund 6660	. . . . . . . . 9 ⊢ (𝐷 ∈ (PsMet‘𝑋) → Fun 𝐷)
31	30	ad3antrrr 730	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → Fun 𝐷)
32	11, 18	eqeltrrd 2829	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → 𝑞 ∈ 𝑋)
33	18, 32	opelxpd 5662	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → ⟨𝑝, 𝑞⟩ ∈ (𝑋 × 𝑋))
34	29	fdmd 6666	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → dom 𝐷 = (𝑋 × 𝑋))
35	34	ad3antrrr 730	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → dom 𝐷 = (𝑋 × 𝑋))
36	33, 35	eleqtrrd 2831	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → ⟨𝑝, 𝑞⟩ ∈ dom 𝐷)
37		fvimacnv 6991	. . . . . . . 8 ⊢ ((Fun 𝐷 ∧ ⟨𝑝, 𝑞⟩ ∈ dom 𝐷) → ((𝐷‘⟨𝑝, 𝑞⟩) ∈ (0[,)𝑎) ↔ ⟨𝑝, 𝑞⟩ ∈ (◡𝐷 “ (0[,)𝑎))))
38	31, 36, 37	syl2anc 584	. . . . . . 7 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → ((𝐷‘⟨𝑝, 𝑞⟩) ∈ (0[,)𝑎) ↔ ⟨𝑝, 𝑞⟩ ∈ (◡𝐷 “ (0[,)𝑎))))
39	28, 38	mpbid 232	. . . . . 6 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) → ⟨𝑝, 𝑞⟩ ∈ (◡𝐷 “ (0[,)𝑎)))
40	39	adantr 480	. . . . 5 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) ∧ 𝐴 = (◡𝐷 “ (0[,)𝑎))) → ⟨𝑝, 𝑞⟩ ∈ (◡𝐷 “ (0[,)𝑎)))
41		simpr 484	. . . . 5 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) ∧ 𝐴 = (◡𝐷 “ (0[,)𝑎))) → 𝐴 = (◡𝐷 “ (0[,)𝑎)))
42	40, 41	eleqtrrd 2831	. . . 4 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ+) ∧ 𝐴 = (◡𝐷 “ (0[,)𝑎))) → ⟨𝑝, 𝑞⟩ ∈ 𝐴)
43		simplr 768	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → 𝐴 ∈ 𝐹)
44		metust.1	. . . . . . 7 ⊢ 𝐹 = ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))
45	44	metustel 24454	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐴 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎))))
46	45	ad2antrr 726	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → (𝐴 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎))))
47	43, 46	mpbid 232	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎)))
48	42, 47	r19.29a 3137	. . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → ⟨𝑝, 𝑞⟩ ∈ 𝐴)
49	48	ex 412	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) → ⟨𝑝, 𝑞⟩ ∈ 𝐴))
50	2, 49	relssdv 5735	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → ( I ↾ 𝑋) ⊆ 𝐴)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  ∃wrex 3053   ⊆ wss 3905  ⟨cop 4585   class class class wbr 5095   ↦ cmpt 5176   I cid 5517   × cxp 5621  ^◡ccnv 5622  dom cdm 5623  ran crn 5624   ↾ cres 5625   “ cima 5626  Rel wrel 5628  Fun wfun 6480  ‘cfv 6486  (class class class)co 7353  0cc0 11028  ℝ^*cxr 11167   < clt 11168  ℝ⁺crp 12911  [,)cico 13268  PsMetcpsmet 21263

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7675  ax-cnex 11084  ax-resscn 11085  ax-1cn 11086  ax-addrcl 11089  ax-rnegex 11099  ax-cnre 11101  ax-pre-lttri 11102  ax-pre-lttrn 11103

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rab 3397  df-v 3440  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4479  df-pw 4555  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4862  df-br 5096  df-opab 5158  df-mpt 5177  df-id 5518  df-po 5531  df-so 5532  df-xp 5629  df-rel 5630  df-cnv 5631  df-co 5632  df-dm 5633  df-rn 5634  df-res 5635  df-ima 5636  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7356  df-oprab 7357  df-mpo 7358  df-er 8632  df-map 8762  df-en 8880  df-dom 8881  df-sdom 8882  df-pnf 11170  df-mnf 11171  df-xr 11172  df-ltxr 11173  df-le 11174  df-rp 12912  df-ico 13272  df-psmet 21271

This theorem is referenced by:  metustfbas  24461  metust  24462