psmetres2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > psmetres2		GIF version

Theorem psmetres2 14747

Description: Restriction of a pseudometric. (Contributed by Thierry Arnoux, 11-Feb-2018.)

**Assertion**
Ref	Expression
psmetres2	⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → (𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅))

Proof of Theorem psmetres2 Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑒 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		psmetf 14739	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ^*)
2	1	adantr 276	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ^*)
3		simpr 110	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → 𝑅 ⊆ 𝑋)
4		xpss12 4781	. . . 4 ⊢ ((𝑅 ⊆ 𝑋 ∧ 𝑅 ⊆ 𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
5	3, 3, 4	syl2anc 411	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
6	2, 5	fssresd 5451	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → (𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ^*)
7		simpr 110	. . . . . 6 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → 𝑎 ∈ 𝑅)
8	7, 7	ovresd 6086	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑎𝐷𝑎))
9		simpll 527	. . . . . 6 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → 𝐷 ∈ (PsMet‘𝑋))
10	3	sselda 3192	. . . . . 6 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → 𝑎 ∈ 𝑋)
11		psmet0 14741	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ 𝑋) → (𝑎𝐷𝑎) = 0)
12	9, 10, 11	syl2anc 411	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → (𝑎𝐷𝑎) = 0)
13	8, 12	eqtrd 2237	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0)
14	9	ad2antrr 488	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝐷 ∈ (PsMet‘𝑋))
15	3	ad2antrr 488	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → 𝑅 ⊆ 𝑋)
16	15	sselda 3192	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑐 ∈ 𝑋)
17	10	ad2antrr 488	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑎 ∈ 𝑋)
18	3	adantr 276	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → 𝑅 ⊆ 𝑋)
19	18	sselda 3192	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → 𝑏 ∈ 𝑋)
20	19	adantr 276	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑏 ∈ 𝑋)
21		psmettri2 14742	. . . . . . . 8 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑐 ∈ 𝑋 ∧ 𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +_𝑒 (𝑐𝐷𝑏)))
22	14, 16, 17, 20, 21	syl13anc 1251	. . . . . . 7 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +_𝑒 (𝑐𝐷𝑏)))
23	7	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → 𝑎 ∈ 𝑅)
24		simpr 110	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → 𝑏 ∈ 𝑅)
25	23, 24	ovresd 6086	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
26	25	adantr 276	. . . . . . 7 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
27		simpr 110	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑐 ∈ 𝑅)
28	7	ad2antrr 488	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑎 ∈ 𝑅)
29	27, 28	ovresd 6086	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑐𝐷𝑎))
30	24	adantr 276	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑏 ∈ 𝑅)
31	27, 30	ovresd 6086	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑐𝐷𝑏))
32	29, 31	oveq12d 5961	. . . . . . 7 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)) = ((𝑐𝐷𝑎) +_𝑒 (𝑐𝐷𝑏)))
33	22, 26, 32	3brtr4d 4075	. . . . . 6 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
34	33	ralrimiva 2578	. . . . 5 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
35	34	ralrimiva 2578	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
36	13, 35	jca 306	. . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
37	36	ralrimiva 2578	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → ∀𝑎 ∈ 𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
38		df-psmet 14247	. . . . . 6 ⊢ PsMet = (𝑎 ∈ V ↦ {𝑏 ∈ (ℝ^* ↑_𝑚 (𝑎 × 𝑎)) ∣ ∀𝑐 ∈ 𝑎 ((𝑐𝑏𝑐) = 0 ∧ ∀𝑑 ∈ 𝑎 ∀𝑒 ∈ 𝑎 (𝑐𝑏𝑑) ≤ ((𝑒𝑏𝑐) +_𝑒 (𝑒𝑏𝑑)))})
39	38	mptrcl 5661	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
40	39	adantr 276	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → 𝑋 ∈ V)
41	40, 3	ssexd 4183	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → 𝑅 ∈ V)
42		ispsmet 14737	. . 3 ⊢ (𝑅 ∈ V → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ^* ∧ ∀𝑎 ∈ 𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
43	41, 42	syl 14	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ^* ∧ ∀𝑎 ∈ 𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
44	6, 37, 43	mpbir2and 946	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → (𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1372 ∈ wcel 2175 ∀wral 2483 {crab 2487 Vcvv 2771 ⊆ wss 3165 class class class wbr 4043 × cxp 4672 ↾ cres 4676 ⟶wf 5266 ‘cfv 5270 (class class class)co 5943 ↑_𝑚 cmap 6734 0cc0 7924 ℝ^*cxr 8105 ≤ cle 8107 +_𝑒 cxad 9891 PsMetcpsmet 14239

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-setind 4584 ax-cnex 8015 ax-resscn 8016

This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-ral 2488 df-rex 2489 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-br 4044 df-opab 4105 df-mpt 4106 df-id 4339 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-rn 4685 df-res 4686 df-ima 4687 df-iota 5231 df-fun 5272 df-fn 5273 df-f 5274 df-fv 5278 df-ov 5946 df-oprab 5947 df-mpo 5948 df-map 6736 df-pnf 8108 df-mnf 8109 df-xr 8110 df-psmet 14247

This theorem is referenced by: (None)

W3C validator