revccat - Metamath Proof Explorer

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

Theorem revccat 14805

Description: Antiautomorphic property of the reversal operation. (Contributed by Stefan O'Rear, 27-Aug-2015.)

**Assertion**
Ref	Expression
revccat	⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (reverse‘(𝑆 ++ 𝑇)) = ((reverse‘𝑇) ++ (reverse‘𝑆)))

Proof of Theorem revccat Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		ccatcl 14613	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑆 ++ 𝑇) ∈ Word 𝐴)
2		revcl 14800	. . . 4 ⊢ ((𝑆 ++ 𝑇) ∈ Word 𝐴 → (reverse‘(𝑆 ++ 𝑇)) ∈ Word 𝐴)
3		wrdfn 14567	. . . 4 ⊢ ((reverse‘(𝑆 ++ 𝑇)) ∈ Word 𝐴 → (reverse‘(𝑆 ++ 𝑇)) Fn (0..^(♯‘(reverse‘(𝑆 ++ 𝑇)))))
4	1, 2, 3	3syl 18	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (reverse‘(𝑆 ++ 𝑇)) Fn (0..^(♯‘(reverse‘(𝑆 ++ 𝑇)))))
5		revlen 14801	. . . . . . 7 ⊢ ((𝑆 ++ 𝑇) ∈ Word 𝐴 → (♯‘(reverse‘(𝑆 ++ 𝑇))) = (♯‘(𝑆 ++ 𝑇)))
6	1, 5	syl 17	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(reverse‘(𝑆 ++ 𝑇))) = (♯‘(𝑆 ++ 𝑇)))
7		ccatlen 14614	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(𝑆 ++ 𝑇)) = ((♯‘𝑆) + (♯‘𝑇)))
8		lencl 14572	. . . . . . . 8 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘𝑆) ∈ ℕ₀)
9	8	nn0cnd 12591	. . . . . . 7 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘𝑆) ∈ ℂ)
10		lencl 14572	. . . . . . . 8 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ ℕ₀)
11	10	nn0cnd 12591	. . . . . . 7 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ ℂ)
12		addcom 11448	. . . . . . 7 ⊢ (((♯‘𝑆) ∈ ℂ ∧ (♯‘𝑇) ∈ ℂ) → ((♯‘𝑆) + (♯‘𝑇)) = ((♯‘𝑇) + (♯‘𝑆)))
13	9, 11, 12	syl2an 596	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑆) + (♯‘𝑇)) = ((♯‘𝑇) + (♯‘𝑆)))
14	6, 7, 13	3eqtrd 2780	. . . . 5 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(reverse‘(𝑆 ++ 𝑇))) = ((♯‘𝑇) + (♯‘𝑆)))
15	14	oveq2d 7448	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘(reverse‘(𝑆 ++ 𝑇)))) = (0..^((♯‘𝑇) + (♯‘𝑆))))
16	15	fneq2d 6661	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((reverse‘(𝑆 ++ 𝑇)) Fn (0..^(♯‘(reverse‘(𝑆 ++ 𝑇)))) ↔ (reverse‘(𝑆 ++ 𝑇)) Fn (0..^((♯‘𝑇) + (♯‘𝑆)))))
17	4, 16	mpbid 232	. 2 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (reverse‘(𝑆 ++ 𝑇)) Fn (0..^((♯‘𝑇) + (♯‘𝑆))))
18		revcl 14800	. . . . 5 ⊢ (𝑇 ∈ Word 𝐴 → (reverse‘𝑇) ∈ Word 𝐴)
19		revcl 14800	. . . . 5 ⊢ (𝑆 ∈ Word 𝐴 → (reverse‘𝑆) ∈ Word 𝐴)
20		ccatcl 14613	. . . . 5 ⊢ (((reverse‘𝑇) ∈ Word 𝐴 ∧ (reverse‘𝑆) ∈ Word 𝐴) → ((reverse‘𝑇) ++ (reverse‘𝑆)) ∈ Word 𝐴)
21	18, 19, 20	syl2anr 597	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((reverse‘𝑇) ++ (reverse‘𝑆)) ∈ Word 𝐴)
22		wrdfn 14567	. . . 4 ⊢ (((reverse‘𝑇) ++ (reverse‘𝑆)) ∈ Word 𝐴 → ((reverse‘𝑇) ++ (reverse‘𝑆)) Fn (0..^(♯‘((reverse‘𝑇) ++ (reverse‘𝑆)))))
23	21, 22	syl 17	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((reverse‘𝑇) ++ (reverse‘𝑆)) Fn (0..^(♯‘((reverse‘𝑇) ++ (reverse‘𝑆)))))
24		ccatlen 14614	. . . . . . 7 ⊢ (((reverse‘𝑇) ∈ Word 𝐴 ∧ (reverse‘𝑆) ∈ Word 𝐴) → (♯‘((reverse‘𝑇) ++ (reverse‘𝑆))) = ((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆))))
25	18, 19, 24	syl2anr 597	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘((reverse‘𝑇) ++ (reverse‘𝑆))) = ((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆))))
26		revlen 14801	. . . . . . 7 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘(reverse‘𝑇)) = (♯‘𝑇))
27		revlen 14801	. . . . . . 7 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘(reverse‘𝑆)) = (♯‘𝑆))
28	26, 27	oveqan12rd 7452	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆))) = ((♯‘𝑇) + (♯‘𝑆)))
29	25, 28	eqtrd 2776	. . . . 5 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘((reverse‘𝑇) ++ (reverse‘𝑆))) = ((♯‘𝑇) + (♯‘𝑆)))
30	29	oveq2d 7448	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘((reverse‘𝑇) ++ (reverse‘𝑆)))) = (0..^((♯‘𝑇) + (♯‘𝑆))))
31	30	fneq2d 6661	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((reverse‘𝑇) ++ (reverse‘𝑆)) Fn (0..^(♯‘((reverse‘𝑇) ++ (reverse‘𝑆)))) ↔ ((reverse‘𝑇) ++ (reverse‘𝑆)) Fn (0..^((♯‘𝑇) + (♯‘𝑆)))))
32	23, 31	mpbid 232	. 2 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((reverse‘𝑇) ++ (reverse‘𝑆)) Fn (0..^((♯‘𝑇) + (♯‘𝑆))))
33		id 22	. . . 4 ⊢ (𝑥 ∈ (0..^((♯‘𝑇) + (♯‘𝑆))) → 𝑥 ∈ (0..^((♯‘𝑇) + (♯‘𝑆))))
34	10	nn0zd 12641	. . . . 5 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ ℤ)
35	34	adantl 481	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘𝑇) ∈ ℤ)
36		fzospliti 13732	. . . 4 ⊢ ((𝑥 ∈ (0..^((♯‘𝑇) + (♯‘𝑆))) ∧ (♯‘𝑇) ∈ ℤ) → (𝑥 ∈ (0..^(♯‘𝑇)) ∨ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))))
37	33, 35, 36	syl2anr 597	. . 3 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^((♯‘𝑇) + (♯‘𝑆)))) → (𝑥 ∈ (0..^(♯‘𝑇)) ∨ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))))
38		simpll 766	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑆 ∈ Word 𝐴)
39		simplr 768	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑇 ∈ Word 𝐴)
40		fzoval 13701	. . . . . . . . . . . . 13 ⊢ ((♯‘𝑇) ∈ ℤ → (0..^(♯‘𝑇)) = (0...((♯‘𝑇) − 1)))
41	34, 40	syl 17	. . . . . . . . . . . 12 ⊢ (𝑇 ∈ Word 𝐴 → (0..^(♯‘𝑇)) = (0...((♯‘𝑇) − 1)))
42	41	adantl 481	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘𝑇)) = (0...((♯‘𝑇) − 1)))
43	42	eleq2d 2826	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑥 ∈ (0..^(♯‘𝑇)) ↔ 𝑥 ∈ (0...((♯‘𝑇) − 1))))
44	43	biimpa 476	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑥 ∈ (0...((♯‘𝑇) − 1)))
45		fznn0sub2 13676	. . . . . . . . 9 ⊢ (𝑥 ∈ (0...((♯‘𝑇) − 1)) → (((♯‘𝑇) − 1) − 𝑥) ∈ (0...((♯‘𝑇) − 1)))
46	44, 45	syl 17	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((♯‘𝑇) − 1) − 𝑥) ∈ (0...((♯‘𝑇) − 1)))
47	41	ad2antlr 727	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (0..^(♯‘𝑇)) = (0...((♯‘𝑇) − 1)))
48	46, 47	eleqtrrd 2843	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((♯‘𝑇) − 1) − 𝑥) ∈ (0..^(♯‘𝑇)))
49		ccatval3 14618	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ (((♯‘𝑇) − 1) − 𝑥) ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆))) = (𝑇‘(((♯‘𝑇) − 1) − 𝑥)))
50	38, 39, 48, 49	syl3anc 1372	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆))) = (𝑇‘(((♯‘𝑇) − 1) − 𝑥)))
51	7, 13	eqtrd 2776	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(𝑆 ++ 𝑇)) = ((♯‘𝑇) + (♯‘𝑆)))
52	51	oveq1d 7447	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(𝑆 ++ 𝑇)) − 1) = (((♯‘𝑇) + (♯‘𝑆)) − 1))
53	11	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘𝑇) ∈ ℂ)
54	9	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘𝑆) ∈ ℂ)
55		1cnd 11257	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → 1 ∈ ℂ)
56	53, 54, 55	addsubd 11642	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑇) + (♯‘𝑆)) − 1) = (((♯‘𝑇) − 1) + (♯‘𝑆)))
57	52, 56	eqtrd 2776	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(𝑆 ++ 𝑇)) − 1) = (((♯‘𝑇) − 1) + (♯‘𝑆)))
58	57	oveq1d 7447	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) − 1) + (♯‘𝑆)) − 𝑥))
59	58	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) − 1) + (♯‘𝑆)) − 𝑥))
60		peano2zm 12662	. . . . . . . . . . . 12 ⊢ ((♯‘𝑇) ∈ ℤ → ((♯‘𝑇) − 1) ∈ ℤ)
61	34, 60	syl 17	. . . . . . . . . . 11 ⊢ (𝑇 ∈ Word 𝐴 → ((♯‘𝑇) − 1) ∈ ℤ)
62	61	zcnd 12725	. . . . . . . . . 10 ⊢ (𝑇 ∈ Word 𝐴 → ((♯‘𝑇) − 1) ∈ ℂ)
63	62	ad2antlr 727	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((♯‘𝑇) − 1) ∈ ℂ)
64	9	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (♯‘𝑆) ∈ ℂ)
65		elfzoelz 13700	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (0..^(♯‘𝑇)) → 𝑥 ∈ ℤ)
66	65	zcnd 12725	. . . . . . . . . 10 ⊢ (𝑥 ∈ (0..^(♯‘𝑇)) → 𝑥 ∈ ℂ)
67	66	adantl 481	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑥 ∈ ℂ)
68	63, 64, 67	addsubd 11642	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((((♯‘𝑇) − 1) + (♯‘𝑆)) − 𝑥) = ((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆)))
69	59, 68	eqtrd 2776	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆)))
70	69	fveq2d 6909	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = ((𝑆 ++ 𝑇)‘((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆))))
71		revfv 14802	. . . . . . 7 ⊢ ((𝑇 ∈ Word 𝐴 ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((reverse‘𝑇)‘𝑥) = (𝑇‘(((♯‘𝑇) − 1) − 𝑥)))
72	71	adantll 714	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((reverse‘𝑇)‘𝑥) = (𝑇‘(((♯‘𝑇) − 1) − 𝑥)))
73	50, 70, 72	3eqtr4d 2786	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = ((reverse‘𝑇)‘𝑥))
74	34	uzidd 12895	. . . . . . . . . 10 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ (ℤ_≥‘(♯‘𝑇)))
75		uzaddcl 12947	. . . . . . . . . 10 ⊢ (((♯‘𝑇) ∈ (ℤ_≥‘(♯‘𝑇)) ∧ (♯‘𝑆) ∈ ℕ₀) → ((♯‘𝑇) + (♯‘𝑆)) ∈ (ℤ_≥‘(♯‘𝑇)))
76	74, 8, 75	syl2anr 597	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇) + (♯‘𝑆)) ∈ (ℤ_≥‘(♯‘𝑇)))
77	51, 76	eqeltrd 2840	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(𝑆 ++ 𝑇)) ∈ (ℤ_≥‘(♯‘𝑇)))
78		fzoss2 13728	. . . . . . . 8 ⊢ ((♯‘(𝑆 ++ 𝑇)) ∈ (ℤ_≥‘(♯‘𝑇)) → (0..^(♯‘𝑇)) ⊆ (0..^(♯‘(𝑆 ++ 𝑇))))
79	77, 78	syl 17	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘𝑇)) ⊆ (0..^(♯‘(𝑆 ++ 𝑇))))
80	79	sselda 3982	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑥 ∈ (0..^(♯‘(𝑆 ++ 𝑇))))
81		revfv 14802	. . . . . 6 ⊢ (((𝑆 ++ 𝑇) ∈ Word 𝐴 ∧ 𝑥 ∈ (0..^(♯‘(𝑆 ++ 𝑇)))) → ((reverse‘(𝑆 ++ 𝑇))‘𝑥) = ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)))
82	1, 80, 81	syl2an2r 685	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((reverse‘(𝑆 ++ 𝑇))‘𝑥) = ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)))
83	18	ad2antlr 727	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (reverse‘𝑇) ∈ Word 𝐴)
84	19	ad2antrr 726	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (reverse‘𝑆) ∈ Word 𝐴)
85	26	adantl 481	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(reverse‘𝑇)) = (♯‘𝑇))
86	85	oveq2d 7448	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘(reverse‘𝑇))) = (0..^(♯‘𝑇)))
87	86	eleq2d 2826	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑥 ∈ (0..^(♯‘(reverse‘𝑇))) ↔ 𝑥 ∈ (0..^(♯‘𝑇))))
88	87	biimpar 477	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑥 ∈ (0..^(♯‘(reverse‘𝑇))))
89		ccatval1 14616	. . . . . 6 ⊢ (((reverse‘𝑇) ∈ Word 𝐴 ∧ (reverse‘𝑆) ∈ Word 𝐴 ∧ 𝑥 ∈ (0..^(♯‘(reverse‘𝑇)))) → (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥) = ((reverse‘𝑇)‘𝑥))
90	83, 84, 88, 89	syl3anc 1372	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥) = ((reverse‘𝑇)‘𝑥))
91	73, 82, 90	3eqtr4d 2786	. . . 4 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((reverse‘(𝑆 ++ 𝑇))‘𝑥) = (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥))
92	8	nn0zd 12641	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘𝑆) ∈ ℤ)
93		peano2zm 12662	. . . . . . . . . . . 12 ⊢ ((♯‘𝑆) ∈ ℤ → ((♯‘𝑆) − 1) ∈ ℤ)
94	92, 93	syl 17	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Word 𝐴 → ((♯‘𝑆) − 1) ∈ ℤ)
95	94	zcnd 12725	. . . . . . . . . 10 ⊢ (𝑆 ∈ Word 𝐴 → ((♯‘𝑆) − 1) ∈ ℂ)
96	95	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((♯‘𝑆) − 1) ∈ ℂ)
97		elfzoelz 13700	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) → 𝑥 ∈ ℤ)
98	97	zcnd 12725	. . . . . . . . . 10 ⊢ (𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) → 𝑥 ∈ ℂ)
99	98	adantl 481	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑥 ∈ ℂ)
100	11	ad2antlr 727	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (♯‘𝑇) ∈ ℂ)
101	96, 99, 100	subsub3d 11651	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘𝑆) − 1) − (𝑥 − (♯‘𝑇))) = ((((♯‘𝑆) − 1) + (♯‘𝑇)) − 𝑥))
102	26	oveq2d 7448	. . . . . . . . . 10 ⊢ (𝑇 ∈ Word 𝐴 → (𝑥 − (♯‘(reverse‘𝑇))) = (𝑥 − (♯‘𝑇)))
103	102	oveq2d 7448	. . . . . . . . 9 ⊢ (𝑇 ∈ Word 𝐴 → (((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇)))) = (((♯‘𝑆) − 1) − (𝑥 − (♯‘𝑇))))
104	103	ad2antlr 727	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇)))) = (((♯‘𝑆) − 1) − (𝑥 − (♯‘𝑇))))
105	7	oveq1d 7447	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(𝑆 ++ 𝑇)) − 1) = (((♯‘𝑆) + (♯‘𝑇)) − 1))
106	54, 53, 55	addsubd 11642	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑆) + (♯‘𝑇)) − 1) = (((♯‘𝑆) − 1) + (♯‘𝑇)))
107	105, 106	eqtrd 2776	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(𝑆 ++ 𝑇)) − 1) = (((♯‘𝑆) − 1) + (♯‘𝑇)))
108	107	oveq1d 7447	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑆) − 1) + (♯‘𝑇)) − 𝑥))
109	108	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑆) − 1) + (♯‘𝑇)) − 𝑥))
110	101, 104, 109	3eqtr4rd 2787	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = (((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇)))))
111	110	fveq2d 6909	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (𝑆‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = (𝑆‘(((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇))))))
112		simpll 766	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑆 ∈ Word 𝐴)
113		simplr 768	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑇 ∈ Word 𝐴)
114		zaddcl 12659	. . . . . . . . . . 11 ⊢ (((♯‘𝑇) ∈ ℤ ∧ (♯‘𝑆) ∈ ℤ) → ((♯‘𝑇) + (♯‘𝑆)) ∈ ℤ)
115	34, 92, 114	syl2anr 597	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇) + (♯‘𝑆)) ∈ ℤ)
116		peano2zm 12662	. . . . . . . . . 10 ⊢ (((♯‘𝑇) + (♯‘𝑆)) ∈ ℤ → (((♯‘𝑇) + (♯‘𝑆)) − 1) ∈ ℤ)
117	115, 116	syl 17	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑇) + (♯‘𝑆)) − 1) ∈ ℤ)
118		fzoval 13701	. . . . . . . . . . . 12 ⊢ (((♯‘𝑇) + (♯‘𝑆)) ∈ ℤ → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) = ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1)))
119	115, 118	syl 17	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) = ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1)))
120	119	eleq2d 2826	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ↔ 𝑥 ∈ ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1))))
121	120	biimpa 476	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑥 ∈ ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1)))
122		fzrev2i 13630	. . . . . . . . 9 ⊢ (((((♯‘𝑇) + (♯‘𝑆)) − 1) ∈ ℤ ∧ 𝑥 ∈ ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1))) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − 𝑥) ∈ (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))))
123	117, 121, 122	syl2an2r 685	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − 𝑥) ∈ (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))))
124	52	oveq1d 7447	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) + (♯‘𝑆)) − 1) − 𝑥))
125	124	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) + (♯‘𝑆)) − 1) − 𝑥))
126	92	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘𝑆) ∈ ℤ)
127		fzoval 13701	. . . . . . . . . . 11 ⊢ ((♯‘𝑆) ∈ ℤ → (0..^(♯‘𝑆)) = (0...((♯‘𝑆) − 1)))
128	126, 127	syl 17	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘𝑆)) = (0...((♯‘𝑆) − 1)))
129	117	zcnd 12725	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑇) + (♯‘𝑆)) − 1) ∈ ℂ)
130	129	subidd 11609	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1)) = 0)
131		addcl 11238	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝑇) ∈ ℂ ∧ (♯‘𝑆) ∈ ℂ) → ((♯‘𝑇) + (♯‘𝑆)) ∈ ℂ)
132	11, 9, 131	syl2anr 597	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇) + (♯‘𝑆)) ∈ ℂ)
133	132, 55, 53	sub32d 11653	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇)) = ((((♯‘𝑇) + (♯‘𝑆)) − (♯‘𝑇)) − 1))
134		pncan2 11516	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝑇) ∈ ℂ ∧ (♯‘𝑆) ∈ ℂ) → (((♯‘𝑇) + (♯‘𝑆)) − (♯‘𝑇)) = (♯‘𝑆))
135	11, 9, 134	syl2anr 597	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑇) + (♯‘𝑆)) − (♯‘𝑇)) = (♯‘𝑆))
136	135	oveq1d 7447	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((((♯‘𝑇) + (♯‘𝑆)) − (♯‘𝑇)) − 1) = ((♯‘𝑆) − 1))
137	133, 136	eqtrd 2776	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇)) = ((♯‘𝑆) − 1))
138	130, 137	oveq12d 7450	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))) = (0...((♯‘𝑆) − 1)))
139	128, 138	eqtr4d 2779	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘𝑆)) = (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))))
140	139	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (0..^(♯‘𝑆)) = (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))))
141	123, 125, 140	3eltr4d 2855	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) ∈ (0..^(♯‘𝑆)))
142		ccatval1 14616	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) ∈ (0..^(♯‘𝑆))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = (𝑆‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)))
143	112, 113, 141, 142	syl3anc 1372	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = (𝑆‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)))
144		simpl 482	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → 𝑆 ∈ Word 𝐴)
145	102	ad2antlr 727	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (𝑥 − (♯‘(reverse‘𝑇))) = (𝑥 − (♯‘𝑇)))
146		id 22	. . . . . . . . 9 ⊢ (𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) → 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))))
147		fzosubel3 13766	. . . . . . . . 9 ⊢ ((𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ∧ (♯‘𝑆) ∈ ℤ) → (𝑥 − (♯‘𝑇)) ∈ (0..^(♯‘𝑆)))
148	146, 126, 147	syl2anr 597	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (𝑥 − (♯‘𝑇)) ∈ (0..^(♯‘𝑆)))
149	145, 148	eqeltrd 2840	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (𝑥 − (♯‘(reverse‘𝑇))) ∈ (0..^(♯‘𝑆)))
150		revfv 14802	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ (𝑥 − (♯‘(reverse‘𝑇))) ∈ (0..^(♯‘𝑆))) → ((reverse‘𝑆)‘(𝑥 − (♯‘(reverse‘𝑇)))) = (𝑆‘(((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇))))))
151	144, 149, 150	syl2an2r 685	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((reverse‘𝑆)‘(𝑥 − (♯‘(reverse‘𝑇)))) = (𝑆‘(((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇))))))
152	111, 143, 151	3eqtr4d 2786	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = ((reverse‘𝑆)‘(𝑥 − (♯‘(reverse‘𝑇)))))
153		fzoss1 13727	. . . . . . . . . . 11 ⊢ ((♯‘𝑇) ∈ (ℤ_≥‘0) → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^((♯‘𝑇) + (♯‘𝑆))))
154		nn0uz 12921	. . . . . . . . . . 11 ⊢ ℕ₀ = (ℤ_≥‘0)
155	153, 154	eleq2s 2858	. . . . . . . . . 10 ⊢ ((♯‘𝑇) ∈ ℕ₀ → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^((♯‘𝑇) + (♯‘𝑆))))
156	10, 155	syl 17	. . . . . . . . 9 ⊢ (𝑇 ∈ Word 𝐴 → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^((♯‘𝑇) + (♯‘𝑆))))
157	156	adantl 481	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^((♯‘𝑇) + (♯‘𝑆))))
158	51	oveq2d 7448	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘(𝑆 ++ 𝑇))) = (0..^((♯‘𝑇) + (♯‘𝑆))))
159	157, 158	sseqtrrd 4020	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^(♯‘(𝑆 ++ 𝑇))))
160	159	sselda 3982	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑥 ∈ (0..^(♯‘(𝑆 ++ 𝑇))))
161	1, 160, 81	syl2an2r 685	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((reverse‘(𝑆 ++ 𝑇))‘𝑥) = ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)))
162	18	ad2antlr 727	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (reverse‘𝑇) ∈ Word 𝐴)
163	19	ad2antrr 726	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (reverse‘𝑆) ∈ Word 𝐴)
164	85, 28	oveq12d 7450	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(reverse‘𝑇))..^((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆)))) = ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))))
165	164	eleq2d 2826	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑥 ∈ ((♯‘(reverse‘𝑇))..^((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆)))) ↔ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))))
166	165	biimpar 477	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑥 ∈ ((♯‘(reverse‘𝑇))..^((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆)))))
167		ccatval2 14617	. . . . . 6 ⊢ (((reverse‘𝑇) ∈ Word 𝐴 ∧ (reverse‘𝑆) ∈ Word 𝐴 ∧ 𝑥 ∈ ((♯‘(reverse‘𝑇))..^((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆))))) → (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥) = ((reverse‘𝑆)‘(𝑥 − (♯‘(reverse‘𝑇)))))
168	162, 163, 166, 167	syl3anc 1372	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥) = ((reverse‘𝑆)‘(𝑥 − (♯‘(reverse‘𝑇)))))
169	152, 161, 168	3eqtr4d 2786	. . . 4 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((reverse‘(𝑆 ++ 𝑇))‘𝑥) = (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥))
170	91, 169	jaodan 959	. . 3 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ (𝑥 ∈ (0..^(♯‘𝑇)) ∨ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))))) → ((reverse‘(𝑆 ++ 𝑇))‘𝑥) = (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥))
171	37, 170	syldan 591	. 2 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^((♯‘𝑇) + (♯‘𝑆)))) → ((reverse‘(𝑆 ++ 𝑇))‘𝑥) = (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥))
172	17, 32, 171	eqfnfvd 7053	1 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (reverse‘(𝑆 ++ 𝑇)) = ((reverse‘𝑇) ++ (reverse‘𝑆)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1539 ∈ wcel 2107 ⊆ wss 3950 Fn wfn 6555 ‘cfv 6560 (class class class)co 7432 ℂcc 11154 0cc0 11156 1c1 11157 + caddc 11159 − cmin 11493 ℕ₀cn0 12528 ℤcz 12615 ℤ_≥cuz 12879 ...cfz 13548 ..^cfzo 13695 ♯chash 14370 Word cword 14553 ++ cconcat 14609 reversecreverse 14797

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-rep 5278 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-cnex 11212 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4907 df-int 4946 df-iun 4992 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-om 7889 df-1st 8015 df-2nd 8016 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-1o 8507 df-er 8746 df-en 8987 df-dom 8988 df-sdom 8989 df-fin 8990 df-card 9980 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-sub 11495 df-neg 11496 df-nn 12268 df-n0 12529 df-z 12616 df-uz 12880 df-fz 13549 df-fzo 13696 df-hash 14371 df-word 14554 df-concat 14610 df-reverse 14798

This theorem is referenced by: gsumwrev 19386 efginvrel2 19746

W3C validator