| 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 12231 | . . . . . 6 ⊢ 2 ∈ ℝ | |
| 2 | remulcl 11123 | . . . . . 6 ⊢ ((2 ∈ ℝ ∧ 𝑋 ∈ ℝ) → (2 · 𝑋) ∈ ℝ) | |
| 3 | 1, 2 | mpan 691 | . . . . 5 ⊢ (𝑋 ∈ ℝ → (2 · 𝑋) ∈ ℝ) |
| 4 | 1re 11144 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 5 | resubcl 11457 | . . . . 5 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ) → ((2 · 𝑋) − 1) ∈ ℝ) | |
| 6 | 3, 4, 5 | sylancl 587 | . . . 4 ⊢ (𝑋 ∈ ℝ → ((2 · 𝑋) − 1) ∈ ℝ) |
| 7 | 6 | 3ad2ant1 1134 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ∈ ℝ) |
| 8 | subge0 11662 | . . . . . . 7 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ) → (0 ≤ ((2 · 𝑋) − 1) ↔ 1 ≤ (2 · 𝑋))) | |
| 9 | 3, 4, 8 | sylancl 587 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → (0 ≤ ((2 · 𝑋) − 1) ↔ 1 ≤ (2 · 𝑋))) |
| 10 | 2pos 12260 | . . . . . . . 8 ⊢ 0 < 2 | |
| 11 | 1, 10 | pm3.2i 470 | . . . . . . 7 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
| 12 | ledivmul 12030 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝑋 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → ((1 / 2) ≤ 𝑋 ↔ 1 ≤ (2 · 𝑋))) | |
| 13 | 4, 11, 12 | mp3an13 1455 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → ((1 / 2) ≤ 𝑋 ↔ 1 ≤ (2 · 𝑋))) |
| 14 | 9, 13 | bitr4d 282 | . . . . 5 ⊢ (𝑋 ∈ ℝ → (0 ≤ ((2 · 𝑋) − 1) ↔ (1 / 2) ≤ 𝑋)) |
| 15 | 14 | biimpar 477 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋) → 0 ≤ ((2 · 𝑋) − 1)) |
| 16 | 15 | 3adant3 1133 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → 0 ≤ ((2 · 𝑋) − 1)) |
| 17 | ax-1cn 11096 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 18 | 17 | 2timesi 12290 | . . . . . . . 8 ⊢ (2 · 1) = (1 + 1) |
| 19 | 18 | a1i 11 | . . . . . . 7 ⊢ (𝑋 ∈ ℝ → (2 · 1) = (1 + 1)) |
| 20 | 19 | breq2d 5112 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → ((2 · 𝑋) ≤ (2 · 1) ↔ (2 · 𝑋) ≤ (1 + 1))) |
| 21 | lemul2 12006 | . . . . . . 7 ⊢ ((𝑋 ∈ ℝ ∧ 1 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (𝑋 ≤ 1 ↔ (2 · 𝑋) ≤ (2 · 1))) | |
| 22 | 4, 11, 21 | mp3an23 1456 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → (𝑋 ≤ 1 ↔ (2 · 𝑋) ≤ (2 · 1))) |
| 23 | lesubadd 11621 | . . . . . . . 8 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ ∧ 1 ∈ ℝ) → (((2 · 𝑋) − 1) ≤ 1 ↔ (2 · 𝑋) ≤ (1 + 1))) | |
| 24 | 4, 4, 23 | mp3an23 1456 | . . . . . . 7 ⊢ ((2 · 𝑋) ∈ ℝ → (((2 · 𝑋) − 1) ≤ 1 ↔ (2 · 𝑋) ≤ (1 + 1))) |
| 25 | 3, 24 | syl 17 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → (((2 · 𝑋) − 1) ≤ 1 ↔ (2 · 𝑋) ≤ (1 + 1))) |
| 26 | 20, 22, 25 | 3bitr4d 311 | . . . . 5 ⊢ (𝑋 ∈ ℝ → (𝑋 ≤ 1 ↔ ((2 · 𝑋) − 1) ≤ 1)) |
| 27 | 26 | biimpa 476 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ≤ 1) |
| 28 | 27 | 3adant2 1132 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ≤ 1) |
| 29 | 7, 16, 28 | 3jca 1129 | . 2 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → (((2 · 𝑋) − 1) ∈ ℝ ∧ 0 ≤ ((2 · 𝑋) − 1) ∧ ((2 · 𝑋) − 1) ≤ 1)) |
| 30 | halfre 12366 | . . 3 ⊢ (1 / 2) ∈ ℝ | |
| 31 | 30, 4 | elicc2i 13340 | . 2 ⊢ (𝑋 ∈ ((1 / 2)[,]1) ↔ (𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1)) |
| 32 | elicc01 13394 | . 2 ⊢ (((2 · 𝑋) − 1) ∈ (0[,]1) ↔ (((2 · 𝑋) − 1) ∈ ℝ ∧ 0 ≤ ((2 · 𝑋) − 1) ∧ ((2 · 𝑋) − 1) ≤ 1)) | |
| 33 | 29, 31, 32 | 3imtr4i 292 | 1 ⊢ (𝑋 ∈ ((1 / 2)[,]1) → ((2 · 𝑋) − 1) ∈ (0[,]1)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 (class class class)co 7368 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 · cmul 11043 < clt 11178 ≤ cle 11179 − cmin 11376 / cdiv 11806 2c2 12212 [,]cicc 13276 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-icc 13280 |
| This theorem is referenced by: iihalf2cn 24897 iihalf2cnOLD 24898 phtpycc 24958 copco 24986 pcohtpylem 24987 pcopt 24990 pcopt2 24991 pcorevlem 24994 |
| Copyright terms: Public domain | W3C validator |