| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xmeteq0 | Structured version Visualization version 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 | elfvdm 6916 | . . . . . 6 ⊢ (𝐷 ∈ (∞Met‘𝑋) → 𝑋 ∈ dom ∞Met) | |
| 2 | isxmet 24449 | . . . . . 6 ⊢ (𝑋 ∈ dom ∞Met → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))) | |
| 3 | 1, 2 | syl 18 | . . . . 5 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷 ∈ (∞Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦)))))) |
| 4 | 3 | ibi 270 | . . . 4 ⊢ (𝐷 ∈ (∞Met‘𝑋) → (𝐷:(𝑋 × 𝑋)⟶ℝ* ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))))) |
| 5 | simpl 487 | . . . . 5 ⊢ ((((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) | |
| 6 | 5 | 2ralimi 3141 | . . . 4 ⊢ (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) +𝑒 (𝑧𝐷𝑦))) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) |
| 7 | 4, 6 | simpl2im 512 | . . 3 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)) |
| 8 | oveq1 7418 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥𝐷𝑦) = (𝐴𝐷𝑦)) | |
| 9 | 8 | eqeq1d 2771 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑥𝐷𝑦) = 0 ↔ (𝐴𝐷𝑦) = 0)) |
| 10 | eqeq1 2773 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝑦 ↔ 𝐴 = 𝑦)) | |
| 11 | 9, 10 | bibi12d 348 | . . . 4 ⊢ (𝑥 = 𝐴 → (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ↔ ((𝐴𝐷𝑦) = 0 ↔ 𝐴 = 𝑦))) |
| 12 | oveq2 7419 | . . . . . 6 ⊢ (𝑦 = 𝐵 → (𝐴𝐷𝑦) = (𝐴𝐷𝐵)) | |
| 13 | 12 | eqeq1d 2771 | . . . . 5 ⊢ (𝑦 = 𝐵 → ((𝐴𝐷𝑦) = 0 ↔ (𝐴𝐷𝐵) = 0)) |
| 14 | eqeq2 2781 | . . . . 5 ⊢ (𝑦 = 𝐵 → (𝐴 = 𝑦 ↔ 𝐴 = 𝐵)) | |
| 15 | 13, 14 | bibi12d 348 | . . . 4 ⊢ (𝑦 = 𝐵 → (((𝐴𝐷𝑦) = 0 ↔ 𝐴 = 𝑦) ↔ ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
| 16 | 11, 15 | rspc2v 3601 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
| 17 | 7, 16 | syl5com 32 | . 2 ⊢ (𝐷 ∈ (∞Met‘𝑋) → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))) |
| 18 | 17 | 3impib 1132 | 1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∈ wcel 2149 ∀wral 3085 class class class wbr 5113 × cxp 5660 dom cdm 5662 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 0cc0 11099 ℝ*cxr 11241 ≤ cle 11243 +𝑒 cxad 13134 ∞Metcxmet 21475 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-fv 6545 df-ov 7414 df-oprab 7415 df-mpo 7416 df-map 8825 df-xr 11246 df-xmet 21483 |
| This theorem is referenced by: meteq0 24464 xmet0 24467 xmetgt0 24483 xmetres2 24486 prdsxmetlem 24493 imasf1oxmet 24500 xblss2 24527 xmseq0 24589 comet 24638 |
| Copyright terms: Public domain | W3C validator |