![]() |
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 9919 | . . 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 29985 | . . 3 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 0 ∈ ℝ) → (𝑉‘(𝐹 ++ 〈“0”〉)) = ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((#‘𝐹) − 1)) · 0) < 0, 1, 0))) |
7 | 1, 6 | mpan2 703 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘(𝐹 ++ 〈“0”〉)) = ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((#‘𝐹) − 1)) · 0) < 0, 1, 0))) |
8 | 1 | ltnri 10025 | . . . . 5 ⊢ ¬ 0 < 0 |
9 | neg1cn 11001 | . . . . . . . . 9 ⊢ -1 ∈ ℂ | |
10 | ax-1cn 9873 | . . . . . . . . 9 ⊢ 1 ∈ ℂ | |
11 | prssi 4293 | . . . . . . . . 9 ⊢ ((-1 ∈ ℂ ∧ 1 ∈ ℂ) → {-1, 1} ⊆ ℂ) | |
12 | 9, 10, 11 | mp2an 704 | . . . . . . . 8 ⊢ {-1, 1} ⊆ ℂ |
13 | simpl 472 | . . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝐹 ∈ (Word ℝ ∖ {∅})) | |
14 | eldifsn 4260 | . . . . . . . . . . 11 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) ↔ (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅)) | |
15 | 13, 14 | sylib 207 | . . . . . . . . . 10 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅)) |
16 | lennncl 13180 | . . . . . . . . . 10 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅) → (#‘𝐹) ∈ ℕ) | |
17 | fzo0end 12426 | . . . . . . . . . 10 ⊢ ((#‘𝐹) ∈ ℕ → ((#‘𝐹) − 1) ∈ (0..^(#‘𝐹))) | |
18 | 15, 16, 17 | 3syl 18 | . . . . . . . . 9 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((#‘𝐹) − 1) ∈ (0..^(#‘𝐹))) |
19 | 2, 3, 4, 5 | signstfvcl 29976 | . . . . . . . . 9 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ ((#‘𝐹) − 1) ∈ (0..^(#‘𝐹))) → ((𝑇‘𝐹)‘((#‘𝐹) − 1)) ∈ {-1, 1}) |
20 | 18, 19 | mpdan 699 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑇‘𝐹)‘((#‘𝐹) − 1)) ∈ {-1, 1}) |
21 | 12, 20 | sseldi 3566 | . . . . . . 7 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑇‘𝐹)‘((#‘𝐹) − 1)) ∈ ℂ) |
22 | 21 | mul01d 10114 | . . . . . 6 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (((𝑇‘𝐹)‘((#‘𝐹) − 1)) · 0) = 0) |
23 | 22 | breq1d 4593 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((((𝑇‘𝐹)‘((#‘𝐹) − 1)) · 0) < 0 ↔ 0 < 0)) |
24 | 8, 23 | mtbiri 316 | . . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ¬ (((𝑇‘𝐹)‘((#‘𝐹) − 1)) · 0) < 0) |
25 | 24 | iffalsed 4047 | . . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → if((((𝑇‘𝐹)‘((#‘𝐹) − 1)) · 0) < 0, 1, 0) = 0) |
26 | 25 | oveq2d 6565 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((#‘𝐹) − 1)) · 0) < 0, 1, 0)) = ((𝑉‘𝐹) + 0)) |
27 | 2, 3, 4, 5 | signsvvf 29982 | . . . . . 6 ⊢ 𝑉:Word ℝ⟶ℕ0 |
28 | 27 | a1i 11 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝑉:Word ℝ⟶ℕ0) |
29 | 13 | eldifad 3552 | . . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → 𝐹 ∈ Word ℝ) |
30 | 28, 29 | ffvelrnd 6268 | . . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘𝐹) ∈ ℕ0) |
31 | 30 | nn0cnd 11230 | . . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘𝐹) ∈ ℂ) |
32 | 31 | addid1d 10115 | . 2 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → ((𝑉‘𝐹) + 0) = (𝑉‘𝐹)) |
33 | 7, 26, 32 | 3eqtrd 2648 | 1 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) → (𝑉‘(𝐹 ++ 〈“0”〉)) = (𝑉‘𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∖ cdif 3537 ⊆ wss 3540 ∅c0 3874 ifcif 4036 {csn 4125 {cpr 4127 {ctp 4129 〈cop 4131 class class class wbr 4583 ↦ cmpt 4643 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 ↦ cmpt2 6551 ℂcc 9813 ℝcr 9814 0cc0 9815 1c1 9816 + caddc 9818 · cmul 9820 < clt 9953 − cmin 10145 -cneg 10146 ℕcn 10897 ℕ0cn0 11169 ...cfz 12197 ..^cfzo 12334 #chash 12979 Word cword 13146 ++ cconcat 13148 〈“cs1 13149 sgncsgn 13674 Σcsu 14264 ndxcnx 15692 Basecbs 15695 +gcplusg 15768 Σg cgsu 15924 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-supp 7183 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-oi 8298 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-xnn0 11241 df-z 11255 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-seq 12664 df-exp 12723 df-hash 12980 df-word 13154 df-lsw 13155 df-concat 13156 df-s1 13157 df-substr 13158 df-sgn 13675 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-clim 14067 df-sum 14265 df-struct 15697 df-ndx 15698 df-slot 15699 df-base 15700 df-plusg 15781 df-0g 15925 df-gsum 15926 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-mulg 17364 df-cntz 17573 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |