xmetgt0 - Metamath Proof Explorer

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

Theorem xmetgt0 24257

Description: The distance function of an extended metric space is positive for unequal points. (Contributed by Mario Carneiro, 20-Aug-2015.)

**Assertion**
Ref	Expression
xmetgt0	⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ≠ 𝐵 ↔ 0 < (𝐴𝐷𝐵)))

**Proof of Theorem xmetgt0**
Step	Hyp	Ref	Expression
1		xmetge0 24243	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 0 ≤ (𝐴𝐷𝐵))
2	1	biantrud 531	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) ≤ 0 ↔ ((𝐴𝐷𝐵) ≤ 0 ∧ 0 ≤ (𝐴𝐷𝐵))))
3		xmetcl 24230	. . . . 5 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴𝐷𝐵) ∈ ℝ^*)
4		0xr 11285	. . . . 5 ⊢ 0 ∈ ℝ^*
5		xrletri3 13159	. . . . 5 ⊢ (((𝐴𝐷𝐵) ∈ ℝ^* ∧ 0 ∈ ℝ^*) → ((𝐴𝐷𝐵) = 0 ↔ ((𝐴𝐷𝐵) ≤ 0 ∧ 0 ≤ (𝐴𝐷𝐵))))
6	3, 4, 5	sylancl 585	. . . 4 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ ((𝐴𝐷𝐵) ≤ 0 ∧ 0 ≤ (𝐴𝐷𝐵))))
7	2, 6	bitr4d 282	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) ≤ 0 ↔ (𝐴𝐷𝐵) = 0))
8		xrlenlt 11303	. . . 4 ⊢ (((𝐴𝐷𝐵) ∈ ℝ^* ∧ 0 ∈ ℝ^*) → ((𝐴𝐷𝐵) ≤ 0 ↔ ¬ 0 < (𝐴𝐷𝐵)))
9	3, 4, 8	sylancl 585	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) ≤ 0 ↔ ¬ 0 < (𝐴𝐷𝐵)))
10		xmeteq0 24237	. . 3 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ((𝐴𝐷𝐵) = 0 ↔ 𝐴 = 𝐵))
11	7, 9, 10	3bitr3d 309	. 2 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (¬ 0 < (𝐴𝐷𝐵) ↔ 𝐴 = 𝐵))
12	11	necon1abid 2975	1 ⊢ ((𝐷 ∈ (∞Met‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (𝐴 ≠ 𝐵 ↔ 0 < (𝐴𝐷𝐵)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ≠ wne 2936 class class class wbr 5142 ‘cfv 6542 (class class class)co 7414 0cc0 11132 ℝ^*cxr 11271 < clt 11272 ≤ cle 11273 ∞Metcxmet 21257

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11188 ax-resscn 11189 ax-1cn 11190 ax-icn 11191 ax-addcl 11192 ax-addrcl 11193 ax-mulcl 11194 ax-mulrcl 11195 ax-mulcom 11196 ax-addass 11197 ax-mulass 11198 ax-distr 11199 ax-i2m1 11200 ax-1ne0 11201 ax-1rid 11202 ax-rnegex 11203 ax-rrecex 11204 ax-cnre 11205 ax-pre-lttri 11206 ax-pre-lttrn 11207 ax-pre-ltadd 11208 ax-pre-mulgt0 11209

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2937 df-nel 3043 df-ral 3058 df-rex 3067 df-rmo 3372 df-reu 3373 df-rab 3429 df-v 3472 df-sbc 3776 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-id 5570 df-po 5584 df-so 5585 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7987 df-2nd 7988 df-er 8718 df-map 8840 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11274 df-mnf 11275 df-xr 11276 df-ltxr 11277 df-le 11278 df-sub 11470 df-neg 11471 df-div 11896 df-2 12299 df-rp 13001 df-xneg 13118 df-xadd 13119 df-xmul 13120 df-xmet 21265

This theorem is referenced by: metgt0 24258

W3C validator

	
		OSZAR »