| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iihalf2 | Structured version Visualization version GIF version | ||
| Description: Map the second half of II into II. (Contributed by Jeff Madsen, 2-Sep-2009.) |
| Ref | Expression |
|---|---|
| iihalf2 | ⊢ (𝑋 ∈ ((1 / 2)[,]1) → ((2 · 𝑋) − 1) ∈ (0[,]1)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 2re 12333 | . . . . . 6 ⊢ 2 ∈ ℝ | |
| 2 | remulcl 11203 | . . . . . 6 ⊢ ((2 ∈ ℝ ∧ 𝑋 ∈ ℝ) → (2 · 𝑋) ∈ ℝ) | |
| 3 | 1, 2 | mpan 703 | . . . . 5 ⊢ (𝑋 ∈ ℝ → (2 · 𝑋) ∈ ℝ) |
| 4 | 1re 11226 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 5 | resubcl 11540 | . . . . 5 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ) → ((2 · 𝑋) − 1) ∈ ℝ) | |
| 6 | 3, 4, 5 | sylancl 598 | . . . 4 ⊢ (𝑋 ∈ ℝ → ((2 · 𝑋) − 1) ∈ ℝ) |
| 7 | 6 | 3ad2ant1 1151 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ∈ ℝ) |
| 8 | subge0 11745 | . . . . . . 7 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ) → (0 ≤ ((2 · 𝑋) − 1) ↔ 1 ≤ (2 · 𝑋))) | |
| 9 | 3, 4, 8 | sylancl 598 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → (0 ≤ ((2 · 𝑋) − 1) ↔ 1 ≤ (2 · 𝑋))) |
| 10 | 2pos 12363 | . . . . . . . 8 ⊢ 0 < 2 | |
| 11 | 1, 10 | pm3.2i 476 | . . . . . . 7 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
| 12 | ledivmul 12109 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝑋 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → ((1 / 2) ≤ 𝑋 ↔ 1 ≤ (2 · 𝑋))) | |
| 13 | 4, 11, 12 | mp3an13 1481 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → ((1 / 2) ≤ 𝑋 ↔ 1 ≤ (2 · 𝑋))) |
| 14 | 9, 13 | bitr4d 285 | . . . . 5 ⊢ (𝑋 ∈ ℝ → (0 ≤ ((2 · 𝑋) − 1) ↔ (1 / 2) ≤ 𝑋)) |
| 15 | 14 | biimpar 483 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋) → 0 ≤ ((2 · 𝑋) − 1)) |
| 16 | 15 | 3adant3 1150 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → 0 ≤ ((2 · 𝑋) − 1)) |
| 17 | ax-1cn 11176 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 18 | 17 | 2timesi 12396 | . . . . . . . 8 ⊢ (2 · 1) = (1 + 1) |
| 19 | 18 | a1i 11 | . . . . . . 7 ⊢ (𝑋 ∈ ℝ → (2 · 1) = (1 + 1)) |
| 20 | 19 | breq2d 5126 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → ((2 · 𝑋) ≤ (2 · 1) ↔ (2 · 𝑋) ≤ (1 + 1))) |
| 21 | lemul2 12086 | . . . . . . 7 ⊢ ((𝑋 ∈ ℝ ∧ 1 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (𝑋 ≤ 1 ↔ (2 · 𝑋) ≤ (2 · 1))) | |
| 22 | 4, 11, 21 | mp3an23 1482 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → (𝑋 ≤ 1 ↔ (2 · 𝑋) ≤ (2 · 1))) |
| 23 | lesubadd 11704 | . . . . . . . 8 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ ∧ 1 ∈ ℝ) → (((2 · 𝑋) − 1) ≤ 1 ↔ (2 · 𝑋) ≤ (1 + 1))) | |
| 24 | 4, 4, 23 | mp3an23 1482 | . . . . . . 7 ⊢ ((2 · 𝑋) ∈ ℝ → (((2 · 𝑋) − 1) ≤ 1 ↔ (2 · 𝑋) ≤ (1 + 1))) |
| 25 | 3, 24 | syl 18 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → (((2 · 𝑋) − 1) ≤ 1 ↔ (2 · 𝑋) ≤ (1 + 1))) |
| 26 | 20, 22, 25 | 3bitr4d 314 | . . . . 5 ⊢ (𝑋 ∈ ℝ → (𝑋 ≤ 1 ↔ ((2 · 𝑋) − 1) ≤ 1)) |
| 27 | 26 | biimpa 482 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ≤ 1) |
| 28 | 27 | 3adant2 1149 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ≤ 1) |
| 29 | 7, 16, 28 | 3jca 1146 | . 2 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → (((2 · 𝑋) − 1) ∈ ℝ ∧ 0 ≤ ((2 · 𝑋) − 1) ∧ ((2 · 𝑋) − 1) ≤ 1)) |
| 30 | halfre 12475 | . . 3 ⊢ (1 / 2) ∈ ℝ | |
| 31 | 30, 4 | elicc2i 13457 | . 2 ⊢ (𝑋 ∈ ((1 / 2)[,]1) ↔ (𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1)) |
| 32 | elicc01 13511 | . 2 ⊢ (((2 · 𝑋) − 1) ∈ (0[,]1) ↔ (((2 · 𝑋) − 1) ∈ ℝ ∧ 0 ≤ ((2 · 𝑋) − 1) ∧ ((2 · 𝑋) − 1) ≤ 1)) | |
| 33 | 29, 31, 32 | 3imtr4i 295 | 1 ⊢ (𝑋 ∈ ((1 / 2)[,]1) → ((2 · 𝑋) − 1) ∈ (0[,]1)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 class class class wbr 5114 (class class class)co 7423 ℝcr 11117 0cc0 11118 1c1 11119 + caddc 11121 · cmul 11123 < clt 11261 ≤ cle 11262 − cmin 11459 / cdiv 11889 2c2 12313 [,]cicc 13393 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-sep 5262 ax-nul 5274 ax-pow 5341 ax-pr 5409 ax-un 7745 ax-cnex 11174 ax-resscn 11175 ax-1cn 11176 ax-icn 11177 ax-addcl 11178 ax-addrcl 11179 ax-mulcl 11180 ax-mulrcl 11181 ax-mulcom 11182 ax-addass 11183 ax-mulass 11184 ax-distr 11185 ax-i2m1 11186 ax-1ne0 11187 ax-1rid 11188 ax-rnegex 11189 ax-rrecex 11190 ax-cnre 11191 ax-pre-lttri 11192 ax-pre-lttrn 11193 ax-pre-ltadd 11194 ax-pre-mulgt0 11195 |
| 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 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-iun 4963 df-br 5115 df-opab 5179 df-mpt 5198 df-tr 5224 df-id 5561 df-eprel 5566 df-po 5574 df-so 5575 df-fr 5619 df-we 5621 df-xp 5672 df-rel 5673 df-cnv 5674 df-co 5675 df-dm 5676 df-rn 5677 df-res 5678 df-ima 5679 df-pred 6309 df-ord 6370 df-on 6371 df-lim 6372 df-suc 6373 df-iota 6499 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7380 df-ov 7426 df-oprab 7427 df-mpo 7428 df-om 7872 df-2nd 7996 df-frecs 8287 df-wrecs 8318 df-recs 8367 df-rdg 8406 df-er 8703 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11263 df-mnf 11264 df-xr 11265 df-ltxr 11266 df-le 11267 df-sub 11461 df-neg 11462 df-div 11890 df-nn 12252 df-2 12321 df-icc 13397 |
| This theorem is used by: iihalf2cn 25130 phtpycc 25187 copco 25214 pcohtpylem 25215 pcopt 25218 pcopt2 25219 pcorevlem 25222 |
| Copyright terms: Public domain | W3C validator |