Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iihalf1 | Structured version Visualization version GIF version |
Description: Map the first half of II into II. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Ref | Expression |
---|---|
iihalf1 | ⊢ (𝑋 ∈ (0[,](1 / 2)) → (2 · 𝑋) ∈ (0[,]1)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 2re 11712 | . . . . 5 ⊢ 2 ∈ ℝ | |
2 | remulcl 10622 | . . . . 5 ⊢ ((2 ∈ ℝ ∧ 𝑋 ∈ ℝ) → (2 · 𝑋) ∈ ℝ) | |
3 | 1, 2 | mpan 688 | . . . 4 ⊢ (𝑋 ∈ ℝ → (2 · 𝑋) ∈ ℝ) |
4 | 3 | 3ad2ant1 1129 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ 0 ≤ 𝑋 ∧ 𝑋 ≤ (1 / 2)) → (2 · 𝑋) ∈ ℝ) |
5 | 0le2 11740 | . . . . 5 ⊢ 0 ≤ 2 | |
6 | mulge0 11158 | . . . . 5 ⊢ (((2 ∈ ℝ ∧ 0 ≤ 2) ∧ (𝑋 ∈ ℝ ∧ 0 ≤ 𝑋)) → 0 ≤ (2 · 𝑋)) | |
7 | 1, 5, 6 | mpanl12 700 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ 0 ≤ 𝑋) → 0 ≤ (2 · 𝑋)) |
8 | 7 | 3adant3 1128 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ 0 ≤ 𝑋 ∧ 𝑋 ≤ (1 / 2)) → 0 ≤ (2 · 𝑋)) |
9 | 1re 10641 | . . . . . 6 ⊢ 1 ∈ ℝ | |
10 | 2pos 11741 | . . . . . . 7 ⊢ 0 < 2 | |
11 | 1, 10 | pm3.2i 473 | . . . . . 6 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
12 | lemuldiv2 11521 | . . . . . 6 ⊢ ((𝑋 ∈ ℝ ∧ 1 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → ((2 · 𝑋) ≤ 1 ↔ 𝑋 ≤ (1 / 2))) | |
13 | 9, 11, 12 | mp3an23 1449 | . . . . 5 ⊢ (𝑋 ∈ ℝ → ((2 · 𝑋) ≤ 1 ↔ 𝑋 ≤ (1 / 2))) |
14 | 13 | biimpar 480 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ 𝑋 ≤ (1 / 2)) → (2 · 𝑋) ≤ 1) |
15 | 14 | 3adant2 1127 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ 0 ≤ 𝑋 ∧ 𝑋 ≤ (1 / 2)) → (2 · 𝑋) ≤ 1) |
16 | 4, 8, 15 | 3jca 1124 | . 2 ⊢ ((𝑋 ∈ ℝ ∧ 0 ≤ 𝑋 ∧ 𝑋 ≤ (1 / 2)) → ((2 · 𝑋) ∈ ℝ ∧ 0 ≤ (2 · 𝑋) ∧ (2 · 𝑋) ≤ 1)) |
17 | 0re 10643 | . . 3 ⊢ 0 ∈ ℝ | |
18 | halfre 11852 | . . 3 ⊢ (1 / 2) ∈ ℝ | |
19 | 17, 18 | elicc2i 12803 | . 2 ⊢ (𝑋 ∈ (0[,](1 / 2)) ↔ (𝑋 ∈ ℝ ∧ 0 ≤ 𝑋 ∧ 𝑋 ≤ (1 / 2))) |
20 | 17, 9 | elicc2i 12803 | . 2 ⊢ ((2 · 𝑋) ∈ (0[,]1) ↔ ((2 · 𝑋) ∈ ℝ ∧ 0 ≤ (2 · 𝑋) ∧ (2 · 𝑋) ≤ 1)) |
21 | 16, 19, 20 | 3imtr4i 294 | 1 ⊢ (𝑋 ∈ (0[,](1 / 2)) → (2 · 𝑋) ∈ (0[,]1)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 ∈ wcel 2114 class class class wbr 5066 (class class class)co 7156 ℝcr 10536 0cc0 10537 1c1 10538 · cmul 10542 < clt 10675 ≤ cle 10676 / cdiv 11297 2c2 11693 [,]cicc 12742 |
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 2793 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 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-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-po 5474 df-so 5475 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-er 8289 df-en 8510 df-dom 8511 df-sdom 8512 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-2 11701 df-icc 12746 |
This theorem is referenced by: iihalf1cn 23536 phtpycc 23595 copco 23622 pcohtpylem 23623 pcopt 23626 pcopt2 23627 pcorevlem 23630 |
Copyright terms: Public domain | W3C validator |