metustid - Metamath Proof Explorer

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

Theorem metustid 24062

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 6010	. . 3 ⊢ Rel ( I ↾ 𝑋)
2	1	a1i 11	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → Rel ( I ↾ 𝑋))
3		vex 3478	. . . . . . . . . . . . . . 15 ⊢ 𝑞 ∈ V
4	3	brresi 5990	. . . . . . . . . . . . . 14 ⊢ (𝑝( I ↾ 𝑋)𝑞 ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 I 𝑞))
5		df-br 5149	. . . . . . . . . . . . . 14 ⊢ (𝑝( I ↾ 𝑋)𝑞 ↔ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋))
6	3	ideq 5852	. . . . . . . . . . . . . . 15 ⊢ (𝑝 I 𝑞 ↔ 𝑝 = 𝑞)
7	6	anbi2i 623	. . . . . . . . . . . . . 14 ⊢ ((𝑝 ∈ 𝑋 ∧ 𝑝 I 𝑞) ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
8	4, 5, 7	3bitr3i 300	. . . . . . . . . . . . 13 ⊢ (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) ↔ (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
9	8	biimpi 215	. . . . . . . . . . . 12 ⊢ (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) → (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
10	9	ad2antlr 725	. . . . . . . . . . 11 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → (𝑝 ∈ 𝑋 ∧ 𝑝 = 𝑞))
11	10	simprd 496	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → 𝑝 = 𝑞)
12		df-ov 7411	. . . . . . . . . . 11 ⊢ (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑝⟩)
13		opeq2 4874	. . . . . . . . . . . 12 ⊢ (𝑝 = 𝑞 → ⟨𝑝, 𝑝⟩ = ⟨𝑝, 𝑞⟩)
14	13	fveq2d 6895	. . . . . . . . . . 11 ⊢ (𝑝 = 𝑞 → (𝐷‘⟨𝑝, 𝑝⟩) = (𝐷‘⟨𝑝, 𝑞⟩))
15	12, 14	eqtrid 2784	. . . . . . . . . 10 ⊢ (𝑝 = 𝑞 → (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑞⟩))
16	11, 15	syl 17	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → (𝑝𝐷𝑝) = (𝐷‘⟨𝑝, 𝑞⟩))
17		simplll 773	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → 𝐷 ∈ (PsMet‘𝑋))
18	10	simpld 495	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → 𝑝 ∈ 𝑋)
19		psmet0 23813	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑝 ∈ 𝑋) → (𝑝𝐷𝑝) = 0)
20	17, 18, 19	syl2anc 584	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → (𝑝𝐷𝑝) = 0)
21	16, 20	eqtr3d 2774	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → (𝐷‘⟨𝑝, 𝑞⟩) = 0)
22		0xr 11260	. . . . . . . . . 10 ⊢ 0 ∈ ℝ^*
23		rpxr 12982	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℝ⁺ → 𝑎 ∈ ℝ^*)
24		rpgt0 12985	. . . . . . . . . 10 ⊢ (𝑎 ∈ ℝ⁺ → 0 < 𝑎)
25		lbico1 13377	. . . . . . . . . 10 ⊢ ((0 ∈ ℝ^* ∧ 𝑎 ∈ ℝ^* ∧ 0 < 𝑎) → 0 ∈ (0[,)𝑎))
26	22, 23, 24, 25	mp3an2i 1466	. . . . . . . . 9 ⊢ (𝑎 ∈ ℝ⁺ → 0 ∈ (0[,)𝑎))
27	26	adantl 482	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → 0 ∈ (0[,)𝑎))
28	21, 27	eqeltrd 2833	. . . . . . 7 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → (𝐷‘⟨𝑝, 𝑞⟩) ∈ (0[,)𝑎))
29		psmetf 23811	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ^*)
30	29	ffund 6721	. . . . . . . . 9 ⊢ (𝐷 ∈ (PsMet‘𝑋) → Fun 𝐷)
31	30	ad3antrrr 728	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → Fun 𝐷)
32	11, 18	eqeltrrd 2834	. . . . . . . . . 10 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → 𝑞 ∈ 𝑋)
33	18, 32	opelxpd 5715	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → ⟨𝑝, 𝑞⟩ ∈ (𝑋 × 𝑋))
34	29	fdmd 6728	. . . . . . . . . 10 ⊢ (𝐷 ∈ (PsMet‘𝑋) → dom 𝐷 = (𝑋 × 𝑋))
35	34	ad3antrrr 728	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → dom 𝐷 = (𝑋 × 𝑋))
36	33, 35	eleqtrrd 2836	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) → ⟨𝑝, 𝑞⟩ ∈ dom 𝐷)
37		fvimacnv 7054	. . . . . . . 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 2836	. . . 4 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) ∧ 𝑎 ∈ ℝ⁺) ∧ 𝐴 = (^◡𝐷 “ (0[,)𝑎))) → ⟨𝑝, 𝑞⟩ ∈ 𝐴)
43		simplr 767	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → 𝐴 ∈ 𝐹)
44		metust.1	. . . . . . 7 ⊢ 𝐹 = ran (𝑎 ∈ ℝ⁺ ↦ (^◡𝐷 “ (0[,)𝑎)))
45	44	metustel 24058	. . . . . 6 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐴 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ⁺ 𝐴 = (^◡𝐷 “ (0[,)𝑎))))
46	45	ad2antrr 724	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → (𝐴 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ⁺ 𝐴 = (^◡𝐷 “ (0[,)𝑎))))
47	43, 46	mpbid 231	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → ∃𝑎 ∈ ℝ⁺ 𝐴 = (^◡𝐷 “ (0[,)𝑎)))
48	42, 47	r19.29a 3162	. . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) ∧ ⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋)) → ⟨𝑝, 𝑞⟩ ∈ 𝐴)
49	48	ex 413	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → (⟨𝑝, 𝑞⟩ ∈ ( I ↾ 𝑋) → ⟨𝑝, 𝑞⟩ ∈ 𝐴))
50	2, 49	relssdv 5788	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → ( I ↾ 𝑋) ⊆ 𝐴)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 ∈ wcel 2106 ∃wrex 3070 ⊆ wss 3948 ⟨cop 4634 class class class wbr 5148 ↦ cmpt 5231 I cid 5573 × cxp 5674 ^◡ccnv 5675 dom cdm 5676 ran crn 5677 ↾ cres 5678 “ cima 5679 Rel wrel 5681 Fun wfun 6537 ‘cfv 6543 (class class class)co 7408 0cc0 11109 ℝ^*cxr 11246 < clt 11247 ℝ⁺crp 12973 [,)cico 13325 PsMetcpsmet 20927

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 2703 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7724 ax-cnex 11165 ax-resscn 11166 ax-1cn 11167 ax-addrcl 11170 ax-rnegex 11180 ax-cnre 11182 ax-pre-lttri 11183 ax-pre-lttrn 11184

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 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-po 5588 df-so 5589 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7411 df-oprab 7412 df-mpo 7413 df-er 8702 df-map 8821 df-en 8939 df-dom 8940 df-sdom 8941 df-pnf 11249 df-mnf 11250 df-xr 11251 df-ltxr 11252 df-le 11253 df-rp 12974 df-ico 13329 df-psmet 20935

This theorem is referenced by: metustfbas 24065 metust 24066

W3C validator