| 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 11134 | . . 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 34739 | . . 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 11242 | . . . . 5 ⊢ ¬ 0 < 0 |
| 9 | neg1cn 12130 | . . . . . . . . 9 ⊢ -1 ∈ ℂ | |
| 10 | ax-1cn 11084 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
| 11 | prssi 4777 | . . . . . . . . 9 ⊢ ((-1 ∈ ℂ ∧ 1 ∈ ℂ) → {-1, 1} ⊆ ℂ) | |
| 12 | 9, 10, 11 | mp2an 692 | . . . . . . . 8 ⊢ {-1, 1} ⊆ ℂ |
| 13 | simpl 482 | . . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝐹 ∈ (Word ℝ ∖ {∅})) | |
| 14 | eldifsn 4742 | . . . . . . . . . . 11 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) ↔ (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅)) | |
| 15 | 13, 14 | sylib 218 | . . . . . . . . . 10 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅)) |
| 16 | lennncl 14457 | . . . . . . . . . 10 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ∈ ℕ) | |
| 17 | fzo0end 13674 | . . . . . . . . . 10 ⊢ ((♯‘𝐹) ∈ ℕ → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) | |
| 18 | 15, 16, 17 | 3syl 18 | . . . . . . . . 9 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) |
| 19 | 2, 3, 4, 5 | signstfvcl 34730 | . . . . . . . . 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 3931 | . . . . . . 7 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ ℂ) |
| 22 | 21 | mul01d 11332 | . . . . . 6 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) = 0) |
| 23 | 22 | breq1d 5108 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0 ↔ 0 < 0)) |
| 24 | 8, 23 | mtbiri 327 | . . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ¬ (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0) |
| 25 | 24 | iffalsed 4490 | . . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0, 1, 0) = 0) |
| 26 | 25 | oveq2d 7374 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 0) < 0, 1, 0)) = ((𝑉‘𝐹) + 0)) |
| 27 | 2, 3, 4, 5 | signsvvf 34736 | . . . . . 6 ⊢ 𝑉:Word ℝ⟶ℕ0 |
| 28 | 27 | a1i 11 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝑉:Word ℝ⟶ℕ0) |
| 29 | 13 | eldifad 3913 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝐹 ∈ Word ℝ) |
| 30 | 28, 29 | ffvelcdmd 7030 | . . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘𝐹) ∈ ℕ0) |
| 31 | 30 | nn0cnd 12464 | . . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘𝐹) ∈ ℂ) |
| 32 | 31 | addridd 11333 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑉‘𝐹) + 0) = (𝑉‘𝐹)) |
| 33 | 7, 26, 32 | 3eqtrd 2775 | 1 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘(𝐹 ++ 〈“0”〉)) = (𝑉‘𝐹)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2932 ∖ cdif 3898 ⊆ wss 3901 ∅c0 4285 ifcif 4479 {csn 4580 {cpr 4582 {ctp 4584 〈cop 4586 class class class wbr 5098 ↦ cmpt 5179 ⟶wf 6488 ‘cfv 6492 (class class class)co 7358 ∈ cmpo 7360 ℂcc 11024 ℝcr 11025 0cc0 11026 1c1 11027 + caddc 11029 · cmul 11031 < clt 11166 − cmin 11364 -cneg 11365 ℕcn 12145 ℕ0cn0 12401 ...cfz 13423 ..^cfzo 13570 ♯chash 14253 Word cword 14436 ++ cconcat 14493 〈“cs1 14519 sgncsgn 15009 Σcsu 15609 ndxcnx 17120 Basecbs 17136 +gcplusg 17177 Σg cgsu 17360 |
| 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 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-tp 4585 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-supp 8103 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-sup 9345 df-oi 9415 df-card 9851 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-n0 12402 df-xnn0 12475 df-z 12489 df-uz 12752 df-rp 12906 df-fz 13424 df-fzo 13571 df-seq 13925 df-exp 13985 df-hash 14254 df-word 14437 df-lsw 14486 df-concat 14494 df-s1 14520 df-substr 14565 df-pfx 14595 df-sgn 15010 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-clim 15411 df-sum 15610 df-struct 17074 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-0g 17361 df-gsum 17362 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-mulg 18998 df-cntz 19246 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |