swrdccatin2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > swrdccatin2		GIF version

Theorem swrdccatin2 11501

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 6092	. . . . . . . . . 10 ⊢ (𝐿 = (♯‘𝐴) → (𝐿...𝑁) = ((♯‘𝐴)...𝑁))
3	2	eleq2d 2308	. . . . . . . . 9 ⊢ (𝐿 = (♯‘𝐴) → (𝑀 ∈ (𝐿...𝑁) ↔ 𝑀 ∈ ((♯‘𝐴)...𝑁)))
4		id 19	. . . . . . . . . . 11 ⊢ (𝐿 = (♯‘𝐴) → 𝐿 = (♯‘𝐴))
5		oveq1 6092	. . . . . . . . . . 11 ⊢ (𝐿 = (♯‘𝐴) → (𝐿 + (♯‘𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
6	4, 5	oveq12d 6103	. . . . . . . . . 10 ⊢ (𝐿 = (♯‘𝐴) → (𝐿...(𝐿 + (♯‘𝐵))) = ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))
7	6	eleq2d 2308	. . . . . . . . 9 ⊢ (𝐿 = (♯‘𝐴) → (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) ↔ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))))
8	3, 7	anbi12d 477	. . . . . . . 8 ⊢ (𝐿 = (♯‘𝐴) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) ↔ (𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))))
9	1, 8	ax-mp 5	. . . . . . 7 ⊢ ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) ↔ (𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))))
10		lencl 11308	. . . . . . . . 9 ⊢ (𝐴 ∈ Word 𝑉 → (♯‘𝐴) ∈ ℕ₀)
11		elnn0uz 9960	. . . . . . . . . . . 12 ⊢ ((♯‘𝐴) ∈ ℕ₀ ↔ (♯‘𝐴) ∈ (ℤ_≥‘0))
12		fzss1 10469	. . . . . . . . . . . 12 ⊢ ((♯‘𝐴) ∈ (ℤ_≥‘0) → ((♯‘𝐴)...𝑁) ⊆ (0...𝑁))
13	11, 12	sylbi 121	. . . . . . . . . . 11 ⊢ ((♯‘𝐴) ∈ ℕ₀ → ((♯‘𝐴)...𝑁) ⊆ (0...𝑁))
14	13	sseld 3247	. . . . . . . . . 10 ⊢ ((♯‘𝐴) ∈ ℕ₀ → (𝑀 ∈ ((♯‘𝐴)...𝑁) → 𝑀 ∈ (0...𝑁)))
15		fzss1 10469	. . . . . . . . . . . 12 ⊢ ((♯‘𝐴) ∈ (ℤ_≥‘0) → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
16	11, 15	sylbi 121	. . . . . . . . . . 11 ⊢ ((♯‘𝐴) ∈ ℕ₀ → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
17	16	sseld 3247	. . . . . . . . . 10 ⊢ ((♯‘𝐴) ∈ ℕ₀ → (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
18	14, 17	anim12d 335	. . . . . . . . 9 ⊢ ((♯‘𝐴) ∈ ℕ₀ → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
19	10, 18	syl 14	. . . . . . . 8 ⊢ (𝐴 ∈ Word 𝑉 → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
20	19	adantr 276	. . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝑀 ∈ ((♯‘𝐴)...𝑁) ∧ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
21	9, 20	biimtrid 152	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))))
22	21	imp 124	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
23		swrdccatfn 11496	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁 − 𝑀)))
24	22, 23	syldan 282	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁 − 𝑀)))
25		fzmmmeqm 10464	. . . . . . 7 ⊢ (𝑀 ∈ (𝐿...𝑁) → ((𝑁 − 𝐿) − (𝑀 − 𝐿)) = (𝑁 − 𝑀))
26	25	oveq2d 6101	. . . . . 6 ⊢ (𝑀 ∈ (𝐿...𝑁) → (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) = (0..^(𝑁 − 𝑀)))
27	26	fneq2d 5472	. . . . 5 ⊢ (𝑀 ∈ (𝐿...𝑁) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) ↔ ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁 − 𝑀))))
28	27	ad2antrl 494	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) ↔ ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^(𝑁 − 𝑀))))
29	24, 28	mpbird 167	. . 3 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))))
30		simplr 533	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝐵 ∈ Word 𝑉)
31		elfzmlbm 10538	. . . . 5 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)))
32	31	ad2antrl 494	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)))
33		lencl 11308	. . . . . . . 8 ⊢ (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℕ₀)
34	33	nn0zd 9766	. . . . . . 7 ⊢ (𝐵 ∈ Word 𝑉 → (♯‘𝐵) ∈ ℤ)
35	34	adantl 277	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (♯‘𝐵) ∈ ℤ)
36		elfzmlbp 10539	. . . . . 6 ⊢ (((♯‘𝐵) ∈ ℤ ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
37	35, 36	sylan 283	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
38	37	adantrl 482	. . . 4 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
39		swrdvalfn 11428	. . . 4 ⊢ ((𝐵 ∈ Word 𝑉 ∧ (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)) ∧ (𝑁 − 𝐿) ∈ (0...(♯‘𝐵))) → (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))))
40	30, 32, 38, 39	syl3anc 1278	. . 3 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩) Fn (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))))
41		simpll 531	. . . . . . 7 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉))
42		elfzelz 10428	. . . . . . . . . 10 ⊢ (𝑀 ∈ (𝐿...𝑁) → 𝑀 ∈ ℤ)
43		zaddcl 9684	. . . . . . . . . . 11 ⊢ ((𝑘 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 + 𝑀) ∈ ℤ)
44	43	expcom 116	. . . . . . . . . 10 ⊢ (𝑀 ∈ ℤ → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
45	42, 44	syl 14	. . . . . . . . 9 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
46	45	ad2antrl 494	. . . . . . . 8 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℤ → (𝑘 + 𝑀) ∈ ℤ))
47		elfzoelz 10554	. . . . . . . 8 ⊢ (𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) → 𝑘 ∈ ℤ)
48	46, 47	impel 280	. . . . . . 7 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (𝑘 + 𝑀) ∈ ℤ)
49		df-3an 1011	. . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ) ↔ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑘 + 𝑀) ∈ ℤ))
50	41, 48, 49	sylanbrc 421	. . . . . 6 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ))
51		ccatsymb 11370	. . . . . 6 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉 ∧ (𝑘 + 𝑀) ∈ ℤ) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))))
52	50, 51	syl 14	. . . . 5 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))))
53		elfz2 10418	. . . . . . . . 9 ⊢ (𝑀 ∈ (𝐿...𝑁) ↔ ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿 ≤ 𝑀 ∧ 𝑀 ≤ 𝑁)))
54		zre 9648	. . . . . . . . . . . . . . . . 17 ⊢ (𝐿 ∈ ℤ → 𝐿 ∈ ℝ)
55		zre 9648	. . . . . . . . . . . . . . . . 17 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℝ)
56	54, 55	anim12i 338	. . . . . . . . . . . . . . . 16 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ))
57		elnn0z 9657	. . . . . . . . . . . . . . . . 17 ⊢ (𝑘 ∈ ℕ₀ ↔ (𝑘 ∈ ℤ ∧ 0 ≤ 𝑘))
58		zre 9648	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℝ)
59		0re 8326	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ 0 ∈ ℝ
60	59	jctl 314	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ ℝ → (0 ∈ ℝ ∧ 𝐿 ∈ ℝ))
61	60	ad2antrl 494	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 ∈ ℝ ∧ 𝐿 ∈ ℝ))
62		id 19	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ ((𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ))
63	62	adantrl 482	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ))
64		le2add 8772	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((0 ∈ ℝ ∧ 𝐿 ∈ ℝ) ∧ (𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘 ∧ 𝐿 ≤ 𝑀) → (0 + 𝐿) ≤ (𝑘 + 𝑀)))
65	61, 63, 64	syl2anc 415	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘 ∧ 𝐿 ≤ 𝑀) → (0 + 𝐿) ≤ (𝑘 + 𝑀)))
66		recn 8312	. . . . . . . . . . . . . . . . . . . . . . . . . 26 ⊢ (𝐿 ∈ ℝ → 𝐿 ∈ ℂ)
67	66	addlidd 8476	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (𝐿 ∈ ℝ → (0 + 𝐿) = 𝐿)
68	67	ad2antrl 494	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 + 𝐿) = 𝐿)
69	68	breq1d 4140	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 + 𝐿) ≤ (𝑘 + 𝑀) ↔ 𝐿 ≤ (𝑘 + 𝑀)))
70	65, 69	sylibd 149	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘 ∧ 𝐿 ≤ 𝑀) → 𝐿 ≤ (𝑘 + 𝑀)))
71		simprl 535	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → 𝐿 ∈ ℝ)
72		readdcl 8305	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ((𝑘 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝑘 + 𝑀) ∈ ℝ)
73	72	adantrl 482	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝑘 + 𝑀) ∈ ℝ)
74	71, 73	lenltd 8444	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝐿 ≤ (𝑘 + 𝑀) ↔ ¬ (𝑘 + 𝑀) < 𝐿))
75	70, 74	sylibd 149	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → ((0 ≤ 𝑘 ∧ 𝐿 ≤ 𝑀) → ¬ (𝑘 + 𝑀) < 𝐿))
76	75	expd 258	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (0 ≤ 𝑘 → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
77	76	com12 30	. . . . . . . . . . . . . . . . . . 19 ⊢ (0 ≤ 𝑘 → ((𝑘 ∈ ℝ ∧ (𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ)) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
78	77	expd 258	. . . . . . . . . . . . . . . . . 18 ⊢ (0 ≤ 𝑘 → (𝑘 ∈ ℝ → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿))))
79	58, 78	mpan9 281	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑘 ∈ ℤ ∧ 0 ≤ 𝑘) → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
80	57, 79	sylbi 121	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ℕ₀ → ((𝐿 ∈ ℝ ∧ 𝑀 ∈ ℝ) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿)))
81	56, 80	mpan9 281	. . . . . . . . . . . . . . 15 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℕ₀) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < 𝐿))
82	1	breq2i 4138	. . . . . . . . . . . . . . . 16 ⊢ ((𝑘 + 𝑀) < 𝐿 ↔ (𝑘 + 𝑀) < (♯‘𝐴))
83	82	notbii 678	. . . . . . . . . . . . . . 15 ⊢ (¬ (𝑘 + 𝑀) < 𝐿 ↔ ¬ (𝑘 + 𝑀) < (♯‘𝐴))
84	81, 83	imbitrdi 161	. . . . . . . . . . . . . 14 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℕ₀) → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
85	84	ex 115	. . . . . . . . . . . . 13 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℕ₀ → (𝐿 ≤ 𝑀 → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
86	85	com23 78	. . . . . . . . . . . 12 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 ≤ 𝑀 → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
87	86	3adant2 1047	. . . . . . . . . . 11 ⊢ ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝐿 ≤ 𝑀 → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴))))
88	87	imp 124	. . . . . . . . . 10 ⊢ (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝐿 ≤ 𝑀) → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
89	88	adantrr 483	. . . . . . . . 9 ⊢ (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿 ≤ 𝑀 ∧ 𝑀 ≤ 𝑁)) → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
90	53, 89	sylbi 121	. . . . . . . 8 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
91	90	ad2antrl 494	. . . . . . 7 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℕ₀ → ¬ (𝑘 + 𝑀) < (♯‘𝐴)))
92		elfzonn0 10598	. . . . . . 7 ⊢ (𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) → 𝑘 ∈ ℕ₀)
93	91, 92	impel 280	. . . . . 6 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ¬ (𝑘 + 𝑀) < (♯‘𝐴))
94	93	iffalsed 3650	. . . . 5 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → if((𝑘 + 𝑀) < (♯‘𝐴), (𝐴‘(𝑘 + 𝑀)), (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴)))) = (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴))))
95		zcn 9649	. . . . . . . . . . . . . . . 16 ⊢ (𝑘 ∈ ℤ → 𝑘 ∈ ℂ)
96	95	adantl 277	. . . . . . . . . . . . . . 15 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝑘 ∈ ℂ)
97		zcn 9649	. . . . . . . . . . . . . . . 16 ⊢ (𝑀 ∈ ℤ → 𝑀 ∈ ℂ)
98	97	ad2antlr 493	. . . . . . . . . . . . . . 15 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝑀 ∈ ℂ)
99		zcn 9649	. . . . . . . . . . . . . . . 16 ⊢ (𝐿 ∈ ℤ → 𝐿 ∈ ℂ)
100	99	ad2antrr 492	. . . . . . . . . . . . . . 15 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → 𝐿 ∈ ℂ)
101	96, 98, 100	addsubassd 8657	. . . . . . . . . . . . . 14 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − 𝐿) = (𝑘 + (𝑀 − 𝐿)))
102		oveq2 6093	. . . . . . . . . . . . . . 15 ⊢ (𝐿 = (♯‘𝐴) → ((𝑘 + 𝑀) − 𝐿) = ((𝑘 + 𝑀) − (♯‘𝐴)))
103	102	eqeq1d 2247	. . . . . . . . . . . . . 14 ⊢ (𝐿 = (♯‘𝐴) → (((𝑘 + 𝑀) − 𝐿) = (𝑘 + (𝑀 − 𝐿)) ↔ ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
104	101, 103	imbitrid 154	. . . . . . . . . . . . 13 ⊢ (𝐿 = (♯‘𝐴) → (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
105	1, 104	ax-mp 5	. . . . . . . . . . . 12 ⊢ (((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ 𝑘 ∈ ℤ) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿)))
106	105	ex 115	. . . . . . . . . . 11 ⊢ ((𝐿 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
107	106	3adant2 1047	. . . . . . . . . 10 ⊢ ((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
108	107	adantr 276	. . . . . . . . 9 ⊢ (((𝐿 ∈ ℤ ∧ 𝑁 ∈ ℤ ∧ 𝑀 ∈ ℤ) ∧ (𝐿 ≤ 𝑀 ∧ 𝑀 ≤ 𝑁)) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
109	53, 108	sylbi 121	. . . . . . . 8 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
110	109	ad2antrl 494	. . . . . . 7 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ ℤ → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿))))
111	110, 47	impel 280	. . . . . 6 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝑘 + 𝑀) − (♯‘𝐴)) = (𝑘 + (𝑀 − 𝐿)))
112	111	fveq2d 5699	. . . . 5 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (𝐵‘((𝑘 + 𝑀) − (♯‘𝐴))) = (𝐵‘(𝑘 + (𝑀 − 𝐿))))
113	52, 94, 112	3eqtrd 2275	. . . 4 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)) = (𝐵‘(𝑘 + (𝑀 − 𝐿))))
114		ccatcl 11361	. . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (𝐴 ++ 𝐵) ∈ Word 𝑉)
115	114	adantr 276	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐴 ++ 𝐵) ∈ Word 𝑉)
116	11	biimpi 120	. . . . . . . . . 10 ⊢ ((♯‘𝐴) ∈ ℕ₀ → (♯‘𝐴) ∈ (ℤ_≥‘0))
117	1, 116	eqeltrid 2325	. . . . . . . . 9 ⊢ ((♯‘𝐴) ∈ ℕ₀ → 𝐿 ∈ (ℤ_≥‘0))
118		fzss1 10469	. . . . . . . . 9 ⊢ (𝐿 ∈ (ℤ_≥‘0) → (𝐿...𝑁) ⊆ (0...𝑁))
119	10, 117, 118	3syl 17	. . . . . . . 8 ⊢ (𝐴 ∈ Word 𝑉 → (𝐿...𝑁) ⊆ (0...𝑁))
120	119	sselda 3248	. . . . . . 7 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝑀 ∈ (𝐿...𝑁)) → 𝑀 ∈ (0...𝑁))
121	120	ad2ant2r 513	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝑀 ∈ (0...𝑁))
122	1, 7	ax-mp 5	. . . . . . . . 9 ⊢ (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) ↔ 𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))))
123	10, 116, 15	3syl 17	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Word 𝑉 → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
124	123	adantr 276	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ⊆ (0...((♯‘𝐴) + (♯‘𝐵))))
125	124	sseld 3247	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
126	125	impcom 125	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉)) → 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵))))
127		ccatlen 11363	. . . . . . . . . . . . . 14 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (♯‘(𝐴 ++ 𝐵)) = ((♯‘𝐴) + (♯‘𝐵)))
128	127	oveq2d 6101	. . . . . . . . . . . . 13 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (0...(♯‘(𝐴 ++ 𝐵))) = (0...((♯‘𝐴) + (♯‘𝐵))))
129	128	eleq2d 2308	. . . . . . . . . . . 12 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → (𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))) ↔ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
130	129	adantl 277	. . . . . . . . . . 11 ⊢ ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉)) → (𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))) ↔ 𝑁 ∈ (0...((♯‘𝐴) + (♯‘𝐵)))))
131	126, 130	mpbird 167	. . . . . . . . . 10 ⊢ ((𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) ∧ (𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉)) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
132	131	ex 115	. . . . . . . . 9 ⊢ (𝑁 ∈ ((♯‘𝐴)...((♯‘𝐴) + (♯‘𝐵))) → ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
133	122, 132	sylbi 121	. . . . . . . 8 ⊢ (𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))) → ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
134	133	impcom 125	. . . . . . 7 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
135	134	adantrl 482	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵))))
136	115, 121, 135	3jca 1208	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) ∈ Word 𝑉 ∧ 𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))))
137	26	eleq2d 2308	. . . . . . 7 ⊢ (𝑀 ∈ (𝐿...𝑁) → (𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) ↔ 𝑘 ∈ (0..^(𝑁 − 𝑀))))
138	137	ad2antrl 494	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿))) ↔ 𝑘 ∈ (0..^(𝑁 − 𝑀))))
139	138	biimpa 296	. . . . 5 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → 𝑘 ∈ (0..^(𝑁 − 𝑀)))
140		swrdfv 11425	. . . . 5 ⊢ ((((𝐴 ++ 𝐵) ∈ Word 𝑉 ∧ 𝑀 ∈ (0...𝑁) ∧ 𝑁 ∈ (0...(♯‘(𝐴 ++ 𝐵)))) ∧ 𝑘 ∈ (0..^(𝑁 − 𝑀))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)))
141	136, 139, 140	syl2an2r 603	. . . 4 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐴 ++ 𝐵)‘(𝑘 + 𝑀)))
142	34, 36	sylan 283	. . . . . . 7 ⊢ ((𝐵 ∈ Word 𝑉 ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
143	142	ad2ant2l 512	. . . . . 6 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝑁 − 𝐿) ∈ (0...(♯‘𝐵)))
144	30, 32, 143	3jca 1208	. . . . 5 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → (𝐵 ∈ Word 𝑉 ∧ (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)) ∧ (𝑁 − 𝐿) ∈ (0...(♯‘𝐵))))
145		swrdfv 11425	. . . . 5 ⊢ (((𝐵 ∈ Word 𝑉 ∧ (𝑀 − 𝐿) ∈ (0...(𝑁 − 𝐿)) ∧ (𝑁 − 𝐿) ∈ (0...(♯‘𝐵))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)‘𝑘) = (𝐵‘(𝑘 + (𝑀 − 𝐿))))
146	144, 145	sylan 283	. . . 4 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → ((𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)‘𝑘) = (𝐵‘(𝑘 + (𝑀 − 𝐿))))
147	113, 141, 146	3eqtr4d 2281	. . 3 ⊢ ((((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) ∧ 𝑘 ∈ (0..^((𝑁 − 𝐿) − (𝑀 − 𝐿)))) → (((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩)‘𝑘) = ((𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)‘𝑘))
148	29, 40, 147	eqfnfvd 5809	. 2 ⊢ (((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) ∧ (𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵))))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) = (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩))
149	148	ex 115	1 ⊢ ((𝐴 ∈ Word 𝑉 ∧ 𝐵 ∈ Word 𝑉) → ((𝑀 ∈ (𝐿...𝑁) ∧ 𝑁 ∈ (𝐿...(𝐿 + (♯‘𝐵)))) → ((𝐴 ++ 𝐵) substr ⟨𝑀, 𝑁⟩) = (𝐵 substr ⟨(𝑀 − 𝐿), (𝑁 − 𝐿)⟩)))

Colors of variables: wff set class

This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ⊆ wss 3220 ifcif 3638 ⟨cop 3712 class class class wbr 4130 Fn wfn 5372 ‘cfv 5377 (class class class)co 6085 ℂcc 8177 ℝcr 8178 0cc0 8179 + caddc 8182 < clt 8360 ≤ cle 8361 − cmin 8497 ℕ₀cn0 9563 ℤcz 9644 ℤ_≥cuz 9921 ...cfz 10411 ..^cfzo 10549 ♯chash 11214 Word cword 11304 ++ cconcat 11358 substr csubstr 11417

This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-nul 4259 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-iinf 4735 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-distr 8283 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-cnre 8290 ax-pre-ltirr 8291 ax-pre-ltwlin 8292 ax-pre-lttrn 8293 ax-pre-apti 8294 ax-pre-ltadd 8295

This proof depends on definitions: df-bi 117 df-dc 847 df-3or 1010 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-if 3639 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-tr 4230 df-id 4438 df-iord 4511 df-on 4513 df-ilim 4514 df-suc 4516 df-iom 4738 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-1st 6374 df-2nd 6375 df-recs 6576 df-frec 6662 df-1o 6687 df-er 6807 df-en 7023 df-dom 7024 df-fin 7025 df-pnf 8362 df-mnf 8363 df-xr 8364 df-ltxr 8365 df-le 8366 df-sub 8499 df-neg 8500 df-inn 9305 df-n0 9564 df-z 9645 df-uz 9922 df-fz 10412 df-fzo 10550 df-ihash 11215 df-word 11305 df-concat 11359 df-substr 11418

This theorem is used by: pfxccat3 11506 swrdccatin2d 11516

W3C validator