psmetxrge0 - Metamath Proof Explorer

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

Theorem psmetxrge0 24278

Description: The distance function of a pseudometric space is a function into the nonnegative extended real numbers. (Contributed by Thierry Arnoux, 24-Feb-2018.)

**Assertion**
Ref	Expression
psmetxrge0	⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶(0[,]+∞))

Proof of Theorem psmetxrge0 Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		psmetf 24271	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ^*)
2	1	ffnd 6669	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷 Fn (𝑋 × 𝑋))
3	1	ffvelcdmda 7036	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) ∈ ℝ^*)
4		elxp6 7976	. . . . . . . 8 ⊢ (𝑎 ∈ (𝑋 × 𝑋) ↔ (𝑎 = ⟨(1^st ‘𝑎), (2^nd ‘𝑎)⟩ ∧ ((1^st ‘𝑎) ∈ 𝑋 ∧ (2^nd ‘𝑎) ∈ 𝑋)))
5	4	simprbi 497	. . . . . . 7 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → ((1^st ‘𝑎) ∈ 𝑋 ∧ (2^nd ‘𝑎) ∈ 𝑋))
6		psmetge0 24277	. . . . . . . 8 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (1^st ‘𝑎) ∈ 𝑋 ∧ (2^nd ‘𝑎) ∈ 𝑋) → 0 ≤ ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
7	6	3expb 1121	. . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ ((1^st ‘𝑎) ∈ 𝑋 ∧ (2^nd ‘𝑎) ∈ 𝑋)) → 0 ≤ ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
8	5, 7	sylan2 594	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → 0 ≤ ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
9		1st2nd2 7981	. . . . . . . . 9 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → 𝑎 = ⟨(1^st ‘𝑎), (2^nd ‘𝑎)⟩)
10	9	fveq2d 6844	. . . . . . . 8 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → (𝐷‘𝑎) = (𝐷‘⟨(1^st ‘𝑎), (2^nd ‘𝑎)⟩))
11		df-ov 7370	. . . . . . . 8 ⊢ ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)) = (𝐷‘⟨(1^st ‘𝑎), (2^nd ‘𝑎)⟩)
12	10, 11	eqtr4di 2789	. . . . . . 7 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → (𝐷‘𝑎) = ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
13	12	adantl 481	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) = ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
14	8, 13	breqtrrd 5113	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → 0 ≤ (𝐷‘𝑎))
15		elxrge0 13410	. . . . 5 ⊢ ((𝐷‘𝑎) ∈ (0[,]+∞) ↔ ((𝐷‘𝑎) ∈ ℝ^* ∧ 0 ≤ (𝐷‘𝑎)))
16	3, 14, 15	sylanbrc 584	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) ∈ (0[,]+∞))
17	16	ralrimiva 3129	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎 ∈ (𝑋 × 𝑋)(𝐷‘𝑎) ∈ (0[,]+∞))
18		fnfvrnss 7073	. . 3 ⊢ ((𝐷 Fn (𝑋 × 𝑋) ∧ ∀𝑎 ∈ (𝑋 × 𝑋)(𝐷‘𝑎) ∈ (0[,]+∞)) → ran 𝐷 ⊆ (0[,]+∞))
19	2, 17, 18	syl2anc 585	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ran 𝐷 ⊆ (0[,]+∞))
20		df-f 6502	. 2 ⊢ (𝐷:(𝑋 × 𝑋)⟶(0[,]+∞) ↔ (𝐷 Fn (𝑋 × 𝑋) ∧ ran 𝐷 ⊆ (0[,]+∞)))
21	2, 19, 20	sylanbrc 584	1 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶(0[,]+∞))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 ⊆ wss 3889 ⟨cop 4573 class class class wbr 5085 × cxp 5629 ran crn 5632 Fn wfn 6493 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 1^st c1st 7940 2^nd c2nd 7941 0cc0 11038 +∞cpnf 11176 ℝ^*cxr 11178 ≤ cle 11180 [,]cicc 13301 PsMetcpsmet 21336

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-po 5539 df-so 5540 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-1st 7942 df-2nd 7943 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-2 12244 df-rp 12943 df-xneg 13063 df-xadd 13064 df-xmul 13065 df-icc 13305 df-psmet 21344

This theorem is referenced by: sitmcl 34495

W3C validator