signsvfn - Mathbox for Thierry Arnoux

	Mathbox for Thierry Arnoux		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > signsvfn		Structured version Visualization version GIF version

Theorem signsvfn 34585

Description: Number of changes in a word compared to a shorter word. (Contributed by Thierry Arnoux, 12-Oct-2018.)

**Hypotheses**
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))

**Assertion**
Ref	Expression
signsvfn	⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (𝑉‘(𝐹 ++ ⟨“𝐾”⟩)) = ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 𝐾) < 0, 1, 0)))

Distinct variable groups: 𝑎,𝑏, ⨣ 𝑓,𝑖,𝑛,𝐹 𝑓,𝐾,𝑖,𝑛 𝑓,𝑊,𝑖,𝑛 𝑖,𝑎,𝑗,𝑛,𝐹,𝑏 𝐾,𝑎,𝑏,𝑗,𝑓 𝑇,𝑎 𝑓,𝑏,𝑇,𝑗,𝑛 Allowed substitution hints: ⨣ (𝑓,𝑖,𝑗,𝑛) 𝑇(𝑖) 𝑉(𝑓,𝑖,𝑗,𝑛,𝑎,𝑏) 𝑊(𝑗,𝑎,𝑏)

**Proof of Theorem signsvfn**
Step	Hyp	Ref	Expression
1		eldifi 4079	. . . . . 6 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) → 𝐹 ∈ Word ℝ)
2		s1cl 14502	. . . . . 6 ⊢ (𝐾 ∈ ℝ → ⟨“𝐾”⟩ ∈ Word ℝ)
3		ccatcl 14473	. . . . . 6 ⊢ ((𝐹 ∈ Word ℝ ∧ ⟨“𝐾”⟩ ∈ Word ℝ) → (𝐹 ++ ⟨“𝐾”⟩) ∈ Word ℝ)
4	1, 2, 3	syl2an 596	. . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (𝐹 ++ ⟨“𝐾”⟩) ∈ Word ℝ)
5		signsv.p	. . . . . 6 ⊢ ⨣ = (𝑎 ∈ {-1, 0, 1}, 𝑏 ∈ {-1, 0, 1} ↦ if(𝑏 = 0, 𝑎, 𝑏))
6		signsv.w	. . . . . 6 ⊢ 𝑊 = {⟨(Base‘ndx), {-1, 0, 1}⟩, ⟨(+_g‘ndx), ⨣ ⟩}
7		signsv.t	. . . . . 6 ⊢ 𝑇 = (𝑓 ∈ Word ℝ ↦ (𝑛 ∈ (0..^(♯‘𝑓)) ↦ (𝑊 Σ_g (𝑖 ∈ (0...𝑛) ↦ (sgn‘(𝑓‘𝑖))))))
8		signsv.v	. . . . . 6 ⊢ 𝑉 = (𝑓 ∈ Word ℝ ↦ Σ𝑗 ∈ (1..^(♯‘𝑓))if(((𝑇‘𝑓)‘𝑗) ≠ ((𝑇‘𝑓)‘(𝑗 − 1)), 1, 0))
9	5, 6, 7, 8	signsvvfval 34581	. . . . 5 ⊢ ((𝐹 ++ ⟨“𝐾”⟩) ∈ Word ℝ → (𝑉‘(𝐹 ++ ⟨“𝐾”⟩)) = Σ𝑗 ∈ (1..^(♯‘(𝐹 ++ ⟨“𝐾”⟩)))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0))
10	4, 9	syl 17	. . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (𝑉‘(𝐹 ++ ⟨“𝐾”⟩)) = Σ𝑗 ∈ (1..^(♯‘(𝐹 ++ ⟨“𝐾”⟩)))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0))
11		ccatlen 14474	. . . . . . . 8 ⊢ ((𝐹 ∈ Word ℝ ∧ ⟨“𝐾”⟩ ∈ Word ℝ) → (♯‘(𝐹 ++ ⟨“𝐾”⟩)) = ((♯‘𝐹) + (♯‘⟨“𝐾”⟩)))
12	1, 2, 11	syl2an 596	. . . . . . 7 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (♯‘(𝐹 ++ ⟨“𝐾”⟩)) = ((♯‘𝐹) + (♯‘⟨“𝐾”⟩)))
13		s1len 14506	. . . . . . . 8 ⊢ (♯‘⟨“𝐾”⟩) = 1
14	13	oveq2i 7352	. . . . . . 7 ⊢ ((♯‘𝐹) + (♯‘⟨“𝐾”⟩)) = ((♯‘𝐹) + 1)
15	12, 14	eqtrdi 2781	. . . . . 6 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (♯‘(𝐹 ++ ⟨“𝐾”⟩)) = ((♯‘𝐹) + 1))
16	15	oveq2d 7357	. . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (1..^(♯‘(𝐹 ++ ⟨“𝐾”⟩))) = (1..^((♯‘𝐹) + 1)))
17	16	sumeq1d 15599	. . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → Σ𝑗 ∈ (1..^(♯‘(𝐹 ++ ⟨“𝐾”⟩)))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) = Σ𝑗 ∈ (1..^((♯‘𝐹) + 1))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0))
18		eldifsn 4736	. . . . . . . 8 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) ↔ (𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅))
19		lennncl 14433	. . . . . . . 8 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝐹 ≠ ∅) → (♯‘𝐹) ∈ ℕ)
20	18, 19	sylbi 217	. . . . . . 7 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) → (♯‘𝐹) ∈ ℕ)
21		nnuz 12767	. . . . . . 7 ⊢ ℕ = (ℤ_≥‘1)
22	20, 21	eleqtrdi 2839	. . . . . 6 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) → (♯‘𝐹) ∈ (ℤ_≥‘1))
23	22	adantr 480	. . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (♯‘𝐹) ∈ (ℤ_≥‘1))
24		1cnd 11099	. . . . . 6 ⊢ ((((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1...(♯‘𝐹))) ∧ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1))) → 1 ∈ ℂ)
25		0cnd 11097	. . . . . 6 ⊢ ((((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1...(♯‘𝐹))) ∧ ¬ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1))) → 0 ∈ ℂ)
26	24, 25	ifclda 4509	. . . . 5 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1...(♯‘𝐹))) → if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) ∈ ℂ)
27		fveq2 6817	. . . . . . 7 ⊢ (𝑗 = (♯‘𝐹) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) = ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)))
28		fvoveq1 7364	. . . . . . 7 ⊢ (𝑗 = (♯‘𝐹) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)) = ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)))
29	27, 28	neeq12d 2987	. . . . . 6 ⊢ (𝑗 = (♯‘𝐹) → (((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)) ↔ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1))))
30	29	ifbid 4497	. . . . 5 ⊢ (𝑗 = (♯‘𝐹) → if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) = if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)), 1, 0))
31	23, 26, 30	fzosump1 15651	. . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → Σ𝑗 ∈ (1..^((♯‘𝐹) + 1))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) = (Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) + if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)), 1, 0)))
32	10, 17, 31	3eqtrd 2769	. . 3 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (𝑉‘(𝐹 ++ ⟨“𝐾”⟩)) = (Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) + if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)), 1, 0)))
33	32	adantlr 715	. 2 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (𝑉‘(𝐹 ++ ⟨“𝐾”⟩)) = (Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) + if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)), 1, 0)))
34		simpl 482	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → 𝐹 ∈ (Word ℝ ∖ {∅}))
35	34	eldifad 3912	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → 𝐹 ∈ Word ℝ)
36	35	adantr 480	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → 𝐹 ∈ Word ℝ)
37		simplr 768	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → 𝐾 ∈ ℝ)
38		fzo0ss1 13581	. . . . . . . . . . 11 ⊢ (1..^(♯‘𝐹)) ⊆ (0..^(♯‘𝐹))
39	38	a1i 11	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (1..^(♯‘𝐹)) ⊆ (0..^(♯‘𝐹)))
40	39	sselda 3932	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → 𝑗 ∈ (0..^(♯‘𝐹)))
41	5, 6, 7, 8	signstfvp 34574	. . . . . . . . 9 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝐾 ∈ ℝ ∧ 𝑗 ∈ (0..^(♯‘𝐹))) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) = ((𝑇‘𝐹)‘𝑗))
42	36, 37, 40, 41	syl3anc 1373	. . . . . . . 8 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) = ((𝑇‘𝐹)‘𝑗))
43		elfzoel2 13550	. . . . . . . . . . . . 13 ⊢ (𝑗 ∈ (1..^(♯‘𝐹)) → (♯‘𝐹) ∈ ℤ)
44	43	adantl 481	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → (♯‘𝐹) ∈ ℤ)
45		1nn0 12389	. . . . . . . . . . . 12 ⊢ 1 ∈ ℕ₀
46		eluzmn 12731	. . . . . . . . . . . 12 ⊢ (((♯‘𝐹) ∈ ℤ ∧ 1 ∈ ℕ₀) → (♯‘𝐹) ∈ (ℤ_≥‘((♯‘𝐹) − 1)))
47	44, 45, 46	sylancl 586	. . . . . . . . . . 11 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → (♯‘𝐹) ∈ (ℤ_≥‘((♯‘𝐹) − 1)))
48		fzoss2 13579	. . . . . . . . . . 11 ⊢ ((♯‘𝐹) ∈ (ℤ_≥‘((♯‘𝐹) − 1)) → (0..^((♯‘𝐹) − 1)) ⊆ (0..^(♯‘𝐹)))
49	47, 48	syl 17	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → (0..^((♯‘𝐹) − 1)) ⊆ (0..^(♯‘𝐹)))
50		elfzo1elm1fzo0 13660	. . . . . . . . . . 11 ⊢ (𝑗 ∈ (1..^(♯‘𝐹)) → (𝑗 − 1) ∈ (0..^((♯‘𝐹) − 1)))
51	50	adantl 481	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → (𝑗 − 1) ∈ (0..^((♯‘𝐹) − 1)))
52	49, 51	sseldd 3933	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → (𝑗 − 1) ∈ (0..^(♯‘𝐹)))
53	5, 6, 7, 8	signstfvp 34574	. . . . . . . . 9 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝐾 ∈ ℝ ∧ (𝑗 − 1) ∈ (0..^(♯‘𝐹))) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)) = ((𝑇‘𝐹)‘(𝑗 − 1)))
54	36, 37, 52, 53	syl3anc 1373	. . . . . . . 8 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)) = ((𝑇‘𝐹)‘(𝑗 − 1)))
55	42, 54	neeq12d 2987	. . . . . . 7 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → (((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)) ↔ ((𝑇‘𝐹)‘𝑗) ≠ ((𝑇‘𝐹)‘(𝑗 − 1))))
56	55	ifbid 4497	. . . . . 6 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) ∧ 𝑗 ∈ (1..^(♯‘𝐹))) → if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) = if(((𝑇‘𝐹)‘𝑗) ≠ ((𝑇‘𝐹)‘(𝑗 − 1)), 1, 0))
57	56	sumeq2dv 15601	. . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) = Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘𝐹)‘𝑗) ≠ ((𝑇‘𝐹)‘(𝑗 − 1)), 1, 0))
58	5, 6, 7, 8	signsvvfval 34581	. . . . . 6 ⊢ (𝐹 ∈ Word ℝ → (𝑉‘𝐹) = Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘𝐹)‘𝑗) ≠ ((𝑇‘𝐹)‘(𝑗 − 1)), 1, 0))
59	35, 58	syl 17	. . . . 5 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → (𝑉‘𝐹) = Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘𝐹)‘𝑗) ≠ ((𝑇‘𝐹)‘(𝑗 − 1)), 1, 0))
60	57, 59	eqtr4d 2768	. . . 4 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) = (𝑉‘𝐹))
61	60	adantlr 715	. . 3 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) = (𝑉‘𝐹))
62	5, 6, 7, 8	signstfvn 34572	. . . . . . 7 ⊢ ((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ 𝐾 ∈ ℝ) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) = (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ⨣ (sgn‘𝐾)))
63	62	adantlr 715	. . . . . 6 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) = (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ⨣ (sgn‘𝐾)))
64	35	adantlr 715	. . . . . . 7 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → 𝐹 ∈ Word ℝ)
65		simpr 484	. . . . . . 7 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → 𝐾 ∈ ℝ)
66		fzo0end 13650	. . . . . . . . 9 ⊢ ((♯‘𝐹) ∈ ℕ → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹)))
67	20, 66	syl 17	. . . . . . . 8 ⊢ (𝐹 ∈ (Word ℝ ∖ {∅}) → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹)))
68	67	ad2antrr 726	. . . . . . 7 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹)))
69	5, 6, 7, 8	signstfvp 34574	. . . . . . 7 ⊢ ((𝐹 ∈ Word ℝ ∧ 𝐾 ∈ ℝ ∧ ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)) = ((𝑇‘𝐹)‘((♯‘𝐹) − 1)))
70	64, 65, 68, 69	syl3anc 1373	. . . . . 6 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)) = ((𝑇‘𝐹)‘((♯‘𝐹) − 1)))
71	63, 70	neeq12d 2987	. . . . 5 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)) ↔ (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ⨣ (sgn‘𝐾)) ≠ ((𝑇‘𝐹)‘((♯‘𝐹) − 1))))
72	5, 6, 7, 8	signstfvcl 34576	. . . . . . 7 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ ((♯‘𝐹) − 1) ∈ (0..^(♯‘𝐹))) → ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ {-1, 1})
73	68, 72	syldan 591	. . . . . 6 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ {-1, 1})
74		rexr 11150	. . . . . . . 8 ⊢ (𝐾 ∈ ℝ → 𝐾 ∈ ℝ^*)
75		sgncl 32804	. . . . . . . 8 ⊢ (𝐾 ∈ ℝ^* → (sgn‘𝐾) ∈ {-1, 0, 1})
76	74, 75	syl 17	. . . . . . 7 ⊢ (𝐾 ∈ ℝ → (sgn‘𝐾) ∈ {-1, 0, 1})
77	76	adantl 481	. . . . . 6 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (sgn‘𝐾) ∈ {-1, 0, 1})
78	5, 6	signswch 34564	. . . . . 6 ⊢ ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ {-1, 1} ∧ (sgn‘𝐾) ∈ {-1, 0, 1}) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ⨣ (sgn‘𝐾)) ≠ ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ↔ (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · (sgn‘𝐾)) < 0))
79	73, 77, 78	syl2anc 584	. . . . 5 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ⨣ (sgn‘𝐾)) ≠ ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ↔ (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · (sgn‘𝐾)) < 0))
80	65	rexrd 11154	. . . . . . . . 9 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → 𝐾 ∈ ℝ^*)
81		sgnsgn 32814	. . . . . . . . 9 ⊢ (𝐾 ∈ ℝ^* → (sgn‘(sgn‘𝐾)) = (sgn‘𝐾))
82	80, 81	syl 17	. . . . . . . 8 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (sgn‘(sgn‘𝐾)) = (sgn‘𝐾))
83	82	oveq2d 7357	. . . . . . 7 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((sgn‘((𝑇‘𝐹)‘((♯‘𝐹) − 1))) · (sgn‘(sgn‘𝐾))) = ((sgn‘((𝑇‘𝐹)‘((♯‘𝐹) − 1))) · (sgn‘𝐾)))
84	83	breq1d 5099	. . . . . 6 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (((sgn‘((𝑇‘𝐹)‘((♯‘𝐹) − 1))) · (sgn‘(sgn‘𝐾))) < 0 ↔ ((sgn‘((𝑇‘𝐹)‘((♯‘𝐹) − 1))) · (sgn‘𝐾)) < 0))
85		neg1rr 12103	. . . . . . . . 9 ⊢ -1 ∈ ℝ
86		1re 11104	. . . . . . . . 9 ⊢ 1 ∈ ℝ
87		prssi 4771	. . . . . . . . 9 ⊢ ((-1 ∈ ℝ ∧ 1 ∈ ℝ) → {-1, 1} ⊆ ℝ)
88	85, 86, 87	mp2an 692	. . . . . . . 8 ⊢ {-1, 1} ⊆ ℝ
89	88, 73	sselid 3930	. . . . . . 7 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ ℝ)
90		sgnclre 32805	. . . . . . . 8 ⊢ (𝐾 ∈ ℝ → (sgn‘𝐾) ∈ ℝ)
91	90	adantl 481	. . . . . . 7 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (sgn‘𝐾) ∈ ℝ)
92		sgnmulsgn 32815	. . . . . . 7 ⊢ ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ ℝ ∧ (sgn‘𝐾) ∈ ℝ) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · (sgn‘𝐾)) < 0 ↔ ((sgn‘((𝑇‘𝐹)‘((♯‘𝐹) − 1))) · (sgn‘(sgn‘𝐾))) < 0))
93	89, 91, 92	syl2anc 584	. . . . . 6 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · (sgn‘𝐾)) < 0 ↔ ((sgn‘((𝑇‘𝐹)‘((♯‘𝐹) − 1))) · (sgn‘(sgn‘𝐾))) < 0))
94		sgnmulsgn 32815	. . . . . . 7 ⊢ ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) ∈ ℝ ∧ 𝐾 ∈ ℝ) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 𝐾) < 0 ↔ ((sgn‘((𝑇‘𝐹)‘((♯‘𝐹) − 1))) · (sgn‘𝐾)) < 0))
95	89, 94	sylancom 588	. . . . . 6 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 𝐾) < 0 ↔ ((sgn‘((𝑇‘𝐹)‘((♯‘𝐹) − 1))) · (sgn‘𝐾)) < 0))
96	84, 93, 95	3bitr4d 311	. . . . 5 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → ((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · (sgn‘𝐾)) < 0 ↔ (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 𝐾) < 0))
97	71, 79, 96	3bitrd 305	. . . 4 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)) ↔ (((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 𝐾) < 0))
98	97	ifbid 4497	. . 3 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)), 1, 0) = if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 𝐾) < 0, 1, 0))
99	61, 98	oveq12d 7359	. 2 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (Σ𝑗 ∈ (1..^(♯‘𝐹))if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘𝑗) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(𝑗 − 1)), 1, 0) + if(((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘(♯‘𝐹)) ≠ ((𝑇‘(𝐹 ++ ⟨“𝐾”⟩))‘((♯‘𝐹) − 1)), 1, 0)) = ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 𝐾) < 0, 1, 0)))
100	33, 99	eqtrd 2765	1 ⊢ (((𝐹 ∈ (Word ℝ ∖ {∅}) ∧ (𝐹‘0) ≠ 0) ∧ 𝐾 ∈ ℝ) → (𝑉‘(𝐹 ++ ⟨“𝐾”⟩)) = ((𝑉‘𝐹) + if((((𝑇‘𝐹)‘((♯‘𝐹) − 1)) · 𝐾) < 0, 1, 0)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2110 ≠ wne 2926 ∖ cdif 3897 ⊆ wss 3900 ∅c0 4281 ifcif 4473 {csn 4574 {cpr 4576 {ctp 4578 ⟨cop 4580 class class class wbr 5089 ↦ cmpt 5170 ‘cfv 6477 (class class class)co 7341 ∈ cmpo 7343 ℂcc 10996 ℝcr 10997 0cc0 10998 1c1 10999 + caddc 11001 · cmul 11003 ℝ^*cxr 11137 < clt 11138 − cmin 11336 -cneg 11337 ℕcn 12117 ℕ₀cn0 12373 ℤcz 12460 ℤ_≥cuz 12724 ...cfz 13399 ..^cfzo 13546 ♯chash 14229 Word cword 14412 ++ cconcat 14469 ⟨“cs1 14495 sgncsgn 14985 Σcsu 15585 ndxcnx 17096 Basecbs 17112 +_gcplusg 17153 Σ_g cgsu 17336

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 2112 ax-9 2120 ax-10 2143 ax-11 2159 ax-12 2179 ax-ext 2702 ax-rep 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7663 ax-inf2 9526 ax-cnex 11054 ax-resscn 11055 ax-1cn 11056 ax-icn 11057 ax-addcl 11058 ax-addrcl 11059 ax-mulcl 11060 ax-mulrcl 11061 ax-mulcom 11062 ax-addass 11063 ax-mulass 11064 ax-distr 11065 ax-i2m1 11066 ax-1ne0 11067 ax-1rid 11068 ax-rnegex 11069 ax-rrecex 11070 ax-cnre 11071 ax-pre-lttri 11072 ax-pre-lttrn 11073 ax-pre-ltadd 11074 ax-pre-mulgt0 11075 ax-pre-sup 11076

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 2067 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3344 df-reu 3345 df-rab 3394 df-v 3436 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-tp 4579 df-op 4581 df-uni 4858 df-int 4896 df-iun 4941 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-se 5568 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 df-pred 6244 df-ord 6305 df-on 6306 df-lim 6307 df-suc 6308 df-iota 6433 df-fun 6479 df-fn 6480 df-f 6481 df-f1 6482 df-fo 6483 df-f1o 6484 df-fv 6485 df-isom 6486 df-riota 7298 df-ov 7344 df-oprab 7345 df-mpo 7346 df-om 7792 df-1st 7916 df-2nd 7917 df-supp 8086 df-frecs 8206 df-wrecs 8237 df-recs 8286 df-rdg 8324 df-1o 8380 df-er 8617 df-en 8865 df-dom 8866 df-sdom 8867 df-fin 8868 df-sup 9321 df-oi 9391 df-card 9824 df-pnf 11140 df-mnf 11141 df-xr 11142 df-ltxr 11143 df-le 11144 df-sub 11338 df-neg 11339 df-div 11767 df-nn 12118 df-2 12180 df-3 12181 df-n0 12374 df-xnn0 12447 df-z 12461 df-uz 12725 df-rp 12883 df-fz 13400 df-fzo 13547 df-seq 13901 df-exp 13961 df-hash 14230 df-word 14413 df-lsw 14462 df-concat 14470 df-s1 14496 df-substr 14541 df-pfx 14571 df-sgn 14986 df-cj 14998 df-re 14999 df-im 15000 df-sqrt 15134 df-abs 15135 df-clim 15387 df-sum 15586 df-struct 17050 df-slot 17085 df-ndx 17097 df-base 17113 df-plusg 17166 df-0g 17337 df-gsum 17338 df-mgm 18540 df-sgrp 18619 df-mnd 18635 df-mulg 18973 df-cntz 19222

This theorem is referenced by: signsvtp 34586 signsvtn 34587 signlem0 34590

W3C validator