psmetres2 - Intuitionistic Logic Explorer

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

Theorem psmetres2 15022

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 15014	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ^*)
2	1	adantr 276	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ^*)
3		simpr 110	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → 𝑅 ⊆ 𝑋)
4		xpss12 4826	. . . 4 ⊢ ((𝑅 ⊆ 𝑋 ∧ 𝑅 ⊆ 𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
5	3, 3, 4	syl2anc 411	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
6	2, 5	fssresd 5504	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → (𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ^*)
7		simpr 110	. . . . . 6 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → 𝑎 ∈ 𝑅)
8	7, 7	ovresd 6152	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑎𝐷𝑎))
9		simpll 527	. . . . . 6 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → 𝐷 ∈ (PsMet‘𝑋))
10	3	sselda 3224	. . . . . 6 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → 𝑎 ∈ 𝑋)
11		psmet0 15016	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ 𝑋) → (𝑎𝐷𝑎) = 0)
12	9, 10, 11	syl2anc 411	. . . . 5 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → (𝑎𝐷𝑎) = 0)
13	8, 12	eqtrd 2262	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0)
14	9	ad2antrr 488	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝐷 ∈ (PsMet‘𝑋))
15	3	ad2antrr 488	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → 𝑅 ⊆ 𝑋)
16	15	sselda 3224	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑐 ∈ 𝑋)
17	10	ad2antrr 488	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑎 ∈ 𝑋)
18	3	adantr 276	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → 𝑅 ⊆ 𝑋)
19	18	sselda 3224	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → 𝑏 ∈ 𝑋)
20	19	adantr 276	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑏 ∈ 𝑋)
21		psmettri2 15017	. . . . . . . 8 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑐 ∈ 𝑋 ∧ 𝑎 ∈ 𝑋 ∧ 𝑏 ∈ 𝑋)) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +_𝑒 (𝑐𝐷𝑏)))
22	14, 16, 17, 20, 21	syl13anc 1273	. . . . . . 7 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +_𝑒 (𝑐𝐷𝑏)))
23	7	adantr 276	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → 𝑎 ∈ 𝑅)
24		simpr 110	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → 𝑏 ∈ 𝑅)
25	23, 24	ovresd 6152	. . . . . . . 8 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
26	25	adantr 276	. . . . . . 7 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
27		simpr 110	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑐 ∈ 𝑅)
28	7	ad2antrr 488	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑎 ∈ 𝑅)
29	27, 28	ovresd 6152	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑐𝐷𝑎))
30	24	adantr 276	. . . . . . . . 9 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → 𝑏 ∈ 𝑅)
31	27, 30	ovresd 6152	. . . . . . . 8 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑐𝐷𝑏))
32	29, 31	oveq12d 6025	. . . . . . 7 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)) = ((𝑐𝐷𝑎) +_𝑒 (𝑐𝐷𝑏)))
33	22, 26, 32	3brtr4d 4115	. . . . . 6 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) ∧ 𝑐 ∈ 𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
34	33	ralrimiva 2603	. . . . 5 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) ∧ 𝑏 ∈ 𝑅) → ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
35	34	ralrimiva 2603	. . . 4 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
36	13, 35	jca 306	. . 3 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) ∧ 𝑎 ∈ 𝑅) → ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
37	36	ralrimiva 2603	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → ∀𝑎 ∈ 𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
38		df-psmet 14522	. . . . . 6 ⊢ PsMet = (𝑎 ∈ V ↦ {𝑏 ∈ (ℝ^* ↑_𝑚 (𝑎 × 𝑎)) ∣ ∀𝑐 ∈ 𝑎 ((𝑐𝑏𝑐) = 0 ∧ ∀𝑑 ∈ 𝑎 ∀𝑒 ∈ 𝑎 (𝑐𝑏𝑑) ≤ ((𝑒𝑏𝑐) +_𝑒 (𝑒𝑏𝑑)))})
39	38	mptrcl 5719	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
40	39	adantr 276	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → 𝑋 ∈ V)
41	40, 3	ssexd 4224	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → 𝑅 ∈ V)
42		ispsmet 15012	. . 3 ⊢ (𝑅 ∈ V → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ^* ∧ ∀𝑎 ∈ 𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
43	41, 42	syl 14	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ^* ∧ ∀𝑎 ∈ 𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏 ∈ 𝑅 ∀𝑐 ∈ 𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +_𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
44	6, 37, 43	mpbir2and 950	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅 ⊆ 𝑋) → (𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1395 ∈ wcel 2200 ∀wral 2508 {crab 2512 Vcvv 2799 ⊆ wss 3197 class class class wbr 4083 × cxp 4717 ↾ cres 4721 ⟶wf 5314 ‘cfv 5318 (class class class)co 6007 ↑_𝑚 cmap 6803 0cc0 8010 ℝ^*cxr 8191 ≤ cle 8193 +_𝑒 cxad 9978 PsMetcpsmet 14514

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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 ax-un 4524 ax-setind 4629 ax-cnex 8101 ax-resscn 8102

This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4384 df-xp 4725 df-rel 4726 df-cnv 4727 df-co 4728 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-iota 5278 df-fun 5320 df-fn 5321 df-f 5322 df-fv 5326 df-ov 6010 df-oprab 6011 df-mpo 6012 df-map 6805 df-pnf 8194 df-mnf 8195 df-xr 8196 df-psmet 14522

This theorem is referenced by: (None)

W3C validator