| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > psmetdmdm | GIF version | ||
| Description: Recover the base set from a pseudometric. (Contributed by Thierry Arnoux, 7-Feb-2018.) |
| Ref | Expression |
|---|---|
| psmetdmdm | ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 = dom dom 𝐷) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-psmet 14880 | . . . . . 6 ⊢ PsMet = (𝑥 ∈ V ↦ {𝑑 ∈ (ℝ* ↑𝑚 (𝑥 × 𝑥)) ∣ ∀𝑦 ∈ 𝑥 ((𝑦𝑑𝑦) = 0 ∧ ∀𝑧 ∈ 𝑥 ∀𝑤 ∈ 𝑥 (𝑦𝑑𝑧) ≤ ((𝑤𝑑𝑦) +𝑒 (𝑤𝑑𝑧)))}) | |
| 2 | 1 | mptrcl 5788 | . . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 ∈ V) |
| 3 | ispsmet 15424 | . . . . . 6 ⊢ (𝑋 ∈ V → (𝐷 ∈ (PsMet‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ((𝑥𝐷𝑥) = 0 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))) | |
| 4 | 3 | biimpa 296 | . . . . 5 ⊢ ((𝑋 ∈ V ∧ 𝐷 ∈ (PsMet‘𝑋)) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ((𝑥𝐷𝑥) = 0 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))) |
| 5 | 2, 4 | mpancom 426 | . . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ((𝑥𝐷𝑥) = 0 ∧ ∀𝑦 ∈ 𝑋 ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))) |
| 6 | 5 | simpld 112 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*) |
| 7 | fdm 5539 | . . . 4 ⊢ (𝐷:(𝑋 × 𝑋)⟶ℝ* → dom 𝐷 = (𝑋 × 𝑋)) | |
| 8 | 7 | dmeqd 4983 | . . 3 ⊢ (𝐷:(𝑋 × 𝑋)⟶ℝ* → dom dom 𝐷 = dom (𝑋 × 𝑋)) |
| 9 | 6, 8 | syl 14 | . 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → dom dom 𝐷 = dom (𝑋 × 𝑋)) |
| 10 | dmxpid 5003 | . 2 ⊢ dom (𝑋 × 𝑋) = 𝑋 | |
| 11 | 9, 10 | eqtr2di 2288 | 1 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝑋 = dom dom 𝐷) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ∀wral 2528 {crab 2532 Vcvv 2821 class class class wbr 4130 × cxp 4772 dom cdm 4774 ⟶wf 5373 ‘cfv 5377 (class class class)co 6085 ↑𝑚 cmap 6922 0cc0 8179 ℝ*cxr 8359 ≤ cle 8361 +𝑒 cxad 10172 PsMetcpsmet 14872 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-ral 2533 df-rex 2534 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-fv 5385 df-ov 6088 df-oprab 6089 df-mpo 6090 df-map 6924 df-pnf 8362 df-mnf 8363 df-xr 8364 df-psmet 14880 |
| This theorem is used by: blfvalps 15486 |
| Copyright terms: Public domain | W3C validator |