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

Theorem isxmet 24649
Description: Express the predicate "𝐷 is an extended metric." (Contributed by Mario Carneiro, 20-Aug-2015.)
Assertion
Ref Expression
isxmet (𝑋 ∈ 𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦))))))
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 3471 . . . . 5 (𝑋 ∈ 𝐴 → 𝑋 ∈ V)
2 xpeq12 5675 . . . . . . . . 9 ((𝑡 = 𝑋 ∧ 𝑡 = 𝑋) → (𝑡 × 𝑡) = (𝑋 × 𝑋))
32anidms 577 . . . . . . . 8 (𝑡 = 𝑋 → (𝑡 × 𝑡) = (𝑋 × 𝑋))
43oveq2d 7437 . . . . . . 7 (𝑡 = 𝑋 → (ℝ* ↑m (𝑡 × 𝑡)) = (ℝ* ↑m (𝑋 × 𝑋)))
5 raleq 3316 . . . . . . . . . 10 (𝑡 = 𝑋 → (∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)) ↔ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦))))
65anbi2d 642 . . . . . . . . 9 (𝑡 = 𝑋 → ((((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦))) ↔ (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))))
76raleqbi1dv 3329 . . . . . . . 8 (𝑡 = 𝑋 → (∀𝑦 ∈ 𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦))) ↔ ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))))
87raleqbi1dv 3329 . . . . . . 7 (𝑡 = 𝑋 → (∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦))) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))))
94, 8rabeqbidv 3429 . . . . . 6 (𝑡 = 𝑋 → {𝑑 ∈ (ℝ* ↑m (𝑡 × 𝑡)) ∣ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))} = {𝑑 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))})
10 df-xmet 21677 . . . . . 6 ∞Met = (𝑡 ∈ V ↦ {𝑑 ∈ (ℝ* ↑m (𝑡 × 𝑡)) ∣ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))})
11 ovex 7454 . . . . . . 7 (ℝ* ↑m (𝑋 × 𝑋)) ∈ V
1211rabex 5299 . . . . . 6 {𝑑 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))} ∈ V
139, 10, 12fvmpt 6994 . . . . 5 (𝑋 ∈ V → (∞Met‘𝑋) = {𝑑 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))})
141, 13syl 18 . . . 4 (𝑋 ∈ 𝐴 → (∞Met‘𝑋) = {𝑑 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))})
1514eleq2d 2846 . . 3 (𝑋 ∈ 𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ 𝐷 ∈ {𝑑 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))}))
16 oveq 7427 . . . . . . . 8 (𝑑 = 𝐷 → (𝑥𝑑𝑦) = (𝑥𝐷𝑦))
1716eqeq1d 2762 . . . . . . 7 (𝑑 = 𝐷 → ((𝑥𝑑𝑦) = 0 ↔ (𝑥𝐷𝑦) = 0))
1817bibi1d 346 . . . . . 6 (𝑑 = 𝐷 → (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ↔ ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)))
19 oveq 7427 . . . . . . . . 9 (𝑑 = 𝐷 → (𝑧𝑑𝑥) = (𝑧𝐷𝑥))
20 oveq 7427 . . . . . . . . 9 (𝑑 = 𝐷 → (𝑧𝑑𝑦) = (𝑧𝐷𝑦))
2119, 20oveq12d 7439 . . . . . . . 8 (𝑑 = 𝐷 → ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)) = ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦)))
2216, 21breq12d 5115 . . . . . . 7 (𝑑 = 𝐷 → ((𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)) ↔ (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦))))
2322ralbidv 3185 . . . . . 6 (𝑑 = 𝐷 → (∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)) ↔ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦))))
2418, 23anbi12d 644 . . . . 5 (𝑑 = 𝐷 → ((((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦))) ↔ (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦)))))
25242ralbidv 3226 . . . 4 (𝑑 = 𝐷 → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦))) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦)))))
2625elrab 3644 . . 3 (𝐷 ∈ {𝑑 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) +e (𝑧𝑑𝑦)))} ↔ (𝐷 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦)))))
2715, 26bitrdi 290 . 2 (𝑋 ∈ 𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦))))))
28 xrex 13119 . . . 4 ℝ* ∈ V
29 sqxpexg 7770 . . . 4 (𝑋 ∈ 𝐴 → (𝑋 × 𝑋) ∈ V)
30 elmapg 8863 . . . 4 ((ℝ* ∈ V ∧ (𝑋 × 𝑋) ∈ V) → (𝐷 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ*))
3128, 29, 30sylancr 599 . . 3 (𝑋 ∈ 𝐴 → (𝐷 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ*))
3231anbi1d 643 . 2 (𝑋 ∈ 𝐴 → ((𝐷 ∈ (ℝ* ↑m (𝑋 × 𝑋)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦)))) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦))))))
3327, 32bitrd 282 1 (𝑋 ∈ 𝐴 → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +e (𝑧𝐷𝑦))))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2144  ∀wral 3076  {crab 3412  Vcvv 3450   class class class wbr 5102   × cxp 5648  ⟶wf 6535  ‘cfv 6539  (class class class)co 7421   ↑m cmap 8851  0cc0 11204  ℝ*cxr 11346   ≤ cle 11348   +e cxad 13243  ∞Metcxmet 21669
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752  ax-cnex 11260  ax-resscn 11261
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-fv 6547  df-ov 7424  df-oprab 7425  df-mpo 7426  df-map 8853  df-xr 11351  df-xmet 21677
This theorem is used by:  isxmetd  24651  xmetf  24654  ismet2  24658  xmeteq0  24663  xmettri2  24665  imasf1oxmet  24700  pstmxmet  34576
  Copyright terms: Public domain W3C validator