swrdccatin2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > swrdccatin2		Structured version Visualization version GIF version

Theorem swrdccatin2 14767

Description: The subword of a concatenation of two words within the second of the concatenated words. (Contributed by Alexander van der Vekens, 28-Mar-2018.) (Revised by Alexander van der Vekens, 27-May-2018.)

**Hypothesis**
Ref	Expression
swrdccatin2.l	⊢ 𝐿 = (♯‘𝐴)

**Assertion**
Ref	Expression
swrdccatin2	⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) = (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)))

Proof of Theorem swrdccatin2 Dummy variable 𝑘 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		swrdccatin2.l	. . . . . . . 8 ⊢ 𝐿 = (♯‘𝐴)
2		oveq1 7438	. . . . . . . . . 10 ⊢ (𝐿 = (♯‘𝐴) → (𝐿...𝑁) = ((♯‘𝐴)...𝑁))
3	2	eleq2d 2827	. . . . . . . . 9 ⊢ (𝐿 = (♯‘𝐴) → (𝑀 ∈ (𝐿...𝑁) ↔ 𝑀 ∈ ((♯‘𝐴)...𝑁)))
4		id 22	. . . . . . . . . . 11 ⊢ (𝐿 = (♯‘𝐴) → 𝐿 = (♯‘𝐴))
5		oveq1 7438	. . . . . . . . . . 11 ⊢ (𝐿 = (♯‘𝐴) → (𝐿 + (♯‘𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
6	4, 5	oveq12d 7449	. . . . . . . . . 10 ⊢ (𝐿 = (♯‘𝐴) → (𝐿...(𝐿 + (♯‘𝐵))) = ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))
7	6	eleq2d 2827	. . . . . . . . 9 ⊢ (𝐿 = (♯‘𝐴) → (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) ↔ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))))
8	3, 7	anbi12d 632	. . . . . . . 8 ⊢ (𝐿 = (♯‘𝐴) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) ↔ (𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))))
9	1, 8	ax-mp 5	. . . . . . 7 ⊢ ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) ↔ (𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))))
10		lencl 14571	. . . . . . . . 9 ⊢ (𝐴 ∈ Word 𝑉 → (♯‘𝐴) ∈ ℕ₀)
11		elnn0uz 12923	. . . . . . . . . . . 12 ⊢ ((♯‘𝐴) ∈ ℕ₀ ↔ (♯‘𝐴) ∈ (ℤ_≥‘0))
12		fzss1 13603	. . . . . . . . . . . 12 ⊢ ((♯‘𝐴) ∈ (ℤ_≥‘0) → ((♯‘𝐴)...𝑁) ⊆ (0...𝑁))
13	11, 12	sylbi 217	. . . . . . . . . . 11 ⊢ ((♯‘𝐴) ∈ ℕ₀ → ((♯‘𝐴)...𝑁) ⊆ (0...𝑁))
14	13	sseld 3982	. . . . . . . . . 10 ⊢ ((♯‘𝐴) ∈ ℕ₀ → (𝑀 ∈ ((♯‘𝐴)...𝑁) → 𝑀 ∈ (0...𝑁)))
15		fzss1 13603	. . . . . . . . . . . 12 ⊢ ((♯‘𝐴) ∈ (ℤ_≥‘0) → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
16	11, 15	sylbi 217	. . . . . . . . . . 11 ⊢ ((♯‘𝐴) ∈ ℕ₀ → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
17	16	sseld 3982	. . . . . . . . . 10 ⊢ ((♯‘𝐴) ∈ ℕ₀ → (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
18	14, 17	anim12d 609	. . . . . . . . 9 ⊢ ((♯‘𝐴) ∈ ℕ₀ → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
19	10, 18	syl 17	. . . . . . . 8 ⊢ (𝐴 ∈ Word 𝑉 → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
20	19	adantr 480	. . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
21	9, 20	biimtrid 242	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
22	21	imp 406	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
23		swrdccatfn 14762	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁 − 𝑀)))
24	22, 23	syldan 591	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁 − 𝑀)))
25		fzmmmeqm 13597	. . . . . . 7 ⊢ (𝑀 ∈ (𝐿...𝑁) → ((𝑁 − 𝐿) − (𝑀 − 𝐿)) = (𝑁 − 𝑀))
26	25	oveq2d 7447	. . . . . 6 ⊢ (𝑀 ∈ (𝐿...𝑁) → (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) = (0..^(𝑁 − 𝑀)))
27	26	fneq2d 6662	. . . . 5 ⊢ (𝑀 ∈ (𝐿...𝑁) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) ↔ ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁 − 𝑀))))
28	27	ad2antrl 728	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) ↔ ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁 − 𝑀))))
29	24, 28	mpbird 257	. . 3 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))))
30		simplr 769	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝐵 ∈ Word 𝑉)
31		elfzmlbm 13678	. . . . 5 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)))
32	31	ad2antrl 728	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)))
33		lencl 14571	. . . . . . . 8 ⊢ (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℕ₀)
34	33	nn0zd 12639	. . . . . . 7 ⊢ (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℤ)
35	34	adantl 481	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (♯‘𝐵) ∈ ℤ)
36		elfzmlbp 13679	. . . . . 6 ⊢ (((♯‘𝐵) ∈ ℤ ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
37	35, 36	sylan 580	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
38	37	adantrl 716	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
39		swrdvalfn 14689	. . . 4 ⊢ ((𝐵 ∈ Word 𝑉 ∧ (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)) ∧ (𝑁 − 𝐿) ∈ (0...(♯‘𝐵))) → (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))))
40	30, 32, 38, 39	syl3anc 1373	. . 3 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))))
41		simpll 767	. . . . . . 7 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉))
42		elfzelz 13564	. . . . . . . . . 10 ⊢ (𝑀 ∈ (𝐿...𝑁) → 𝑀 ∈ ℤ)
43		zaddcl 12657	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 + 𝑀) ∈ ℤ)
44	43	expcom 413	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
45	42, 44	syl 17	. . . . . . . . 9 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
46	45	ad2antrl 728	. . . . . . . 8 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
47		elfzoelz 13699	. . . . . . . 8 ⊢ (𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) → 𝑘 ∈ ℤ)
48	46, 47	impel 505	. . . . . . 7 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (𝑘 + 𝑀) ∈ ℤ)
49		df-3an 1089	. . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ) ↔ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑘 + 𝑀) ∈ ℤ))
50	41, 48, 49	sylanbrc 583	. . . . . 6 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ))
51		ccatsymb 14620	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))))
52	50, 51	syl 17	. . . . 5 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))))
53		elfz2 13554	. . . . . . . . 9 ⊢ (𝑀 ∈ (𝐿...𝑁) ↔ ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿 ≤ 𝑀 ∧ 𝑀 ≤ 𝑁)))
54		zre 12617	. . . . . . . . . . . . . . . . 17 ⊢ (𝐿 ∈ ℤ → 𝐿 ∈ ℝ)
55		zre 12617	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
56	54, 55	anim12i 613	. . . . . . . . . . . . . . . 16 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ))
57		elnn0z 12626	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ℕ₀ ↔ (𝑘 ∈ ℤ ∧ 0 ≤ 𝑘))
58		zre 12617	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℝ)
59		0re 11263	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ 0 ∈ ℝ
60	59	jctl 523	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ ℝ → (0 ∈ ℝ ∧ 𝐿 ∈ ℝ))
61	60	ad2antrl 728	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 ∈ ℝ ∧ 𝐿 ∈ ℝ))
62		id 22	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ))
63	62	adantrl 716	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ))
64		le2add 11745	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((0 ∈ ℝ ∧ 𝐿 ∈ ℝ) ∧ (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘 ∧ 𝐿 ≤ 𝑀) → (0 + 𝐿) ≤ (𝑘 + 𝑀)))
65	61, 63, 64	syl2anc 584	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘 ∧ 𝐿 ≤ 𝑀) → (0 + 𝐿) ≤ (𝑘 + 𝑀)))
66		recn 11245	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐿 ∈ ℝ → 𝐿 ∈ ℂ)
67	66	addlidd 11462	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ ℝ → (0 + 𝐿) = 𝐿)
68	67	ad2antrl 728	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 + 𝐿) = 𝐿)
69	68	breq1d 5153	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 + 𝐿) ≤ (𝑘 + 𝑀) ↔ 𝐿 ≤ (𝑘 + 𝑀)))
70	65, 69	sylibd 239	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘 ∧ 𝐿 ≤ 𝑀) → 𝐿 ≤ (𝑘 + 𝑀)))
71		simprl 771	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → 𝐿 ∈ ℝ)
72		readdcl 11238	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 + 𝑀) ∈ ℝ)
73	72	adantrl 716	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝑘 + 𝑀) ∈ ℝ)
74	71, 73	lenltd 11407	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝐿 ≤ (𝑘 + 𝑀) ↔ ¬ (𝑘 + 𝑀) < 𝐿))
75	70, 74	sylibd 239	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘 ∧ 𝐿 ≤ 𝑀) → ¬ (𝑘 + 𝑀) < 𝐿))
76	75	expd 415	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 ≤ 𝑘 → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
77	76	com12 32	. . . . . . . . . . . . . . . . . . 19 ⊢ (0 ≤ 𝑘 → ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
78	77	expd 415	. . . . . . . . . . . . . . . . . 18 ⊢ (0 ≤ 𝑘 → (𝑘 ∈ ℝ → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿))))
79	58, 78	mpan9 506	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ ℤ ∧ 0 ≤ 𝑘) → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
80	57, 79	sylbi 217	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ℕ₀ → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
81	56, 80	mpan9 506	. . . . . . . . . . . . . . 15 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℕ₀) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿))
82	1	breq2i 5151	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 + 𝑀) < 𝐿 ↔ (𝑘 + 𝑀) < (♯‘𝐴))
83	82	notbii 320	. . . . . . . . . . . . . . 15 ⊢ (¬ (𝑘 + 𝑀) < 𝐿 ↔ ¬ (𝑘 + 𝑀) < (♯‘𝐴))
84	81, 83	imbitrdi 251	. . . . . . . . . . . . . 14 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℕ₀) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
85	84	ex 412	. . . . . . . . . . . . 13 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℕ₀ → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
86	85	com23 86	. . . . . . . . . . . 12 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 ≤ 𝑀 → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
87	86	3adant2 1132	. . . . . . . . . . 11 ⊢ ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 ≤ 𝑀 → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
88	87	imp 406	. . . . . . . . . 10 ⊢ (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝐿 ≤ 𝑀) → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
89	88	adantrr 717	. . . . . . . . 9 ⊢ (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿 ≤ 𝑀 ∧ 𝑀 ≤ 𝑁)) → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
90	53, 89	sylbi 217	. . . . . . . 8 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
91	90	ad2antrl 728	. . . . . . 7 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
92		elfzonn0 13747	. . . . . . 7 ⊢ (𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) → 𝑘 ∈ ℕ₀)
93	91, 92	impel 505	. . . . . 6 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ¬ (𝑘 + 𝑀) < (♯‘𝐴))
94	93	iffalsed 4536	. . . . 5 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))) = (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴))))
95		zcn 12618	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℂ)
96	95	adantl 481	. . . . . . . . . . . . . . 15 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝑘 ∈ ℂ)
97		zcn 12618	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
98	97	ad2antlr 727	. . . . . . . . . . . . . . 15 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝑀 ∈ ℂ)
99		zcn 12618	. . . . . . . . . . . . . . . 16 ⊢ (𝐿 ∈ ℤ → 𝐿 ∈ ℂ)
100	99	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝐿 ∈ ℂ)
101	96, 98, 100	addsubassd 11640	. . . . . . . . . . . . . 14 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − 𝐿) = (𝑘 + (𝑀 − 𝐿)))
102		oveq2 7439	. . . . . . . . . . . . . . 15 ⊢ (𝐿 = (♯‘𝐴) → ((𝑘 + 𝑀) − 𝐿) = ((𝑘 + 𝑀) − (♯‘𝐴)))
103	102	eqeq1d 2739	. . . . . . . . . . . . . 14 ⊢ (𝐿 = (♯‘𝐴) → (((𝑘 + 𝑀) − 𝐿) = (𝑘 + (𝑀 − 𝐿)) ↔ ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
104	101, 103	imbitrid 244	. . . . . . . . . . . . 13 ⊢ (𝐿 = (♯‘𝐴) → (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
105	1, 104	ax-mp 5	. . . . . . . . . . . 12 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿)))
106	105	ex 412	. . . . . . . . . . 11 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
107	106	3adant2 1132	. . . . . . . . . 10 ⊢ ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
108	107	adantr 480	. . . . . . . . 9 ⊢ (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿 ≤ 𝑀 ∧ 𝑀 ≤ 𝑁)) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
109	53, 108	sylbi 217	. . . . . . . 8 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
110	109	ad2antrl 728	. . . . . . 7 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
111	110, 47	impel 505	. . . . . 6 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿)))
112	111	fveq2d 6910	. . . . 5 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴))) = (𝐵‘(𝑘 + (𝑀 − 𝐿))))
113	52, 94, 112	3eqtrd 2781	. . . 4 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = (𝐵‘(𝑘 + (𝑀 − 𝐿))))
114		ccatcl 14612	. . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (𝐴 ++ 𝐵) ∈ Word 𝑉)
115	114	adantr 480	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐴 ++ 𝐵) ∈ Word 𝑉)
116	11	biimpi 216	. . . . . . . . . 10 ⊢ ((♯‘𝐴) ∈ ℕ₀ → (♯‘𝐴) ∈ (ℤ_≥‘0))
117	1, 116	eqeltrid 2845	. . . . . . . . 9 ⊢ ((♯‘𝐴) ∈ ℕ₀ → 𝐿 ∈ (ℤ_≥‘0))
118		fzss1 13603	. . . . . . . . 9 ⊢ (𝐿 ∈ (ℤ_≥‘0) → (𝐿...𝑁) ⊆ (0...𝑁))
119	10, 117, 118	3syl 18	. . . . . . . 8 ⊢ (𝐴 ∈ Word 𝑉 → (𝐿...𝑁) ⊆ (0...𝑁))
120	119	sselda 3983	. . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (𝐿...𝑁)) → 𝑀 ∈ (0...𝑁))
121	120	ad2ant2r 747	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝑀 ∈ (0...𝑁))
122	1, 7	ax-mp 5	. . . . . . . . 9 ⊢ (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) ↔ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))
123	10, 116, 15	3syl 18	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Word 𝑉 → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
124	123	adantr 480	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
125	124	sseld 3982	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
126	125	impcom 407	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉)) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))
127		ccatlen 14613	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (♯‘(𝐴 ++ 𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
128	127	oveq2d 7447	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (0...(♯‘(𝐴 ++ 𝐵))) = (0...((♯‘𝐴) + (♯‘𝐵))))
129	128	eleq2d 2827	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))) ↔ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
130	129	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉)) → (𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))) ↔ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
131	126, 130	mpbird 257	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉)) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
132	131	ex 412	. . . . . . . . 9 ⊢ (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
133	122, 132	sylbi 217	. . . . . . . 8 ⊢ (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) → ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
134	133	impcom 407	. . . . . . 7 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
135	134	adantrl 716	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
136	115, 121, 135	3jca 1129	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) ∈ Word 𝑉 ∧ 𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
137	26	eleq2d 2827	. . . . . . 7 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) ↔ 𝑘 ∈ (0..^(𝑁 − 𝑀))))
138	137	ad2antrl 728	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) ↔ 𝑘 ∈ (0..^(𝑁 − 𝑀))))
139	138	biimpa 476	. . . . 5 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → 𝑘 ∈ (0..^(𝑁 − 𝑀)))
140		swrdfv 14686	. . . . 5 ⊢ ((((𝐴 ++ 𝐵) ∈ Word 𝑉 ∧ 𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))) ∧ 𝑘 ∈ (0..^(𝑁 − 𝑀))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)))
141	136, 139, 140	syl2an2r 685	. . . 4 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)))
142	34, 36	sylan 580	. . . . . . 7 ⊢ ((𝐵 ∈ Word 𝑉 ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
143	142	ad2ant2l 746	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
144	30, 32, 143	3jca 1129	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐵 ∈ Word 𝑉 ∧ (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)) ∧ (𝑁 − 𝐿) ∈ (0...(♯‘𝐵))))
145		swrdfv 14686	. . . . 5 ⊢ (((𝐵 ∈ Word 𝑉 ∧ (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)) ∧ (𝑁 − 𝐿) ∈ (0...(♯‘𝐵))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)‘𝑘) = (𝐵‘(𝑘 + (𝑀 − 𝐿))))
146	144, 145	sylan 580	. . . 4 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)‘𝑘) = (𝐵‘(𝑘 + (𝑀 − 𝐿))))
147	113, 141, 146	3eqtr4d 2787	. . 3 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)‘𝑘))
148	29, 40, 147	eqfnfvd 7054	. 2 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) = (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩))
149	148	ex 412	1 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) = (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ⊆ wss 3951 ifcif 4525 ⟨cop 4632 class class class wbr 5143 Fn wfn 6556 ‘cfv 6561 (class class class)co 7431 ℂcc 11153 ℝcr 11154 0cc0 11155 + caddc 11158 < clt 11295 ≤ cle 11296 − cmin 11492 ℕ₀cn0 12526 ℤcz 12613 ℤ_≥cuz 12878 ...cfz 13547 ..^cfzo 13694 ♯chash 14369 Word cword 14552 ++ cconcat 14608 substr csubstr 14678

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-n0 12527 df-z 12614 df-uz 12879 df-fz 13548 df-fzo 13695 df-hash 14370 df-word 14553 df-concat 14609 df-substr 14679

This theorem is referenced by: pfxccat3 14772 swrdccatin2d 14782

W3C validator