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

Theorem psmetres2 24253
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 24245 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
21adantr 480 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
3 simpr 484 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑅𝑋)
4 xpss12 5669 . . . 4 ((𝑅𝑋𝑅𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
53, 3, 4syl2anc 584 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
62, 5fssresd 6745 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ*)
7 simpr 484 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑎𝑅)
87, 7ovresd 7574 . . . . 5 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑎𝐷𝑎))
9 simpll 766 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝐷 ∈ (PsMet‘𝑋))
103sselda 3958 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑎𝑋)
11 psmet0 24247 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎𝑋) → (𝑎𝐷𝑎) = 0)
129, 10, 11syl2anc 584 . . . . 5 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎𝐷𝑎) = 0)
138, 12eqtrd 2770 . . . 4 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0)
149ad2antrr 726 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝐷 ∈ (PsMet‘𝑋))
153ad2antrr 726 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑅𝑋)
1615sselda 3958 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑐𝑋)
1710ad2antrr 726 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑎𝑋)
183adantr 480 . . . . . . . . . 10 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑅𝑋)
1918sselda 3958 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑏𝑋)
2019adantr 480 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑏𝑋)
21 psmettri2 24248 . . . . . . . 8 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑐𝑋𝑎𝑋𝑏𝑋)) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
2214, 16, 17, 20, 21syl13anc 1374 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
237adantr 480 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑎𝑅)
24 simpr 484 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑏𝑅)
2523, 24ovresd 7574 . . . . . . . 8 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
2625adantr 480 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
27 simpr 484 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑐𝑅)
287ad2antrr 726 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑎𝑅)
2927, 28ovresd 7574 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑐𝐷𝑎))
3024adantr 480 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑏𝑅)
3127, 30ovresd 7574 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑐𝐷𝑏))
3229, 31oveq12d 7423 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)) = ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
3322, 26, 323brtr4d 5151 . . . . . 6 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3433ralrimiva 3132 . . . . 5 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → ∀𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3534ralrimiva 3132 . . . 4 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3613, 35jca 511 . . 3 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
3736ralrimiva 3132 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
38 elfvex 6914 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
3938adantr 480 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑋 ∈ V)
4039, 3ssexd 5294 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑅 ∈ V)
41 ispsmet 24243 . . 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 1540  wcel 2108  wral 3051  Vcvv 3459  wss 3926   class class class wbr 5119   × cxp 5652  cres 5656  wf 6527  cfv 6531  (class class class)co 7405  0cc0 11129  *cxr 11268  cle 11270   +𝑒 cxad 13126  PsMetcpsmet 21299
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 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-sbc 3766  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-fv 6539  df-ov 7408  df-oprab 7409  df-mpo 7410  df-map 8842  df-xr 11273  df-psmet 21307
This theorem is referenced by:  restmetu  24509
  Copyright terms: Public domain W3C validator