| 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 13617 | . 2 ⊢ 0 ∈ (0[,]+∞) | |
| 2 | 1xr 11395 | . . 3 ⊢ 1 ∈ ℝ* | |
| 3 | 0le1 11866 | . . 3 ⊢ 0 ≤ 1 | |
| 4 | pnfge 13286 | . . . 4 ⊢ (1 ∈ ℝ* → 1 ≤ +∞) | |
| 5 | 2, 4 | ax-mp 5 | . . 3 ⊢ 1 ≤ +∞ |
| 6 | 0xr 11383 | . . . 4 ⊢ 0 ∈ ℝ* | |
| 7 | pnfxr 11390 | . . . 4 ⊢ +∞ ∈ ℝ* | |
| 8 | elicc1 13547 | . . . 4 ⊢ ((0 ∈ ℝ* ∧ +∞ ∈ ℝ*) → (1 ∈ (0[,]+∞) ↔ (1 ∈ ℝ* ∧ 0 ≤ 1 ∧ 1 ≤ +∞))) | |
| 9 | 6, 7, 8 | mp2an 705 | . . 3 ⊢ (1 ∈ (0[,]+∞) ↔ (1 ∈ ℝ* ∧ 0 ≤ 1 ∧ 1 ≤ +∞)) |
| 10 | 2, 3, 5, 9 | mpbir3an 1360 | . 2 ⊢ 1 ∈ (0[,]+∞) |
| 11 | iccss2 13575 | . 2 ⊢ ((0 ∈ (0[,]+∞) ∧ 1 ∈ (0[,]+∞)) → (0[,]1) ⊆ (0[,]+∞)) | |
| 12 | 1, 10, 11 | mp2an 705 | 1 ⊢ (0[,]1) ⊆ (0[,]+∞) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ w3a 1103 ∈ wcel 2147 ⊆ wss 3900 class class class wbr 5106 (class class class)co 7443 0cc0 11227 1c1 11228 +∞cpnf 11367 ℝ*cxr 11369 ≤ cle 11371 [,]cicc 13506 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-1st 8025 df-2nd 8026 df-er 8745 df-en 9002 df-dom 9003 df-sdom 9004 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-icc 13510 |
| This theorem is used by: probun 35121 |
| Copyright terms: Public domain | W3C validator |