![]() |
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 14302 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷:(𝑋 × 𝑋)⟶ℝ*) | |
2 | 1 | ffnd 5385 | . 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → 𝐷 Fn (𝑋 × 𝑋)) |
3 | 1 | ffvelcdmda 5672 | . . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) ∈ ℝ*) |
4 | elxp6 6195 | . . . . . . . 8 ⊢ (𝑎 ∈ (𝑋 × 𝑋) ↔ (𝑎 = 〈(1st ‘𝑎), (2nd ‘𝑎)〉 ∧ ((1st ‘𝑎) ∈ 𝑋 ∧ (2nd ‘𝑎) ∈ 𝑋))) | |
5 | 4 | simprbi 275 | . . . . . . 7 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → ((1st ‘𝑎) ∈ 𝑋 ∧ (2nd ‘𝑎) ∈ 𝑋)) |
6 | psmetge0 14308 | . . . . . . . 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 6201 | . . . . . . . . 9 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → 𝑎 = 〈(1st ‘𝑎), (2nd ‘𝑎)〉) | |
10 | 9 | fveq2d 5538 | . . . . . . . 8 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → (𝐷‘𝑎) = (𝐷‘〈(1st ‘𝑎), (2nd ‘𝑎)〉)) |
11 | df-ov 5900 | . . . . . . . 8 ⊢ ((1st ‘𝑎)𝐷(2nd ‘𝑎)) = (𝐷‘〈(1st ‘𝑎), (2nd ‘𝑎)〉) | |
12 | 10, 11 | eqtr4di 2240 | . . . . . . 7 ⊢ (𝑎 ∈ (𝑋 × 𝑋) → (𝐷‘𝑎) = ((1st ‘𝑎)𝐷(2nd ‘𝑎))) |
13 | 12 | adantl 277 | . . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) = ((1st ‘𝑎)𝐷(2nd ‘𝑎))) |
14 | 8, 13 | breqtrrd 4046 | . . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → 0 ≤ (𝐷‘𝑎)) |
15 | elxrge0 10010 | . . . . 5 ⊢ ((𝐷‘𝑎) ∈ (0[,]+∞) ↔ ((𝐷‘𝑎) ∈ ℝ* ∧ 0 ≤ (𝐷‘𝑎))) | |
16 | 3, 14, 15 | sylanbrc 417 | . . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝑎 ∈ (𝑋 × 𝑋)) → (𝐷‘𝑎) ∈ (0[,]+∞)) |
17 | 16 | ralrimiva 2563 | . . 3 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∀𝑎 ∈ (𝑋 × 𝑋)(𝐷‘𝑎) ∈ (0[,]+∞)) |
18 | fnfvrnss 5697 | . . 3 ⊢ ((𝐷 Fn (𝑋 × 𝑋) ∧ ∀𝑎 ∈ (𝑋 × 𝑋)(𝐷‘𝑎) ∈ (0[,]+∞)) → ran 𝐷 ⊆ (0[,]+∞)) | |
19 | 2, 17, 18 | syl2anc 411 | . 2 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ran 𝐷 ⊆ (0[,]+∞)) |
20 | df-f 5239 | . 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 2160 ∀wral 2468 ⊆ wss 3144 〈cop 3610 class class class wbr 4018 × cxp 4642 ran crn 4645 Fn wfn 5230 ⟶wf 5231 ‘cfv 5235 (class class class)co 5897 1st c1st 6164 2nd c2nd 6165 0cc0 7842 +∞cpnf 8020 ℝ*cxr 8022 ≤ cle 8024 [,]cicc 9923 PsMetcpsmet 13865 |
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 2162 ax-14 2163 ax-ext 2171 ax-sep 4136 ax-pow 4192 ax-pr 4227 ax-un 4451 ax-setind 4554 ax-cnex 7933 ax-resscn 7934 ax-1cn 7935 ax-1re 7936 ax-icn 7937 ax-addcl 7938 ax-addrcl 7939 ax-mulcl 7940 ax-mulrcl 7941 ax-addcom 7942 ax-mulcom 7943 ax-addass 7944 ax-mulass 7945 ax-distr 7946 ax-i2m1 7947 ax-0lt1 7948 ax-1rid 7949 ax-0id 7950 ax-rnegex 7951 ax-precex 7952 ax-cnre 7953 ax-pre-ltirr 7954 ax-pre-lttrn 7956 ax-pre-ltadd 7958 ax-pre-mulgt0 7959 |
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 2041 df-mo 2042 df-clab 2176 df-cleq 2182 df-clel 2185 df-nfc 2321 df-ne 2361 df-nel 2456 df-ral 2473 df-rex 2474 df-reu 2475 df-rab 2477 df-v 2754 df-sbc 2978 df-csb 3073 df-dif 3146 df-un 3148 df-in 3150 df-ss 3157 df-if 3550 df-pw 3592 df-sn 3613 df-pr 3614 df-op 3616 df-uni 3825 df-iun 3903 df-br 4019 df-opab 4080 df-mpt 4081 df-id 4311 df-xp 4650 df-rel 4651 df-cnv 4652 df-co 4653 df-dm 4654 df-rn 4655 df-res 4656 df-ima 4657 df-iota 5196 df-fun 5237 df-fn 5238 df-f 5239 df-fv 5243 df-riota 5852 df-ov 5900 df-oprab 5901 df-mpo 5902 df-1st 6166 df-2nd 6167 df-map 6677 df-pnf 8025 df-mnf 8026 df-xr 8027 df-ltxr 8028 df-le 8029 df-sub 8161 df-neg 8162 df-2 9009 df-xadd 9805 df-icc 9927 df-psmet 13873 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |