| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > signlem0 | Structured version Visualization version GIF version | ||
| Description: Adding a zero as the highest coefficient does not change the parity of the sign changes. (Contributed by Thierry Arnoux, 12-Oct-2018.) |
| Ref | Expression |
|---|---|
| signsv.p | ⊢ ⨣ = (𝑎 ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏)) |
| signsv.w | ⊢ 𝑊 = {〈(Base‘ndx), {-1, 0, 1}〉, 〈(+g‘ndx), ⨣ 〉} |
| signsv.t | ⊢ 𝑇 = (𝑓 ∈ Word ℝ ↦ (𝑛 ∈ (0..^(♯‘𝑓)) ↦ (𝑊 Σg (𝑖 ∈ (0...𝑛) ↦ (sgn‘(𝑓‘𝑖)))))) |
| signsv.v | ⊢ 𝑉 = (𝑓 ∈ Word ℝ ↦ Σ𝑗 ∈ (1..^(♯‘𝑓))if(((𝑇‘𝑓)‘𝑗) ≠ ((𝑇‘𝑓)‘(𝑗 − 1)), 1, 0)) |
| Ref | Expression |
|---|---|
| signlem0 | ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘(𝐹 ++ 〈“0”〉)) = (𝑉‘𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 0re 11123 | . . 3 ⊢ 0 ∈ ℝ | |
| 2 | signsv.p | . . . 4 ⊢ ⨣ = (𝑎 ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏)) | |
| 3 | signsv.w | . . . 4 ⊢ 𝑊 = {〈(Base‘ndx), {-1, 0, 1}〉, 〈(+g‘ndx), ⨣ 〉} | |
| 4 | signsv.t | . . . 4 ⊢ 𝑇 = (𝑓 ∈ Word ℝ ↦ (𝑛 ∈ (0..^(♯‘𝑓)) ↦ (𝑊 Σg (𝑖 ∈ (0...𝑛) ↦ (sgn‘(𝑓‘𝑖)))))) | |
| 5 | signsv.v | . . . 4 ⊢ 𝑉 = (𝑓 ∈ Word ℝ ↦ Σ𝑗 ∈ (1..^(♯‘𝑓))if(((𝑇‘𝑓)‘𝑗) ≠ ((𝑇‘𝑓)‘(𝑗 − 1)), 1, 0)) | |
| 6 | 2, 3, 4, 5 | signsvfn 34618 | . . 3 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 0 ∈ ℝ) → (𝑉‘(𝐹 ++ 〈“0”〉)) = ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0, 1, 0))) |
| 7 | 1, 6 | mpan2 691 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘(𝐹 ++ 〈“0”〉)) = ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0, 1, 0))) |
| 8 | 1 | ltnri 11231 | . . . . 5 ⊢ ¬ 0 < 0 |
| 9 | neg1cn 12119 | . . . . . . . . 9 ⊢ -1 ∈ ℂ | |
| 10 | ax-1cn 11073 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 11 | prssi 4774 | . . . . . . . . 9 ⊢ ((-1 ∈ ℂ ∧ 1 ∈ ℂ) → {-1, 1} ⊆ ℂ) | |
| 12 | 9, 10, 11 | mp2an 692 | . . . . . . . 8 ⊢ {-1, 1} ⊆ ℂ |
| 13 | simpl 482 | . . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝐹 ∈ (Word ℝ ∖ {∅})) | |
| 14 | eldifsn 4739 | . . . . . . . . . . 11 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) ↔ (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅)) | |
| 15 | 13, 14 | sylib 218 | . . . . . . . . . 10 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅)) |
| 16 | lennncl 14445 | . . . . . . . . . 10 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ∈ ℕ) | |
| 17 | fzo0end 13662 | . . . . . . . . . 10 ⊢ ((♯‘𝐹) ∈ ℕ → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) | |
| 18 | 15, 16, 17 | 3syl 18 | . . . . . . . . 9 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) |
| 19 | 2, 3, 4, 5 | signstfvcl 34609 | . . . . . . . . 9 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) → ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ {-1, 1}) |
| 20 | 18, 19 | mpdan 687 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ {-1, 1}) |
| 21 | 12, 20 | sselid 3928 | . . . . . . 7 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ ℂ) |
| 22 | 21 | mul01d 11321 | . . . . . 6 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) = 0) |
| 23 | 22 | breq1d 5105 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0 ↔ 0 < 0)) |
| 24 | 8, 23 | mtbiri 327 | . . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ¬ (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0) |
| 25 | 24 | iffalsed 4487 | . . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0, 1, 0) = 0) |
| 26 | 25 | oveq2d 7370 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0, 1, 0)) = ((𝑉‘𝐹) + 0)) |
| 27 | 2, 3, 4, 5 | signsvvf 34615 | . . . . . 6 ⊢ 𝑉:Word ℝ⟶ℕ0 |
| 28 | 27 | a1i 11 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝑉:Word ℝ⟶ℕ0) |
| 29 | 13 | eldifad 3910 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝐹 ∈ Word ℝ) |
| 30 | 28, 29 | ffvelcdmd 7026 | . . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘𝐹) ∈ ℕ0) |
| 31 | 30 | nn0cnd 12453 | . . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘𝐹) ∈ ℂ) |
| 32 | 31 | addridd 11322 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑉‘𝐹) + 0) = (𝑉‘𝐹)) |
| 33 | 7, 26, 32 | 3eqtrd 2772 | 1 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘(𝐹 ++ 〈“0”〉)) = (𝑉‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2929 ∖ cdif 3895 ⊆ wss 3898 ∅c0 4282 ifcif 4476 {csn 4577 {cpr 4579 {ctp 4581 〈cop 4583 class class class wbr 5095 ↦ cmpt 5176 ⟶wf 6484 ‘cfv 6488 (class class class)co 7354 ∈ cmpo 7356 ℂcc 11013 ℝcr 11014 0cc0 11015 1c1 11016 + caddc 11018 · cmul 11020 < clt 11155 − cmin 11353 -cneg 11354 ℕcn 12134 ℕ0cn0 12390 ...cfz 13411 ..^cfzo 13558 ♯chash 14241 Word cword 14424 ++ cconcat 14481 〈“cs1 14507 sgncsgn 14997 Σcsu 15597 ndxcnx 17108 Basecbs 17124 +gcplusg 17165 Σg cgsu 17348 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7676 ax-inf2 9540 ax-cnex 11071 ax-resscn 11072 ax-1cn 11073 ax-icn 11074 ax-addcl 11075 ax-addrcl 11076 ax-mulcl 11077 ax-mulrcl 11078 ax-mulcom 11079 ax-addass 11080 ax-mulass 11081 ax-distr 11082 ax-i2m1 11083 ax-1ne0 11084 ax-1rid 11085 ax-rnegex 11086 ax-rrecex 11087 ax-cnre 11088 ax-pre-lttri 11089 ax-pre-lttrn 11090 ax-pre-ltadd 11091 ax-pre-mulgt0 11092 ax-pre-sup 11093 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-se 5575 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-isom 6497 df-riota 7311 df-ov 7357 df-oprab 7358 df-mpo 7359 df-om 7805 df-1st 7929 df-2nd 7930 df-supp 8099 df-frecs 8219 df-wrecs 8250 df-recs 8299 df-rdg 8337 df-1o 8393 df-er 8630 df-en 8878 df-dom 8879 df-sdom 8880 df-fin 8881 df-sup 9335 df-oi 9405 df-card 9841 df-pnf 11157 df-mnf 11158 df-xr 11159 df-ltxr 11160 df-le 11161 df-sub 11355 df-neg 11356 df-div 11784 df-nn 12135 df-2 12197 df-3 12198 df-n0 12391 df-xnn0 12464 df-z 12478 df-uz 12741 df-rp 12895 df-fz 13412 df-fzo 13559 df-seq 13913 df-exp 13973 df-hash 14242 df-word 14425 df-lsw 14474 df-concat 14482 df-s1 14508 df-substr 14553 df-pfx 14583 df-sgn 14998 df-cj 15010 df-re 15011 df-im 15012 df-sqrt 15146 df-abs 15147 df-clim 15399 df-sum 15598 df-struct 17062 df-slot 17097 df-ndx 17109 df-base 17125 df-plusg 17178 df-0g 17349 df-gsum 17350 df-mgm 18552 df-sgrp 18631 df-mnd 18647 df-mulg 18985 df-cntz 19233 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |