Theorem ccatpfx 14740

Description: Concatenating a prefix with an adjacent subword makes a longer prefix. (Contributed by AV, 7-May-2020.)

Assertion

Ref	Expression
ccatpfx	⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))) → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) = (𝑆 prefix 𝑍))

Proof of Theorem ccatpfx

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		pfxcl 14717	. . . . . . 7 ⊢ (𝑆 ∈ Word 𝐴 → (𝑆 prefix 𝑌) ∈ Word 𝐴)
2		swrdcl 14685	. . . . . . 7 ⊢ (𝑆 ∈ Word 𝐴 → (𝑆 substr ⟨𝑌, 𝑍⟩) ∈ Word 𝐴)
3		ccatcl 14613	. . . . . . 7 ⊢ (((𝑆 prefix 𝑌) ∈ Word 𝐴 ∧ (𝑆 substr ⟨𝑌, 𝑍⟩) ∈ Word 𝐴) → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) ∈ Word 𝐴)
4	1, 2, 3	syl2anc 595	. . . . . 6 ⊢ (𝑆 ∈ Word 𝐴 → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) ∈ Word 𝐴)
5		wrdfn 14567	. . . . . 6 ⊢ (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) ∈ Word 𝐴 → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) Fn (0..^(♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)))))
6	4, 5	syl 18	. . . . 5 ⊢ (𝑆 ∈ Word 𝐴 → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) Fn (0..^(♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)))))
7	6	adantr 485	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) Fn (0..^(♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)))))
8		ccatlen 14614	. . . . . . . . 9 ⊢ (((𝑆 prefix 𝑌) ∈ Word 𝐴 ∧ (𝑆 substr ⟨𝑌, 𝑍⟩) ∈ Word 𝐴) → (♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))) = ((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩))))
9	1, 2, 8	syl2anc 595	. . . . . . . 8 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))) = ((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩))))
10	9	adantr 485	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))) = ((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩))))
11		fzass4 13592	. . . . . . . . . . 11 ⊢ ((𝑌 ∈ (0...(♯‘𝑆)) ∧ 𝑍 ∈ (𝑌...(♯‘𝑆))) ↔ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))))
12	11	biimpri 231	. . . . . . . . . 10 ⊢ ((𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))) → (𝑌 ∈ (0...(♯‘𝑆)) ∧ 𝑍 ∈ (𝑌...(♯‘𝑆))))
13	12	simpld 499	. . . . . . . . 9 ⊢ ((𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))) → 𝑌 ∈ (0...(♯‘𝑆)))
14		pfxlen 14723	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...(♯‘𝑆))) → (♯‘(𝑆 prefix 𝑌)) = 𝑌)
15	13, 14	sylan2 604	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (♯‘(𝑆 prefix 𝑌)) = 𝑌)
16		swrdlen 14687	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))) → (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩)) = (𝑍 − 𝑌))
17	16	3expb 1138	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩)) = (𝑍 − 𝑌))
18	15, 17	oveq12d 7430	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → ((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩))) = (𝑌 + (𝑍 − 𝑌)))
19		elfzelz 13553	. . . . . . . . . 10 ⊢ (𝑌 ∈ (0...𝑍) → 𝑌 ∈ ℤ)
20	19	zcnd 12702	. . . . . . . . 9 ⊢ (𝑌 ∈ (0...𝑍) → 𝑌 ∈ ℂ)
21		elfzelz 13553	. . . . . . . . . 10 ⊢ (𝑍 ∈ (0...(♯‘𝑆)) → 𝑍 ∈ ℤ)
22	21	zcnd 12702	. . . . . . . . 9 ⊢ (𝑍 ∈ (0...(♯‘𝑆)) → 𝑍 ∈ ℂ)
23		pncan3 11466	. . . . . . . . 9 ⊢ ((𝑌 ∈ ℂ ∧ 𝑍 ∈ ℂ) → (𝑌 + (𝑍 − 𝑌)) = 𝑍)
24	20, 22, 23	syl2an 607	. . . . . . . 8 ⊢ ((𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))) → (𝑌 + (𝑍 − 𝑌)) = 𝑍)
25	24	adantl 486	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (𝑌 + (𝑍 − 𝑌)) = 𝑍)
26	10, 18, 25	3eqtrd 2802	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))) = 𝑍)
27	26	oveq2d 7428	. . . . 5 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (0..^(♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)))) = (0..^𝑍))
28	27	fneq2d 6631	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) Fn (0..^(♯‘((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)))) ↔ ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) Fn (0..^𝑍)))
29	7, 28	mpbid 235	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) Fn (0..^𝑍))
30		pfxfn 14721	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑍 ∈ (0...(♯‘𝑆))) → (𝑆 prefix 𝑍) Fn (0..^𝑍))
31	30	adantrl 728	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (𝑆 prefix 𝑍) Fn (0..^𝑍))
32		id 23	. . . . . 6 ⊢ (𝑥 ∈ (0..^𝑍) → 𝑥 ∈ (0..^𝑍))
33	19	ad2antrl 740	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → 𝑌 ∈ ℤ)
34		fzospliti 13722	. . . . . 6 ⊢ ((𝑥 ∈ (0..^𝑍) ∧ 𝑌 ∈ ℤ) → (𝑥 ∈ (0..^𝑌) ∨ 𝑥 ∈ (𝑌..^𝑍)))
35	32, 33, 34	syl2anr 608	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑍)) → (𝑥 ∈ (0..^𝑌) ∨ 𝑥 ∈ (𝑌..^𝑍)))
36	1	ad2antrr 738	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑌)) → (𝑆 prefix 𝑌) ∈ Word 𝐴)
37	2	ad2antrr 738	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑌)) → (𝑆 substr ⟨𝑌, 𝑍⟩) ∈ Word 𝐴)
38	15	oveq2d 7428	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (0..^(♯‘(𝑆 prefix 𝑌))) = (0..^𝑌))
39	38	eleq2d 2849	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (𝑥 ∈ (0..^(♯‘(𝑆 prefix 𝑌))) ↔ 𝑥 ∈ (0..^𝑌)))
40	39	biimpar 482	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑌)) → 𝑥 ∈ (0..^(♯‘(𝑆 prefix 𝑌))))
41		ccatval1 14616	. . . . . . . 8 ⊢ (((𝑆 prefix 𝑌) ∈ Word 𝐴 ∧ (𝑆 substr ⟨𝑌, 𝑍⟩) ∈ Word 𝐴 ∧ 𝑥 ∈ (0..^(♯‘(𝑆 prefix 𝑌)))) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = ((𝑆 prefix 𝑌)‘𝑥))
42	36, 37, 40, 41	syl3anc 1398	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑌)) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = ((𝑆 prefix 𝑌)‘𝑥))
43		simpl 487	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → 𝑆 ∈ Word 𝐴)
44	13	adantl 486	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → 𝑌 ∈ (0...(♯‘𝑆)))
45		id 23	. . . . . . . 8 ⊢ (𝑥 ∈ (0..^𝑌) → 𝑥 ∈ (0..^𝑌))
46		pfxfv 14722	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...(♯‘𝑆)) ∧ 𝑥 ∈ (0..^𝑌)) → ((𝑆 prefix 𝑌)‘𝑥) = (𝑆‘𝑥))
47	43, 44, 45, 46	syl2an3an 1449	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑌)) → ((𝑆 prefix 𝑌)‘𝑥) = (𝑆‘𝑥))
48	42, 47	eqtrd 2798	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑌)) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = (𝑆‘𝑥))
49	1	ad2antrr 738	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (𝑆 prefix 𝑌) ∈ Word 𝐴)
50	2	ad2antrr 738	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (𝑆 substr ⟨𝑌, 𝑍⟩) ∈ Word 𝐴)
51	18, 25	eqtrd 2798	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → ((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩))) = 𝑍)
52	15, 51	oveq12d 7430	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → ((♯‘(𝑆 prefix 𝑌))..^((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩)))) = (𝑌..^𝑍))
53	52	eleq2d 2849	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (𝑥 ∈ ((♯‘(𝑆 prefix 𝑌))..^((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩)))) ↔ 𝑥 ∈ (𝑌..^𝑍)))
54	53	biimpar 482	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → 𝑥 ∈ ((♯‘(𝑆 prefix 𝑌))..^((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩)))))
55		ccatval2 14617	. . . . . . . 8 ⊢ (((𝑆 prefix 𝑌) ∈ Word 𝐴 ∧ (𝑆 substr ⟨𝑌, 𝑍⟩) ∈ Word 𝐴 ∧ 𝑥 ∈ ((♯‘(𝑆 prefix 𝑌))..^((♯‘(𝑆 prefix 𝑌)) + (♯‘(𝑆 substr ⟨𝑌, 𝑍⟩))))) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = ((𝑆 substr ⟨𝑌, 𝑍⟩)‘(𝑥 − (♯‘(𝑆 prefix 𝑌)))))
56	49, 50, 54, 55	syl3anc 1398	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = ((𝑆 substr ⟨𝑌, 𝑍⟩)‘(𝑥 − (♯‘(𝑆 prefix 𝑌)))))
57		id 23	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))) → (𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))))
58	57	3expb 1138	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))))
59	15	oveq2d 7428	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → (𝑥 − (♯‘(𝑆 prefix 𝑌))) = (𝑥 − 𝑌))
60	59	adantr 485	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (𝑥 − (♯‘(𝑆 prefix 𝑌))) = (𝑥 − 𝑌))
61		id 23	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝑌..^𝑍) → 𝑥 ∈ (𝑌..^𝑍))
62		fzosubel 13755	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ (𝑌..^𝑍) ∧ 𝑌 ∈ ℤ) → (𝑥 − 𝑌) ∈ ((𝑌 − 𝑌)..^(𝑍 − 𝑌)))
63	61, 33, 62	syl2anr 608	. . . . . . . . . 10 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (𝑥 − 𝑌) ∈ ((𝑌 − 𝑌)..^(𝑍 − 𝑌)))
64	20	subidd 11558	. . . . . . . . . . . . . 14 ⊢ (𝑌 ∈ (0...𝑍) → (𝑌 − 𝑌) = 0)
65	64	oveq1d 7427	. . . . . . . . . . . . 13 ⊢ (𝑌 ∈ (0...𝑍) → ((𝑌 − 𝑌)..^(𝑍 − 𝑌)) = (0..^(𝑍 − 𝑌)))
66	65	eleq2d 2849	. . . . . . . . . . . 12 ⊢ (𝑌 ∈ (0...𝑍) → ((𝑥 − 𝑌) ∈ ((𝑌 − 𝑌)..^(𝑍 − 𝑌)) ↔ (𝑥 − 𝑌) ∈ (0..^(𝑍 − 𝑌))))
67	66	ad2antrl 740	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → ((𝑥 − 𝑌) ∈ ((𝑌 − 𝑌)..^(𝑍 − 𝑌)) ↔ (𝑥 − 𝑌) ∈ (0..^(𝑍 − 𝑌))))
68	67	adantr 485	. . . . . . . . . 10 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → ((𝑥 − 𝑌) ∈ ((𝑌 − 𝑌)..^(𝑍 − 𝑌)) ↔ (𝑥 − 𝑌) ∈ (0..^(𝑍 − 𝑌))))
69	63, 68	mpbid 235	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (𝑥 − 𝑌) ∈ (0..^(𝑍 − 𝑌)))
70	60, 69	eqeltrd 2863	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (𝑥 − (♯‘(𝑆 prefix 𝑌))) ∈ (0..^(𝑍 − 𝑌)))
71		swrdfv 14688	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))) ∧ (𝑥 − (♯‘(𝑆 prefix 𝑌))) ∈ (0..^(𝑍 − 𝑌))) → ((𝑆 substr ⟨𝑌, 𝑍⟩)‘(𝑥 − (♯‘(𝑆 prefix 𝑌)))) = (𝑆‘((𝑥 − (♯‘(𝑆 prefix 𝑌))) + 𝑌)))
72	58, 70, 71	syl2an2r 697	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → ((𝑆 substr ⟨𝑌, 𝑍⟩)‘(𝑥 − (♯‘(𝑆 prefix 𝑌)))) = (𝑆‘((𝑥 − (♯‘(𝑆 prefix 𝑌))) + 𝑌)))
73	59	oveq1d 7427	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → ((𝑥 − (♯‘(𝑆 prefix 𝑌))) + 𝑌) = ((𝑥 − 𝑌) + 𝑌))
74	73	adantr 485	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → ((𝑥 − (♯‘(𝑆 prefix 𝑌))) + 𝑌) = ((𝑥 − 𝑌) + 𝑌))
75		elfzoelz 13689	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝑌..^𝑍) → 𝑥 ∈ ℤ)
76	75	zcnd 12702	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝑌..^𝑍) → 𝑥 ∈ ℂ)
77	20	ad2antrl 740	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → 𝑌 ∈ ℂ)
78		npcan 11467	. . . . . . . . . 10 ⊢ ((𝑥 ∈ ℂ ∧ 𝑌 ∈ ℂ) → ((𝑥 − 𝑌) + 𝑌) = 𝑥)
79	76, 77, 78	syl2anr 608	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → ((𝑥 − 𝑌) + 𝑌) = 𝑥)
80	74, 79	eqtrd 2798	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → ((𝑥 − (♯‘(𝑆 prefix 𝑌))) + 𝑌) = 𝑥)
81	80	fveq2d 6887	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (𝑆‘((𝑥 − (♯‘(𝑆 prefix 𝑌))) + 𝑌)) = (𝑆‘𝑥))
82	56, 72, 81	3eqtrd 2802	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (𝑌..^𝑍)) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = (𝑆‘𝑥))
83	48, 82	jaodan 972	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ (𝑥 ∈ (0..^𝑌) ∨ 𝑥 ∈ (𝑌..^𝑍))) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = (𝑆‘𝑥))
84	35, 83	syldan 602	. . . 4 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑍)) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = (𝑆‘𝑥))
85		pfxfv 14722	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑍 ∈ (0...(♯‘𝑆)) ∧ 𝑥 ∈ (0..^𝑍)) → ((𝑆 prefix 𝑍)‘𝑥) = (𝑆‘𝑥))
86	85	3expa 1136	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑍 ∈ (0...(♯‘𝑆))) ∧ 𝑥 ∈ (0..^𝑍)) → ((𝑆 prefix 𝑍)‘𝑥) = (𝑆‘𝑥))
87	86	adantlrl 732	. . . 4 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑍)) → ((𝑆 prefix 𝑍)‘𝑥) = (𝑆‘𝑥))
88	84, 87	eqtr4d 2801	. . 3 ⊢ (((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) ∧ 𝑥 ∈ (0..^𝑍)) → (((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩))‘𝑥) = ((𝑆 prefix 𝑍)‘𝑥))
89	29, 31, 88	eqfnfvd 7030	. 2 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆)))) → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) = (𝑆 prefix 𝑍))
90	89	3impb 1132	1 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑌 ∈ (0...𝑍) ∧ 𝑍 ∈ (0...(♯‘𝑆))) → ((𝑆 prefix 𝑌) ++ (𝑆 substr ⟨𝑌, 𝑍⟩)) = (𝑆 prefix 𝑍))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∨ wo 860   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  ⟨cop 4596   Fn wfn 6533  ‘cfv 6538  (class class class)co 7412  ℂcc 11099  0cc0 11101   + caddc 11104   − cmin 11442  ℤcz 12592  ...cfz 13536  ..^cfzo 13684  ♯chash 14368  Word cword 14552   ++ cconcat 14609   substr csubstr 14680   prefix cpfx 14710

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5239  ax-sep 5258  ax-nul 5270  ax-pow 5338  ax-pr 5406  ax-un 7734  ax-cnex 11157  ax-resscn 11158  ax-1cn 11159  ax-icn 11160  ax-addcl 11161  ax-addrcl 11162  ax-mulcl 11163  ax-mulrcl 11164  ax-mulcom 11165  ax-addass 11166  ax-mulass 11167  ax-distr 11168  ax-i2m1 11169  ax-1ne0 11170  ax-1rid 11171  ax-rnegex 11172  ax-rrecex 11173  ax-cnre 11174  ax-pre-lttri 11175  ax-pre-lttrn 11176  ax-pre-ltadd 11177  ax-pre-mulgt0 11178

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3746  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-int 4914  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-om 7864  df-1st 7987  df-2nd 7988  df-frecs 8279  df-wrecs 8310  df-recs 8359  df-rdg 8398  df-1o 8454  df-er 8695  df-en 8945  df-dom 8946  df-sdom 8947  df-fin 8948  df-card 9926  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11444  df-neg 11445  df-nn 12235  df-n0 12506  df-z 12593  df-uz 12864  df-fz 13537  df-fzo 13685  df-hash 14369  df-word 14553  df-concat 14610  df-substr 14681  df-pfx 14711

This theorem is referenced by:  pfxcctswrd  14749  wrdeqs1cat  14759  splid  14792  splval2  14796  efgredleme  19814  efgredlemc  19816  efgcpbllemb  19826  frgpuplem  19843  wrdsplex  33237