![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > measle0 | Structured version Visualization version GIF version |
Description: If the measure of a given set is bounded by zero, it is zero. (Contributed by Thierry Arnoux, 20-Oct-2017.) |
Ref | Expression |
---|---|
measle0 | ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → (𝑀‘𝐴) = 0) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp3 1135 | . 2 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → (𝑀‘𝐴) ≤ 0) | |
2 | measvxrge0 31574 | . . . . 5 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆) → (𝑀‘𝐴) ∈ (0[,]+∞)) | |
3 | elxrge0 12835 | . . . . 5 ⊢ ((𝑀‘𝐴) ∈ (0[,]+∞) ↔ ((𝑀‘𝐴) ∈ ℝ* ∧ 0 ≤ (𝑀‘𝐴))) | |
4 | 2, 3 | sylib 221 | . . . 4 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆) → ((𝑀‘𝐴) ∈ ℝ* ∧ 0 ≤ (𝑀‘𝐴))) |
5 | 4 | 3adant3 1129 | . . 3 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → ((𝑀‘𝐴) ∈ ℝ* ∧ 0 ≤ (𝑀‘𝐴))) |
6 | 5 | simprd 499 | . 2 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → 0 ≤ (𝑀‘𝐴)) |
7 | 5 | simpld 498 | . . 3 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → (𝑀‘𝐴) ∈ ℝ*) |
8 | 0xr 10677 | . . 3 ⊢ 0 ∈ ℝ* | |
9 | xrletri3 12535 | . . 3 ⊢ (((𝑀‘𝐴) ∈ ℝ* ∧ 0 ∈ ℝ*) → ((𝑀‘𝐴) = 0 ↔ ((𝑀‘𝐴) ≤ 0 ∧ 0 ≤ (𝑀‘𝐴)))) | |
10 | 7, 8, 9 | sylancl 589 | . 2 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → ((𝑀‘𝐴) = 0 ↔ ((𝑀‘𝐴) ≤ 0 ∧ 0 ≤ (𝑀‘𝐴)))) |
11 | 1, 6, 10 | mpbir2and 712 | 1 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → (𝑀‘𝐴) = 0) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 0cc0 10526 +∞cpnf 10661 ℝ*cxr 10663 ≤ cle 10665 [,]cicc 12729 measurescmeas 31564 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-resscn 10583 ax-1cn 10584 ax-addrcl 10587 ax-rnegex 10597 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-fal 1551 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-ov 7138 df-oprab 7139 df-mpo 7140 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-icc 12733 df-esum 31397 df-meas 31565 |
This theorem is referenced by: aean 31613 |
Copyright terms: Public domain | W3C validator |