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

Theorem psmetres2 24260
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.
StepHypRef Expression
1 psmetf 24252 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
21adantr 480 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
3 simpr 484 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑅𝑋)
4 xpss12 5639 . . . 4 ((𝑅𝑋𝑅𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
53, 3, 4syl2anc 584 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
62, 5fssresd 6701 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ*)
7 simpr 484 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑎𝑅)
87, 7ovresd 7525 . . . . 5 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑎𝐷𝑎))
9 simpll 766 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝐷 ∈ (PsMet‘𝑋))
103sselda 3933 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑎𝑋)
11 psmet0 24254 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎𝑋) → (𝑎𝐷𝑎) = 0)
129, 10, 11syl2anc 584 . . . . 5 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎𝐷𝑎) = 0)
138, 12eqtrd 2771 . . . 4 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0)
149ad2antrr 726 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝐷 ∈ (PsMet‘𝑋))
153ad2antrr 726 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑅𝑋)
1615sselda 3933 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑐𝑋)
1710ad2antrr 726 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑎𝑋)
183adantr 480 . . . . . . . . . 10 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑅𝑋)
1918sselda 3933 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑏𝑋)
2019adantr 480 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑏𝑋)
21 psmettri2 24255 . . . . . . . 8 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑐𝑋𝑎𝑋𝑏𝑋)) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
2214, 16, 17, 20, 21syl13anc 1374 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
237adantr 480 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑎𝑅)
24 simpr 484 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑏𝑅)
2523, 24ovresd 7525 . . . . . . . 8 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
2625adantr 480 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
27 simpr 484 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑐𝑅)
287ad2antrr 726 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑎𝑅)
2927, 28ovresd 7525 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑐𝐷𝑎))
3024adantr 480 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑏𝑅)
3127, 30ovresd 7525 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑐𝐷𝑏))
3229, 31oveq12d 7376 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)) = ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
3322, 26, 323brtr4d 5130 . . . . . 6 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3433ralrimiva 3128 . . . . 5 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → ∀𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3534ralrimiva 3128 . . . 4 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3613, 35jca 511 . . 3 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
3736ralrimiva 3128 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
38 elfvex 6869 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
3938adantr 480 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑋 ∈ V)
4039, 3ssexd 5269 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑅 ∈ V)
41 ispsmet 24250 . . 3 (𝑅 ∈ V → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ* ∧ ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
4240, 41syl 17 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ* ∧ ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
436, 37, 42mpbir2and 713 1 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  wral 3051  Vcvv 3440  wss 3901   class class class wbr 5098   × cxp 5622  cres 5626  wf 6488  cfv 6492  (class class class)co 7358  0cc0 11028  *cxr 11167  cle 11169   +𝑒 cxad 13026  PsMetcpsmet 21295
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-cnex 11084  ax-resscn 11085
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-mpt 5180  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-map 8767  df-xr 11172  df-psmet 21303
This theorem is referenced by:  restmetu  24516
  Copyright terms: Public domain W3C validator