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 12512 | . . . . . . 7 ⊢ Rel ∞Met | |
2 | relelfvdm 5453 | . . . . . . 7 ⊢ ((Rel ∞Met ∧ 𝐷 ∈ (∞Met‘𝑋)) → 𝑋 ∈ dom ∞Met) | |
3 | 1, 2 | mpan 420 | . . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met) |
4 | isxmet 12514 | . . . . . 6 ⊢ (𝑋 ∈ dom ∞Met → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))) | |
5 | 3, 4 | syl 14 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))) |
6 | 5 | ibi 175 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))) |
7 | simpl 108 | . . . . 5 ⊢ ((((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) | |
8 | 7 | 2ralimi 2496 | . . . 4 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) |
9 | 6, 8 | simpl2im 383 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) |
10 | oveq1 5781 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐷𝑦) = (𝐴𝐷𝑦)) | |
11 | 10 | eqeq1d 2148 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐷𝑦) = 0 ↔ (𝐴𝐷𝑦) = 0)) |
12 | eqeq1 2146 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝐴 = 𝑦)) | |
13 | 11, 12 | bibi12d 234 | . . . 4 ⊢ (𝑥 = 𝐴 → (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ↔ ((𝐴𝐷𝑦) = 0 ↔ 𝐴 = 𝑦))) |
14 | oveq2 5782 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝐷𝑦) = (𝐴𝐷𝐵)) | |
15 | 14 | eqeq1d 2148 | . . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴𝐷𝑦) = 0 ↔ (𝐴𝐷𝐵) = 0)) |
16 | eqeq2 2149 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 = 𝑦 ↔ 𝐴 = 𝐵)) | |
17 | 15, 16 | bibi12d 234 | . . . 4 ⊢ (𝑦 = 𝐵 → (((𝐴𝐷𝑦) = 0 ↔ 𝐴 = 𝑦) ↔ ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
18 | 13, 17 | rspc2v 2802 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
19 | 9, 18 | syl5com 29 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
20 | 19 | 3impib 1179 | 1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 962 = wceq 1331 ∈ wcel 1480 ∀wral 2416 class class class wbr 3929 × cxp 4537 dom cdm 4539 Rel wrel 4544 ⟶wf 5119 ‘cfv 5123 (class class class)co 5774 0cc0 7620 ℝ*cxr 7799 ≤ cle 7801 +𝑒 cxad 9557 ∞Metcxmet 12149 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 ax-sep 4046 ax-pow 4098 ax-pr 4131 ax-un 4355 ax-setind 4452 ax-cnex 7711 ax-resscn 7712 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2002 df-mo 2003 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-ne 2309 df-ral 2421 df-rex 2422 df-rab 2425 df-v 2688 df-sbc 2910 df-csb 3004 df-dif 3073 df-un 3075 df-in 3077 df-ss 3084 df-pw 3512 df-sn 3533 df-pr 3534 df-op 3536 df-uni 3737 df-iun 3815 df-br 3930 df-opab 3990 df-mpt 3991 df-id 4215 df-xp 4545 df-rel 4546 df-cnv 4547 df-co 4548 df-dm 4549 df-rn 4550 df-res 4551 df-ima 4552 df-iota 5088 df-fun 5125 df-fn 5126 df-f 5127 df-fv 5131 df-ov 5777 df-oprab 5778 df-mpo 5779 df-1st 6038 df-2nd 6039 df-map 6544 df-pnf 7802 df-mnf 7803 df-xr 7804 df-xmet 12157 |
This theorem is referenced by: meteq0 12529 xmet0 12532 xmetres2 12548 xblss2 12574 xmseq0 12637 comet 12668 xmetxp 12676 |
Copyright terms: Public domain | W3C validator |