![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > unitssxrge0 | Structured version Visualization version GIF version |
Description: The closed unit interval is a subset of the set of the extended nonnegative reals. Useful lemma for manipulating probabilities within the closed unit interval. (Contributed by Thierry Arnoux, 12-Dec-2016.) |
Ref | Expression |
---|---|
unitssxrge0 | ⊢ (0[,]1) ⊆ (0[,]+∞) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 0e0iccpnf 12530 | . 2 ⊢ 0 ∈ (0[,]+∞) | |
2 | 1re 10326 | . . . 4 ⊢ 1 ∈ ℝ | |
3 | 2 | rexri 10385 | . . 3 ⊢ 1 ∈ ℝ* |
4 | 0le1 10841 | . . 3 ⊢ 0 ≤ 1 | |
5 | pnfge 12207 | . . . 4 ⊢ (1 ∈ ℝ* → 1 ≤ +∞) | |
6 | 3, 5 | ax-mp 5 | . . 3 ⊢ 1 ≤ +∞ |
7 | 0xr 10373 | . . . 4 ⊢ 0 ∈ ℝ* | |
8 | pnfxr 10380 | . . . 4 ⊢ +∞ ∈ ℝ* | |
9 | elicc1 12464 | . . . 4 ⊢ ((0 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (1 ∈ (0[,]+∞) ↔ (1 ∈ ℝ* ∧ 0 ≤ 1 ∧ 1 ≤ +∞))) | |
10 | 7, 8, 9 | mp2an 684 | . . 3 ⊢ (1 ∈ (0[,]+∞) ↔ (1 ∈ ℝ* ∧ 0 ≤ 1 ∧ 1 ≤ +∞)) |
11 | 3, 4, 6, 10 | mpbir3an 1442 | . 2 ⊢ 1 ∈ (0[,]+∞) |
12 | iccss2 12489 | . 2 ⊢ ((0 ∈ (0[,]+∞) ∧ 1 ∈ (0[,]+∞)) → (0[,]1) ⊆ (0[,]+∞)) | |
13 | 1, 11, 12 | mp2an 684 | 1 ⊢ (0[,]1) ⊆ (0[,]+∞) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 198 ∧ w3a 1108 ∈ wcel 2157 ⊆ wss 3767 class class class wbr 4841 (class class class)co 6876 0cc0 10222 1c1 10223 +∞cpnf 10358 ℝ*cxr 10360 ≤ cle 10362 [,]cicc 12423 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1891 ax-4 1905 ax-5 2006 ax-6 2072 ax-7 2107 ax-8 2159 ax-9 2166 ax-10 2185 ax-11 2200 ax-12 2213 ax-13 2354 ax-ext 2775 ax-sep 4973 ax-nul 4981 ax-pow 5033 ax-pr 5095 ax-un 7181 ax-cnex 10278 ax-resscn 10279 ax-1cn 10280 ax-icn 10281 ax-addcl 10282 ax-addrcl 10283 ax-mulcl 10284 ax-mulrcl 10285 ax-mulcom 10286 ax-addass 10287 ax-mulass 10288 ax-distr 10289 ax-i2m1 10290 ax-1ne0 10291 ax-1rid 10292 ax-rnegex 10293 ax-rrecex 10294 ax-cnre 10295 ax-pre-lttri 10296 ax-pre-lttrn 10297 ax-pre-ltadd 10298 ax-pre-mulgt0 10299 |
This theorem depends on definitions: df-bi 199 df-an 386 df-or 875 df-3or 1109 df-3an 1110 df-tru 1657 df-ex 1876 df-nf 1880 df-sb 2065 df-mo 2590 df-eu 2607 df-clab 2784 df-cleq 2790 df-clel 2793 df-nfc 2928 df-ne 2970 df-nel 3073 df-ral 3092 df-rex 3093 df-reu 3094 df-rab 3096 df-v 3385 df-sbc 3632 df-csb 3727 df-dif 3770 df-un 3772 df-in 3774 df-ss 3781 df-nul 4114 df-if 4276 df-pw 4349 df-sn 4367 df-pr 4369 df-op 4373 df-uni 4627 df-iun 4710 df-br 4842 df-opab 4904 df-mpt 4921 df-id 5218 df-po 5231 df-so 5232 df-xp 5316 df-rel 5317 df-cnv 5318 df-co 5319 df-dm 5320 df-rn 5321 df-res 5322 df-ima 5323 df-iota 6062 df-fun 6101 df-fn 6102 df-f 6103 df-f1 6104 df-fo 6105 df-f1o 6106 df-fv 6107 df-riota 6837 df-ov 6879 df-oprab 6880 df-mpt2 6881 df-1st 7399 df-2nd 7400 df-er 7980 df-en 8194 df-dom 8195 df-sdom 8196 df-pnf 10363 df-mnf 10364 df-xr 10365 df-ltxr 10366 df-le 10367 df-sub 10556 df-neg 10557 df-icc 12427 |
This theorem is referenced by: probun 30990 |
Copyright terms: Public domain | W3C validator |