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 1134 | . 2 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → (𝑀‘𝐴) ≤ 0) | |
2 | measvxrge0 31466 | . . . . 5 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆) → (𝑀‘𝐴) ∈ (0[,]+∞)) | |
3 | elxrge0 12848 | . . . . 5 ⊢ ((𝑀‘𝐴) ∈ (0[,]+∞) ↔ ((𝑀‘𝐴) ∈ ℝ* ∧ 0 ≤ (𝑀‘𝐴))) | |
4 | 2, 3 | sylib 220 | . . . 4 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆) → ((𝑀‘𝐴) ∈ ℝ* ∧ 0 ≤ (𝑀‘𝐴))) |
5 | 4 | 3adant3 1128 | . . 3 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → ((𝑀‘𝐴) ∈ ℝ* ∧ 0 ≤ (𝑀‘𝐴))) |
6 | 5 | simprd 498 | . 2 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → 0 ≤ (𝑀‘𝐴)) |
7 | 5 | simpld 497 | . . 3 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → (𝑀‘𝐴) ∈ ℝ*) |
8 | 0xr 10690 | . . 3 ⊢ 0 ∈ ℝ* | |
9 | xrletri3 12550 | . . 3 ⊢ (((𝑀‘𝐴) ∈ ℝ* ∧ 0 ∈ ℝ*) → ((𝑀‘𝐴) = 0 ↔ ((𝑀‘𝐴) ≤ 0 ∧ 0 ≤ (𝑀‘𝐴)))) | |
10 | 7, 8, 9 | sylancl 588 | . 2 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → ((𝑀‘𝐴) = 0 ↔ ((𝑀‘𝐴) ≤ 0 ∧ 0 ≤ (𝑀‘𝐴)))) |
11 | 1, 6, 10 | mpbir2and 711 | 1 ⊢ ((𝑀 ∈ (measures‘𝑆) ∧ 𝐴 ∈ 𝑆 ∧ (𝑀‘𝐴) ≤ 0) → (𝑀‘𝐴) = 0) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1537 ∈ wcel 2114 class class class wbr 5068 ‘cfv 6357 (class class class)co 7158 0cc0 10539 +∞cpnf 10674 ℝ*cxr 10676 ≤ cle 10678 [,]cicc 12744 measurescmeas 31456 |
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 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-addrcl 10600 ax-rnegex 10610 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-op 4576 df-uni 4841 df-br 5069 df-opab 5131 df-mpt 5149 df-id 5462 df-po 5476 df-so 5477 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-er 8291 df-en 8512 df-dom 8513 df-sdom 8514 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-icc 12748 df-esum 31289 df-meas 31457 |
This theorem is referenced by: aean 31505 |
Copyright terms: Public domain | W3C validator |