| 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 12321 | . . . . . 6 ⊢ 2 ∈ ℝ | |
| 2 | remulcl 11191 | . . . . . 6 ⊢ ((2 ∈ ℝ ∧ 𝑋 ∈ ℝ) → (2 · 𝑋) ∈ ℝ) | |
| 3 | 1, 2 | mpan 702 | . . . . 5 ⊢ (𝑋 ∈ ℝ → (2 · 𝑋) ∈ ℝ) |
| 4 | 1re 11214 | . . . . 5 ⊢ 1 ∈ ℝ | |
| 5 | resubcl 11528 | . . . . 5 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ) → ((2 · 𝑋) − 1) ∈ ℝ) | |
| 6 | 3, 4, 5 | sylancl 597 | . . . 4 ⊢ (𝑋 ∈ ℝ → ((2 · 𝑋) − 1) ∈ ℝ) |
| 7 | 6 | 3ad2ant1 1150 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ∈ ℝ) |
| 8 | subge0 11733 | . . . . . . 7 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ) → (0 ≤ ((2 · 𝑋) − 1) ↔ 1 ≤ (2 · 𝑋))) | |
| 9 | 3, 4, 8 | sylancl 597 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → (0 ≤ ((2 · 𝑋) − 1) ↔ 1 ≤ (2 · 𝑋))) |
| 10 | 2pos 12351 | . . . . . . . 8 ⊢ 0 < 2 | |
| 11 | 1, 10 | pm3.2i 475 | . . . . . . 7 ⊢ (2 ∈ ℝ ∧ 0 < 2) |
| 12 | ledivmul 12097 | . . . . . . 7 ⊢ ((1 ∈ ℝ ∧ 𝑋 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → ((1 / 2) ≤ 𝑋 ↔ 1 ≤ (2 · 𝑋))) | |
| 13 | 4, 11, 12 | mp3an13 1480 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → ((1 / 2) ≤ 𝑋 ↔ 1 ≤ (2 · 𝑋))) |
| 14 | 9, 13 | bitr4d 285 | . . . . 5 ⊢ (𝑋 ∈ ℝ → (0 ≤ ((2 · 𝑋) − 1) ↔ (1 / 2) ≤ 𝑋)) |
| 15 | 14 | biimpar 482 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋) → 0 ≤ ((2 · 𝑋) − 1)) |
| 16 | 15 | 3adant3 1149 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → 0 ≤ ((2 · 𝑋) − 1)) |
| 17 | ax-1cn 11164 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 18 | 17 | 2timesi 12384 | . . . . . . . 8 ⊢ (2 · 1) = (1 + 1) |
| 19 | 18 | a1i 11 | . . . . . . 7 ⊢ (𝑋 ∈ ℝ → (2 · 1) = (1 + 1)) |
| 20 | 19 | breq2d 5120 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → ((2 · 𝑋) ≤ (2 · 1) ↔ (2 · 𝑋) ≤ (1 + 1))) |
| 21 | lemul2 12074 | . . . . . . 7 ⊢ ((𝑋 ∈ ℝ ∧ 1 ∈ ℝ ∧ (2 ∈ ℝ ∧ 0 < 2)) → (𝑋 ≤ 1 ↔ (2 · 𝑋) ≤ (2 · 1))) | |
| 22 | 4, 11, 21 | mp3an23 1481 | . . . . . 6 ⊢ (𝑋 ∈ ℝ → (𝑋 ≤ 1 ↔ (2 · 𝑋) ≤ (2 · 1))) |
| 23 | lesubadd 11692 | . . . . . . . 8 ⊢ (((2 · 𝑋) ∈ ℝ ∧ 1 ∈ ℝ ∧ 1 ∈ ℝ) → (((2 · 𝑋) − 1) ≤ 1 ↔ (2 · 𝑋) ≤ (1 + 1))) | |
| 24 | 4, 4, 23 | mp3an23 1481 | . . . . . . 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 481 | . . . 4 ⊢ ((𝑋 ∈ ℝ ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ≤ 1) |
| 28 | 27 | 3adant2 1148 | . . 3 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → ((2 · 𝑋) − 1) ≤ 1) |
| 29 | 7, 16, 28 | 3jca 1145 | . 2 ⊢ ((𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1) → (((2 · 𝑋) − 1) ∈ ℝ ∧ 0 ≤ ((2 · 𝑋) − 1) ∧ ((2 · 𝑋) − 1) ≤ 1)) |
| 30 | halfre 12463 | . . 3 ⊢ (1 / 2) ∈ ℝ | |
| 31 | 30, 4 | elicc2i 13445 | . 2 ⊢ (𝑋 ∈ ((1 / 2)[,]1) ↔ (𝑋 ∈ ℝ ∧ (1 / 2) ≤ 𝑋 ∧ 𝑋 ≤ 1)) |
| 32 | elicc01 13499 | . 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 400 ∧ w3a 1102 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 (class class class)co 7412 ℝcr 11105 0cc0 11106 1c1 11107 + caddc 11109 · cmul 11111 < clt 11249 ≤ cle 11250 − cmin 11447 / cdiv 11877 2c2 12301 [,]cicc 13381 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 ax-cnex 11162 ax-resscn 11163 ax-1cn 11164 ax-icn 11165 ax-addcl 11166 ax-addrcl 11167 ax-mulcl 11168 ax-mulrcl 11169 ax-mulcom 11170 ax-addass 11171 ax-mulass 11172 ax-distr 11173 ax-i2m1 11174 ax-1ne0 11175 ax-1rid 11176 ax-rnegex 11177 ax-rrecex 11178 ax-cnre 11179 ax-pre-lttri 11180 ax-pre-lttrn 11181 ax-pre-ltadd 11182 ax-pre-mulgt0 11183 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1103 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5555 df-eprel 5560 df-po 5568 df-so 5569 df-fr 5613 df-we 5615 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7861 df-2nd 7985 df-frecs 8276 df-wrecs 8307 df-recs 8356 df-rdg 8395 df-er 8692 df-en 8942 df-dom 8943 df-sdom 8944 df-pnf 11251 df-mnf 11252 df-xr 11253 df-ltxr 11254 df-le 11255 df-sub 11449 df-neg 11450 df-div 11878 df-nn 12240 df-2 12309 df-icc 13385 |
| This theorem is used by: iihalf2cn 25104 phtpycc 25161 copco 25188 pcohtpylem 25189 pcopt 25192 pcopt2 25193 pcorevlem 25196 |
| Copyright terms: Public domain | W3C validator |