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

Theorem psmetres2 23565
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 23557 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
21adantr 481 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
3 simpr 485 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑅𝑋)
4 xpss12 5629 . . . 4 ((𝑅𝑋𝑅𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
53, 3, 4syl2anc 584 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
62, 5fssresd 6686 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ*)
7 simpr 485 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑎𝑅)
87, 7ovresd 7493 . . . . 5 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑎𝐷𝑎))
9 simpll 764 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝐷 ∈ (PsMet‘𝑋))
103sselda 3931 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑎𝑋)
11 psmet0 23559 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎𝑋) → (𝑎𝐷𝑎) = 0)
129, 10, 11syl2anc 584 . . . . 5 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎𝐷𝑎) = 0)
138, 12eqtrd 2776 . . . 4 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0)
149ad2antrr 723 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝐷 ∈ (PsMet‘𝑋))
153ad2antrr 723 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑅𝑋)
1615sselda 3931 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑐𝑋)
1710ad2antrr 723 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑎𝑋)
183adantr 481 . . . . . . . . . 10 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑅𝑋)
1918sselda 3931 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑏𝑋)
2019adantr 481 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑏𝑋)
21 psmettri2 23560 . . . . . . . 8 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑐𝑋𝑎𝑋𝑏𝑋)) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
2214, 16, 17, 20, 21syl13anc 1371 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
237adantr 481 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑎𝑅)
24 simpr 485 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑏𝑅)
2523, 24ovresd 7493 . . . . . . . 8 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
2625adantr 481 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
27 simpr 485 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑐𝑅)
287ad2antrr 723 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑎𝑅)
2927, 28ovresd 7493 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑐𝐷𝑎))
3024adantr 481 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑏𝑅)
3127, 30ovresd 7493 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑐𝐷𝑏))
3229, 31oveq12d 7347 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)) = ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
3322, 26, 323brtr4d 5121 . . . . . 6 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3433ralrimiva 3139 . . . . 5 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → ∀𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3534ralrimiva 3139 . . . 4 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3613, 35jca 512 . . 3 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
3736ralrimiva 3139 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
38 elfvex 6857 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
3938adantr 481 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑋 ∈ V)
4039, 3ssexd 5265 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑅 ∈ V)
41 ispsmet 23555 . . 3 (𝑅 ∈ V → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ* ∧ ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
4240, 41syl 17 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ* ∧ ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
436, 37, 42mpbir2and 710 1 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1540  wcel 2105  wral 3061  Vcvv 3441  wss 3897   class class class wbr 5089   × cxp 5612  cres 5616  wf 6469  cfv 6473  (class class class)co 7329  0cc0 10964  *cxr 11101  cle 11103   +𝑒 cxad 12939  PsMetcpsmet 20679
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 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2707  ax-sep 5240  ax-nul 5247  ax-pow 5305  ax-pr 5369  ax-un 7642  ax-cnex 11020  ax-resscn 11021
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3404  df-v 3443  df-sbc 3727  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4269  df-if 4473  df-pw 4548  df-sn 4573  df-pr 4575  df-op 4579  df-uni 4852  df-br 5090  df-opab 5152  df-mpt 5173  df-id 5512  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-res 5626  df-iota 6425  df-fun 6475  df-fn 6476  df-f 6477  df-fv 6481  df-ov 7332  df-oprab 7333  df-mpo 7334  df-map 8680  df-xr 11106  df-psmet 20687
This theorem is referenced by:  restmetu  23824
  Copyright terms: Public domain W3C validator