| 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 11114 | . . 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 34593 | . . 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 11222 | . . . . 5 ⊢ ¬ 0 < 0 |
| 9 | neg1cn 12110 | . . . . . . . . 9 ⊢ -1 ∈ ℂ | |
| 10 | ax-1cn 11064 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 11 | prssi 4773 | . . . . . . . . 9 ⊢ ((-1 ∈ ℂ ∧ 1 ∈ ℂ) → {-1, 1} ⊆ ℂ) | |
| 12 | 9, 10, 11 | mp2an 692 | . . . . . . . 8 ⊢ {-1, 1} ⊆ ℂ |
| 13 | simpl 482 | . . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝐹 ∈ (Word ℝ ∖ {∅})) | |
| 14 | eldifsn 4738 | . . . . . . . . . . 11 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) ↔ (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅)) | |
| 15 | 13, 14 | sylib 218 | . . . . . . . . . 10 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅)) |
| 16 | lennncl 14441 | . . . . . . . . . 10 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ∈ ℕ) | |
| 17 | fzo0end 13658 | . . . . . . . . . 10 ⊢ ((♯‘𝐹) ∈ ℕ → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) | |
| 18 | 15, 16, 17 | 3syl 18 | . . . . . . . . 9 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) |
| 19 | 2, 3, 4, 5 | signstfvcl 34584 | . . . . . . . . 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 3932 | . . . . . . 7 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ ℂ) |
| 22 | 21 | mul01d 11312 | . . . . . 6 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) = 0) |
| 23 | 22 | breq1d 5101 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0 ↔ 0 < 0)) |
| 24 | 8, 23 | mtbiri 327 | . . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ¬ (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0) |
| 25 | 24 | iffalsed 4486 | . . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0, 1, 0) = 0) |
| 26 | 25 | oveq2d 7362 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0, 1, 0)) = ((𝑉‘𝐹) + 0)) |
| 27 | 2, 3, 4, 5 | signsvvf 34590 | . . . . . 6 ⊢ 𝑉:Word ℝ⟶ℕ0 |
| 28 | 27 | a1i 11 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝑉:Word ℝ⟶ℕ0) |
| 29 | 13 | eldifad 3914 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝐹 ∈ Word ℝ) |
| 30 | 28, 29 | ffvelcdmd 7018 | . . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘𝐹) ∈ ℕ0) |
| 31 | 30 | nn0cnd 12444 | . . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘𝐹) ∈ ℂ) |
| 32 | 31 | addridd 11313 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑉‘𝐹) + 0) = (𝑉‘𝐹)) |
| 33 | 7, 26, 32 | 3eqtrd 2770 | 1 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘(𝐹 ++ 〈“0”〉)) = (𝑉‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2111 ≠ wne 2928 ∖ cdif 3899 ⊆ wss 3902 ∅c0 4283 ifcif 4475 {csn 4576 {cpr 4578 {ctp 4580 〈cop 4582 class class class wbr 5091 ↦ cmpt 5172 ⟶wf 6477 ‘cfv 6481 (class class class)co 7346 ∈ cmpo 7348 ℂcc 11004 ℝcr 11005 0cc0 11006 1c1 11007 + caddc 11009 · cmul 11011 < clt 11146 − cmin 11344 -cneg 11345 ℕcn 12125 ℕ0cn0 12381 ...cfz 13407 ..^cfzo 13554 ♯chash 14237 Word cword 14420 ++ cconcat 14477 〈“cs1 14503 sgncsgn 14993 Σcsu 15593 ndxcnx 17104 Basecbs 17120 +gcplusg 17161 Σg cgsu 17344 |
| 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 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-inf2 9531 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 ax-pre-sup 11084 |
| 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 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-uni 4860 df-int 4898 df-iun 4943 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-se 5570 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-om 7797 df-1st 7921 df-2nd 7922 df-supp 8091 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-er 8622 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-sup 9326 df-oi 9396 df-card 9832 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-div 11775 df-nn 12126 df-2 12188 df-3 12189 df-n0 12382 df-xnn0 12455 df-z 12469 df-uz 12733 df-rp 12891 df-fz 13408 df-fzo 13555 df-seq 13909 df-exp 13969 df-hash 14238 df-word 14421 df-lsw 14470 df-concat 14478 df-s1 14504 df-substr 14549 df-pfx 14579 df-sgn 14994 df-cj 15006 df-re 15007 df-im 15008 df-sqrt 15142 df-abs 15143 df-clim 15395 df-sum 15594 df-struct 17058 df-slot 17093 df-ndx 17105 df-base 17121 df-plusg 17174 df-0g 17345 df-gsum 17346 df-mgm 18548 df-sgrp 18627 df-mnd 18643 df-mulg 18981 df-cntz 19230 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |