![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > xmeteq0 | GIF version |
Description: The value of an extended metric is zero iff its arguments are equal. (Contributed by Mario Carneiro, 20-Aug-2015.) |
Ref | Expression |
---|---|
xmeteq0 | ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | xmetrel 14511 | . . . . . . 7 ⊢ Rel ∞Met | |
2 | relelfvdm 5586 | . . . . . . 7 ⊢ ((Rel ∞Met ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝑋 ∈ dom ∞Met) | |
3 | 1, 2 | mpan 424 | . . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met) |
4 | isxmet 14513 | . . . . . 6 ⊢ (𝑋 ∈ dom ∞Met → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))) | |
5 | 3, 4 | syl 14 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))) |
6 | 5 | ibi 176 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))) |
7 | simpl 109 | . . . . 5 ⊢ ((((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) | |
8 | 7 | 2ralimi 2558 | . . . 4 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) |
9 | 6, 8 | simpl2im 386 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) |
10 | oveq1 5925 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐷𝑦) = (𝐴𝐷𝑦)) | |
11 | 10 | eqeq1d 2202 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐷𝑦) = 0 ↔ (𝐴𝐷𝑦) = 0)) |
12 | eqeq1 2200 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝐴 = 𝑦)) | |
13 | 11, 12 | bibi12d 235 | . . . 4 ⊢ (𝑥 = 𝐴 → (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ↔ ((𝐴𝐷𝑦) = 0 ↔ 𝐴 = 𝑦))) |
14 | oveq2 5926 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝐷𝑦) = (𝐴𝐷𝐵)) | |
15 | 14 | eqeq1d 2202 | . . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴𝐷𝑦) = 0 ↔ (𝐴𝐷𝐵) = 0)) |
16 | eqeq2 2203 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 = 𝑦 ↔ 𝐴 = 𝐵)) | |
17 | 15, 16 | bibi12d 235 | . . . 4 ⊢ (𝑦 = 𝐵 → (((𝐴𝐷𝑦) = 0 ↔ 𝐴 = 𝑦) ↔ ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
18 | 13, 17 | rspc2v 2877 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
19 | 9, 18 | syl5com 29 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
20 | 19 | 3impib 1203 | 1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ∀wral 2472 class class class wbr 4029 × cxp 4657 dom cdm 4659 Rel wrel 4664 ⟶wf 5250 ‘cfv 5254 (class class class)co 5918 0cc0 7872 ℝ*cxr 8053 ≤ cle 8055 +𝑒 cxad 9836 ∞Metcxmet 14032 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-iun 3914 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-f 5258 df-fv 5262 df-ov 5921 df-oprab 5922 df-mpo 5923 df-1st 6193 df-2nd 6194 df-map 6704 df-pnf 8056 df-mnf 8057 df-xr 8058 df-xmet 14040 |
This theorem is referenced by: meteq0 14528 xmet0 14531 xmetres2 14547 xblss2 14573 xmseq0 14636 comet 14667 xmetxp 14675 |
Copyright terms: Public domain | W3C validator |