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

Theorem isxmet 24364
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 3474 . . . . 5 (𝑋𝐴𝑋 ∈ V)
2 xpeq12 5670 . . . . . . . . 9 ((𝑡 = 𝑋𝑡 = 𝑋) → (𝑡 × 𝑡) = (𝑋 × 𝑋))
32anidms 574 . . . . . . . 8 (𝑡 = 𝑋 → (𝑡 × 𝑡) = (𝑋 × 𝑋))
43oveq2d 7408 . . . . . . 7 (𝑡 = 𝑋 → (ℝ*m (𝑡 × 𝑡)) = (ℝ*m (𝑋 × 𝑋)))
5 raleq 3316 . . . . . . . . . 10 (𝑡 = 𝑋 → (∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)) ↔ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))))
65anbi2d 639 . . . . . . . . 9 (𝑡 = 𝑋 → ((((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))))
76raleqbi1dv 3329 . . . . . . . 8 (𝑡 = 𝑋 → (∀𝑦𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ ∀𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))))
87raleqbi1dv 3329 . . . . . . 7 (𝑡 = 𝑋 → (∀𝑥𝑡𝑦𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))))
94, 8rabeqbidv 3431 . . . . . 6 (𝑡 = 𝑋 → {𝑑 ∈ (ℝ*m (𝑡 × 𝑡)) ∣ ∀𝑥𝑡𝑦𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))} = {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))})
10 df-xmet 21397 . . . . . 6 ∞Met = (𝑡 ∈ V ↦ {𝑑 ∈ (ℝ*m (𝑡 × 𝑡)) ∣ ∀𝑥𝑡𝑦𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))})
11 ovex 7425 . . . . . . 7 (ℝ*m (𝑋 × 𝑋)) ∈ V
1211rabex 5294 . . . . . 6 {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))} ∈ V
139, 10, 12fvmpt 6971 . . . . 5 (𝑋 ∈ V → (∞Met‘𝑋) = {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))})
141, 13syl 17 . . . 4 (𝑋𝐴 → (∞Met‘𝑋) = {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))})
1514eleq2d 2847 . . 3 (𝑋𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ 𝐷 ∈ {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))}))
16 oveq 7398 . . . . . . . 8 (𝑑 = 𝐷 → (𝑥𝑑𝑦) = (𝑥𝐷𝑦))
1716eqeq1d 2763 . . . . . . 7 (𝑑 = 𝐷 → ((𝑥𝑑𝑦) = 0 ↔ (𝑥𝐷𝑦) = 0))
1817bibi1d 345 . . . . . 6 (𝑑 = 𝐷 → (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ↔ ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)))
19 oveq 7398 . . . . . . . . 9 (𝑑 = 𝐷 → (𝑧𝑑𝑥) = (𝑧𝐷𝑥))
20 oveq 7398 . . . . . . . . 9 (𝑑 = 𝐷 → (𝑧𝑑𝑦) = (𝑧𝐷𝑦))
2119, 20oveq12d 7410 . . . . . . . 8 (𝑑 = 𝐷 → ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)) = ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))
2216, 21breq12d 5112 . . . . . . 7 (𝑑 = 𝐷 → ((𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)) ↔ (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))
2322ralbidv 3184 . . . . . 6 (𝑑 = 𝐷 → (∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)) ↔ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))
2418, 23anbi12d 641 . . . . 5 (𝑑 = 𝐷 → ((((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
25242ralbidv 3225 . . . 4 (𝑑 = 𝐷 → (∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦))) ↔ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
2625elrab 3650 . . 3 (𝐷 ∈ {𝑑 ∈ (ℝ*m (𝑋 × 𝑋)) ∣ ∀𝑥𝑋𝑦𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +𝑒 (𝑧𝑑𝑦)))} ↔ (𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))
2715, 26bitrdi 289 . 2 (𝑋𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
28 xrex 12985 . . . 4 * ∈ V
29 sqxpexg 7734 . . . 4 (𝑋𝐴 → (𝑋 × 𝑋) ∈ V)
30 elmapg 8816 . . . 4 ((ℝ* ∈ V ∧ (𝑋 × 𝑋) ∈ V) → (𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ*))
3128, 29, 30sylancr 596 . . 3 (𝑋𝐴 → (𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ*))
3231anbi1d 640 . 2 (𝑋𝐴 → ((𝐷 ∈ (ℝ*m (𝑋 × 𝑋)) ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
3327, 32bitrd 281 1 (𝑋𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥𝑋𝑦𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1559  wcel 2141  wral 3075  {crab 3413  Vcvv 3453   class class class wbr 5099   × cxp 5643  wf 6513  cfv 6517  (class class class)co 7392  m cmap 8803  0cc0 11070  *cxr 11212  cle 11214   +𝑒 cxad 13109  ∞Metcxmet 21389
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5245  ax-nul 5255  ax-pow 5321  ax-pr 5389  ax-un 7714  ax-cnex 11126  ax-resscn 11127
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-sbc 3745  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-opab 5162  df-mpt 5181  df-id 5540  df-xp 5651  df-rel 5652  df-cnv 5653  df-co 5654  df-dm 5655  df-rn 5656  df-iota 6473  df-fun 6519  df-fn 6520  df-f 6521  df-fv 6525  df-ov 7395  df-oprab 7396  df-mpo 7397  df-map 8805  df-xr 11217  df-xmet 21397
This theorem is referenced by:  isxmetd  24366  xmetf  24369  ismet2  24373  xmeteq0  24378  xmettri2  24380  imasf1oxmet  24415  pstmxmet  34155
  Copyright terms: Public domain W3C validator