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

Theorem isxmet 22928
Description: Express the predicate "𝐷 is an extended metric." (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
isxmet (𝑋𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐷   𝑥,𝑋,𝑦,𝑧
Allowed substitution hints:   𝐴(𝑥,𝑦,𝑧)

Proof of Theorem isxmet
Dummy variables 𝑑 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elex 3512 . . . . 5 (𝑋𝐴𝑋 ∈ V)
2 xpeq12 5574 . . . . . . . . 9 ((𝑡 = 𝑋𝑡 = 𝑋) → (𝑡 × 𝑡) = (𝑋 × 𝑋))
32anidms 569 . . . . . . . 8 (𝑡 = 𝑋 → (𝑡 × 𝑡) = (𝑋 × 𝑋))
43oveq2d 7166 . . . . . . 7 (𝑡 = 𝑋 → (ℝ*m (𝑡 × 𝑡)) = (ℝ*m (𝑋 × 𝑋)))
5 raleq 3405 . . . . . . . . . 10 (𝑡 = 𝑋 → (∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)) ↔ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))))
65anbi2d 630 . . . . . . . . 9 (𝑡 = 𝑋 → ((((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))))
76raleqbi1dv 3403 . . . . . . . 8 (𝑡 = 𝑋 → (∀𝑦𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ ∀𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))))
87raleqbi1dv 3403 . . . . . . 7 (𝑡 = 𝑋 → (∀𝑥𝑡𝑦𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))))
94, 8rabeqbidv 3485 . . . . . 6 (𝑡 = 𝑋 → {𝑑 ∈ (ℝ*m (𝑡 × 𝑡)) ∣ ∀𝑥𝑡𝑦𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))} = {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))})
10 df-xmet 20532 . . . . . 6 ∞Met = (𝑡 ∈ V ↦ {𝑑 ∈ (ℝ*m (𝑡 × 𝑡)) ∣ ∀𝑥𝑡𝑦𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))})
11 ovex 7183 . . . . . . 7 (ℝ*m (𝑋 × 𝑋)) ∈ V
1211rabex 5227 . . . . . 6 {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))} ∈ V
139, 10, 12fvmpt 6762 . . . . 5 (𝑋 ∈ V → (∞Met‘𝑋) = {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))})
141, 13syl 17 . . . 4 (𝑋𝐴 → (∞Met‘𝑋) = {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))})
1514eleq2d 2898 . . 3 (𝑋𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ 𝐷 ∈ {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))}))
16 oveq 7156 . . . . . . . 8 (𝑑 = 𝐷 → (𝑥𝑑𝑦) = (𝑥𝐷𝑦))
1716eqeq1d 2823 . . . . . . 7 (𝑑 = 𝐷 → ((𝑥𝑑𝑦) = 0 ↔ (𝑥𝐷𝑦) = 0))
1817bibi1d 346 . . . . . 6 (𝑑 = 𝐷 → (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ↔ ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)))
19 oveq 7156 . . . . . . . . 9 (𝑑 = 𝐷 → (𝑧𝑑𝑥) = (𝑧𝐷𝑥))
20 oveq 7156 . . . . . . . . 9 (𝑑 = 𝐷 → (𝑧𝑑𝑦) = (𝑧𝐷𝑦))
2119, 20oveq12d 7168 . . . . . . . 8 (𝑑 = 𝐷 → ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)) = ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))
2216, 21breq12d 5071 . . . . . . 7 (𝑑 = 𝐷 → ((𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)) ↔ (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))
2322ralbidv 3197 . . . . . 6 (𝑑 = 𝐷 → (∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)) ↔ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))
2418, 23anbi12d 632 . . . . 5 (𝑑 = 𝐷 → ((((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
25242ralbidv 3199 . . . 4 (𝑑 = 𝐷 → (∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
2625elrab 3679 . . 3 (𝐷 ∈ {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))} ↔ (𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
2715, 26syl6bb 289 . 2 (𝑋𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
28 xrex 12380 . . . 4 * ∈ V
29 sqxpexg 7471 . . . 4 (𝑋𝐴 → (𝑋 × 𝑋) ∈ V)
30 elmapg 8413 . . . 4 ((ℝ* ∈ V ∧ (𝑋 × 𝑋) ∈ V) → (𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ*))
3128, 29, 30sylancr 589 . . 3 (𝑋𝐴 → (𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ*))
3231anbi1d 631 . 2 (𝑋𝐴 → ((𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
3327, 32bitrd 281 1 (𝑋𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1533  wcel 2110  wral 3138  {crab 3142  Vcvv 3494   class class class wbr 5058   × cxp 5547  wf 6345  cfv 6349  (class class class)co 7150  m cmap 8400  0cc0 10531  *cxr 10668  cle 10670   +𝑒 cxad 12499  ∞Metcxmet 20524
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-sep 5195  ax-nul 5202  ax-pow 5258  ax-pr 5321  ax-un 7455  ax-cnex 10587  ax-resscn 10588
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-sbc 3772  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4561  df-pr 4563  df-op 4567  df-uni 4832  df-br 5059  df-opab 5121  df-mpt 5139  df-id 5454  df-xp 5555  df-rel 5556  df-cnv 5557  df-co 5558  df-dm 5559  df-rn 5560  df-iota 6308  df-fun 6351  df-fn 6352  df-f 6353  df-fv 6357  df-ov 7153  df-oprab 7154  df-mpo 7155  df-map 8402  df-xr 10673  df-xmet 20532
This theorem is referenced by:  isxmetd  22930  xmetf  22933  ismet2  22937  xmeteq0  22942  xmettri2  22944  imasf1oxmet  22979  pstmxmet  31132
  Copyright terms: Public domain W3C validator