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

Theorem psmetres2 12502
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 12494 . . . 4 (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
21adantr 274 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*)
3 simpr 109 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑅𝑋)
4 xpss12 4646 . . . 4 ((𝑅𝑋𝑅𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
53, 3, 4syl2anc 408 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝑅 × 𝑅) ⊆ (𝑋 × 𝑋))
62, 5fssresd 5299 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ*)
7 simpr 109 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑎𝑅)
87, 7ovresd 5911 . . . . 5 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑎𝐷𝑎))
9 simpll 518 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝐷 ∈ (PsMet‘𝑋))
103sselda 3097 . . . . . 6 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑎𝑋)
11 psmet0 12496 . . . . . 6 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎𝑋) → (𝑎𝐷𝑎) = 0)
129, 10, 11syl2anc 408 . . . . 5 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎𝐷𝑎) = 0)
138, 12eqtrd 2172 . . . 4 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0)
149ad2antrr 479 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝐷 ∈ (PsMet‘𝑋))
153ad2antrr 479 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑅𝑋)
1615sselda 3097 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑐𝑋)
1710ad2antrr 479 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑎𝑋)
183adantr 274 . . . . . . . . . 10 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → 𝑅𝑋)
1918sselda 3097 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑏𝑋)
2019adantr 274 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑏𝑋)
21 psmettri2 12497 . . . . . . . 8 ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝑐𝑋𝑎𝑋𝑏𝑋)) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
2214, 16, 17, 20, 21syl13anc 1218 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎𝐷𝑏) ≤ ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
237adantr 274 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑎𝑅)
24 simpr 109 . . . . . . . . 9 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → 𝑏𝑅)
2523, 24ovresd 5911 . . . . . . . 8 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
2625adantr 274 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑎𝐷𝑏))
27 simpr 109 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑐𝑅)
287ad2antrr 479 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑎𝑅)
2927, 28ovresd 5911 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) = (𝑐𝐷𝑎))
3024adantr 274 . . . . . . . . 9 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → 𝑏𝑅)
3127, 30ovresd 5911 . . . . . . . 8 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏) = (𝑐𝐷𝑏))
3229, 31oveq12d 5792 . . . . . . 7 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)) = ((𝑐𝐷𝑎) +𝑒 (𝑐𝐷𝑏)))
3322, 26, 323brtr4d 3960 . . . . . 6 (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) ∧ 𝑐𝑅) → (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3433ralrimiva 2505 . . . . 5 ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) ∧ 𝑏𝑅) → ∀𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3534ralrimiva 2505 . . . 4 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏)))
3613, 35jca 304 . . 3 (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) ∧ 𝑎𝑅) → ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
3736ralrimiva 2505 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))
38 df-psmet 12156 . . . . . 6 PsMet = (𝑎 ∈ V ↦ {𝑏 ∈ (ℝ*𝑚 (𝑎 × 𝑎)) ∣ ∀𝑐𝑎 ((𝑐𝑏𝑐) = 0 ∧ ∀𝑑𝑎𝑒𝑎 (𝑐𝑏𝑑) ≤ ((𝑒𝑏𝑐) +𝑒 (𝑒𝑏𝑑)))})
3938mptrcl 5503 . . . . 5 (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V)
4039adantr 274 . . . 4 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑋 ∈ V)
4140, 3ssexd 4068 . . 3 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → 𝑅 ∈ V)
42 ispsmet 12492 . . 3 (𝑅 ∈ V → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ* ∧ ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
4341, 42syl 14 . 2 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → ((𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅) ↔ ((𝐷 ↾ (𝑅 × 𝑅)):(𝑅 × 𝑅)⟶ℝ* ∧ ∀𝑎𝑅 ((𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑎) = 0 ∧ ∀𝑏𝑅𝑐𝑅 (𝑎(𝐷 ↾ (𝑅 × 𝑅))𝑏) ≤ ((𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑎) +𝑒 (𝑐(𝐷 ↾ (𝑅 × 𝑅))𝑏))))))
446, 37, 43mpbir2and 928 1 ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑅𝑋) → (𝐷 ↾ (𝑅 × 𝑅)) ∈ (PsMet‘𝑅))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104   = wceq 1331  wcel 1480  wral 2416  {crab 2420  Vcvv 2686  wss 3071   class class class wbr 3929   × cxp 4537  cres 4541  wf 5119  cfv 5123  (class class class)co 5774  𝑚 cmap 6542  0cc0 7620  *cxr 7799  cle 7801   +𝑒 cxad 9557  PsMetcpsmet 12148
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 603  ax-in2 604  ax-io 698  ax-5 1423  ax-7 1424  ax-gen 1425  ax-ie1 1469  ax-ie2 1470  ax-8 1482  ax-10 1483  ax-11 1484  ax-i12 1485  ax-bndl 1486  ax-4 1487  ax-13 1491  ax-14 1492  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-ext 2121  ax-sep 4046  ax-pow 4098  ax-pr 4131  ax-un 4355  ax-setind 4452  ax-cnex 7711  ax-resscn 7712
This theorem depends on definitions:  df-bi 116  df-3an 964  df-tru 1334  df-fal 1337  df-nf 1437  df-sb 1736  df-eu 2002  df-mo 2003  df-clab 2126  df-cleq 2132  df-clel 2135  df-nfc 2270  df-ne 2309  df-ral 2421  df-rex 2422  df-rab 2425  df-v 2688  df-sbc 2910  df-csb 3004  df-dif 3073  df-un 3075  df-in 3077  df-ss 3084  df-pw 3512  df-sn 3533  df-pr 3534  df-op 3536  df-uni 3737  df-br 3930  df-opab 3990  df-mpt 3991  df-id 4215  df-xp 4545  df-rel 4546  df-cnv 4547  df-co 4548  df-dm 4549  df-rn 4550  df-res 4551  df-ima 4552  df-iota 5088  df-fun 5125  df-fn 5126  df-f 5127  df-fv 5131  df-ov 5777  df-oprab 5778  df-mpo 5779  df-map 6544  df-pnf 7802  df-mnf 7803  df-xr 7804  df-psmet 12156
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator