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 24229

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 24222	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ^*)
2	1	ffnd 6657	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷 Fn (𝑋 × 𝑋))
3	1	ffvelcdmda 7023	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) ∈ ℝ^*)
4		elxp6 7961	. . . . . . . 8 ⊢ (𝑎 ∈ (𝑋 × 𝑋) ↔ (𝑎 = ⟨(1^st ‘𝑎), (2^nd ‘𝑎)⟩ ∧ ((1^st ‘𝑎) ∈ 𝑋 ∧ (2^nd ‘𝑎) ∈ 𝑋)))
5	4	simprbi 496	. . . . . . 7 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → ((1^st ‘𝑎) ∈ 𝑋 ∧ (2^nd ‘𝑎) ∈ 𝑋))
6		psmetge0 24228	. . . . . . . 8 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (1^st ‘𝑎) ∈ 𝑋 ∧ (2^nd ‘𝑎) ∈ 𝑋) → 0 ≤ ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
7	6	3expb 1120	. . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ ((1^st ‘𝑎) ∈ 𝑋 ∧ (2^nd ‘𝑎) ∈ 𝑋)) → 0 ≤ ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
8	5, 7	sylan2 593	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → 0 ≤ ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
9		1st2nd2 7966	. . . . . . . . 9 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → 𝑎 = ⟨(1^st ‘𝑎), (2^nd ‘𝑎)⟩)
10	9	fveq2d 6832	. . . . . . . 8 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → (𝐷‘𝑎) = (𝐷‘⟨(1^st ‘𝑎), (2^nd ‘𝑎)⟩))
11		df-ov 7355	. . . . . . . 8 ⊢ ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)) = (𝐷‘⟨(1^st ‘𝑎), (2^nd ‘𝑎)⟩)
12	10, 11	eqtr4di 2786	. . . . . . 7 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → (𝐷‘𝑎) = ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
13	12	adantl 481	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) = ((1^st ‘𝑎)𝐷(2^nd ‘𝑎)))
14	8, 13	breqtrrd 5121	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → 0 ≤ (𝐷‘𝑎))
15		elxrge0 13359	. . . . 5 ⊢ ((𝐷‘𝑎) ∈ (0[,]+∞) ↔ ((𝐷‘𝑎) ∈ ℝ^* ∧ 0 ≤ (𝐷‘𝑎)))
16	3, 14, 15	sylanbrc 583	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) ∈ (0[,]+∞))
17	16	ralrimiva 3125	. . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎 ∈ (𝑋 × 𝑋)(𝐷‘𝑎) ∈ (0[,]+∞))
18		fnfvrnss 7060	. . 3 ⊢ ((𝐷 Fn (𝑋 × 𝑋) ∧ ∀𝑎 ∈ (𝑋 × 𝑋)(𝐷‘𝑎) ∈ (0[,]+∞)) → ran 𝐷 ⊆ (0[,]+∞))
19	2, 17, 18	syl2anc 584	. 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ran 𝐷 ⊆ (0[,]+∞))
20		df-f 6490	. 2 ⊢ (𝐷:(𝑋 × 𝑋)⟶(0[,]+∞) ↔ (𝐷 Fn (𝑋 × 𝑋) ∧ ran 𝐷 ⊆ (0[,]+∞)))
21	2, 19, 20	sylanbrc 583	1 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶(0[,]+∞))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3048 ⊆ wss 3898 ⟨cop 4581 class class class wbr 5093 × cxp 5617 ran crn 5620 Fn wfn 6481 ⟶wf 6482 ‘cfv 6486 (class class class)co 7352 1^st c1st 7925 2^nd c2nd 7926 0cc0 11013 +∞cpnf 11150 ℝ^*cxr 11152 ≤ cle 11154 [,]cicc 13250 PsMetcpsmet 21277

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-sep 5236 ax-nul 5246 ax-pow 5305 ax-pr 5372 ax-un 7674 ax-cnex 11069 ax-resscn 11070 ax-1cn 11071 ax-icn 11072 ax-addcl 11073 ax-addrcl 11074 ax-mulcl 11075 ax-mulrcl 11076 ax-mulcom 11077 ax-addass 11078 ax-mulass 11079 ax-distr 11080 ax-i2m1 11081 ax-1ne0 11082 ax-1rid 11083 ax-rnegex 11084 ax-rrecex 11085 ax-cnre 11086 ax-pre-lttri 11087 ax-pre-lttrn 11088 ax-pre-ltadd 11089 ax-pre-mulgt0 11090

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4283 df-if 4475 df-pw 4551 df-sn 4576 df-pr 4578 df-op 4582 df-uni 4859 df-iun 4943 df-br 5094 df-opab 5156 df-mpt 5175 df-id 5514 df-po 5527 df-so 5528 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7309 df-ov 7355 df-oprab 7356 df-mpo 7357 df-1st 7927 df-2nd 7928 df-er 8628 df-map 8758 df-en 8876 df-dom 8877 df-sdom 8878 df-pnf 11155 df-mnf 11156 df-xr 11157 df-ltxr 11158 df-le 11159 df-sub 11353 df-neg 11354 df-div 11782 df-2 12195 df-rp 12893 df-xneg 13013 df-xadd 13014 df-xmul 13015 df-icc 13254 df-psmet 21285

This theorem is referenced by: sitmcl 34385

W3C validator