![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > psmetxrge0 | GIF version |
Description: The distance function of a pseudometric space is a function into the nonnegative extended real numbers. (Contributed by Thierry Arnoux, 24-Feb-2018.) |
Ref | Expression |
---|---|
psmetxrge0 | ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶(0[,]+∞)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | psmetf 14504 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*) | |
2 | 1 | ffnd 5405 | . 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷 Fn (𝑋 × 𝑋)) |
3 | 1 | ffvelcdmda 5694 | . . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) ∈ ℝ*) |
4 | elxp6 6224 | . . . . . . . 8 ⊢ (𝑎 ∈ (𝑋 × 𝑋) ↔ (𝑎 = 〈(1st ‘𝑎), (2nd ‘𝑎)〉 ∧ ((1st ‘𝑎) ∈ 𝑋 ∧ (2nd ‘𝑎) ∈ 𝑋))) | |
5 | 4 | simprbi 275 | . . . . . . 7 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → ((1st ‘𝑎) ∈ 𝑋 ∧ (2nd ‘𝑎) ∈ 𝑋)) |
6 | psmetge0 14510 | . . . . . . . 8 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (1st ‘𝑎) ∈ 𝑋 ∧ (2nd ‘𝑎) ∈ 𝑋) → 0 ≤ ((1st ‘𝑎)𝐷(2nd ‘𝑎))) | |
7 | 6 | 3expb 1206 | . . . . . . 7 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ ((1st ‘𝑎) ∈ 𝑋 ∧ (2nd ‘𝑎) ∈ 𝑋)) → 0 ≤ ((1st ‘𝑎)𝐷(2nd ‘𝑎))) |
8 | 5, 7 | sylan2 286 | . . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → 0 ≤ ((1st ‘𝑎)𝐷(2nd ‘𝑎))) |
9 | 1st2nd2 6230 | . . . . . . . . 9 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → 𝑎 = 〈(1st ‘𝑎), (2nd ‘𝑎)〉) | |
10 | 9 | fveq2d 5559 | . . . . . . . 8 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → (𝐷‘𝑎) = (𝐷‘〈(1st ‘𝑎), (2nd ‘𝑎)〉)) |
11 | df-ov 5922 | . . . . . . . 8 ⊢ ((1st ‘𝑎)𝐷(2nd ‘𝑎)) = (𝐷‘〈(1st ‘𝑎), (2nd ‘𝑎)〉) | |
12 | 10, 11 | eqtr4di 2244 | . . . . . . 7 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → (𝐷‘𝑎) = ((1st ‘𝑎)𝐷(2nd ‘𝑎))) |
13 | 12 | adantl 277 | . . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) = ((1st ‘𝑎)𝐷(2nd ‘𝑎))) |
14 | 8, 13 | breqtrrd 4058 | . . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → 0 ≤ (𝐷‘𝑎)) |
15 | elxrge0 10047 | . . . . 5 ⊢ ((𝐷‘𝑎) ∈ (0[,]+∞) ↔ ((𝐷‘𝑎) ∈ ℝ* ∧ 0 ≤ (𝐷‘𝑎))) | |
16 | 3, 14, 15 | sylanbrc 417 | . . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) ∈ (0[,]+∞)) |
17 | 16 | ralrimiva 2567 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎 ∈ (𝑋 × 𝑋)(𝐷‘𝑎) ∈ (0[,]+∞)) |
18 | fnfvrnss 5719 | . . 3 ⊢ ((𝐷 Fn (𝑋 × 𝑋) ∧ ∀𝑎 ∈ (𝑋 × 𝑋)(𝐷‘𝑎) ∈ (0[,]+∞)) → ran 𝐷 ⊆ (0[,]+∞)) | |
19 | 2, 17, 18 | syl2anc 411 | . 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ran 𝐷 ⊆ (0[,]+∞)) |
20 | df-f 5259 | . 2 ⊢ (𝐷:(𝑋 × 𝑋)⟶(0[,]+∞) ↔ (𝐷 Fn (𝑋 × 𝑋) ∧ ran 𝐷 ⊆ (0[,]+∞))) | |
21 | 2, 19, 20 | sylanbrc 417 | 1 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶(0[,]+∞)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1364 ∈ wcel 2164 ∀wral 2472 ⊆ wss 3154 〈cop 3622 class class class wbr 4030 × cxp 4658 ran crn 4661 Fn wfn 5250 ⟶wf 5251 ‘cfv 5255 (class class class)co 5919 1st c1st 6193 2nd c2nd 6194 0cc0 7874 +∞cpnf 8053 ℝ*cxr 8055 ≤ cle 8057 [,]cicc 9960 PsMetcpsmet 14034 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4148 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-mulrcl 7973 ax-addcom 7974 ax-mulcom 7975 ax-addass 7976 ax-mulass 7977 ax-distr 7978 ax-i2m1 7979 ax-0lt1 7980 ax-1rid 7981 ax-0id 7982 ax-rnegex 7983 ax-precex 7984 ax-cnre 7985 ax-pre-ltirr 7986 ax-pre-lttrn 7988 ax-pre-ltadd 7990 ax-pre-mulgt0 7991 |
This theorem depends on definitions: df-bi 117 df-dc 836 df-3or 981 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-if 3559 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-map 6706 df-pnf 8058 df-mnf 8059 df-xr 8060 df-ltxr 8061 df-le 8062 df-sub 8194 df-neg 8195 df-2 9043 df-xadd 9842 df-icc 9964 df-psmet 14042 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |