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 14738

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 14546	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑆 ++ 𝑇) ∈ Word 𝐴)
2		revcl 14733	. . . 4 ⊢ ((𝑆 ++ 𝑇) ∈ Word 𝐴 → (reverse‘(𝑆 ++ 𝑇)) ∈ Word 𝐴)
3		wrdfn 14500	. . . 4 ⊢ ((reverse‘(𝑆 ++ 𝑇)) ∈ Word 𝐴 → (reverse‘(𝑆 ++ 𝑇)) Fn (0..^(♯‘(reverse‘(𝑆 ++ 𝑇)))))
4	1, 2, 3	3syl 18	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (reverse‘(𝑆 ++ 𝑇)) Fn (0..^(♯‘(reverse‘(𝑆 ++ 𝑇)))))
5		revlen 14734	. . . . . . 7 ⊢ ((𝑆 ++ 𝑇) ∈ Word 𝐴 → (♯‘(reverse‘(𝑆 ++ 𝑇))) = (♯‘(𝑆 ++ 𝑇)))
6	1, 5	syl 17	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(reverse‘(𝑆 ++ 𝑇))) = (♯‘(𝑆 ++ 𝑇)))
7		ccatlen 14547	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(𝑆 ++ 𝑇)) = ((♯‘𝑆) + (♯‘𝑇)))
8		lencl 14505	. . . . . . . 8 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘𝑆) ∈ ℕ₀)
9	8	nn0cnd 12512	. . . . . . 7 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘𝑆) ∈ ℂ)
10		lencl 14505	. . . . . . . 8 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ ℕ₀)
11	10	nn0cnd 12512	. . . . . . 7 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ ℂ)
12		addcom 11367	. . . . . . 7 ⊢ (((♯‘𝑆) ∈ ℂ ∧ (♯‘𝑇) ∈ ℂ) → ((♯‘𝑆) + (♯‘𝑇)) = ((♯‘𝑇) + (♯‘𝑆)))
13	9, 11, 12	syl2an 596	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑆) + (♯‘𝑇)) = ((♯‘𝑇) + (♯‘𝑆)))
14	6, 7, 13	3eqtrd 2769	. . . . 5 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(reverse‘(𝑆 ++ 𝑇))) = ((♯‘𝑇) + (♯‘𝑆)))
15	14	oveq2d 7406	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘(reverse‘(𝑆 ++ 𝑇)))) = (0..^((♯‘𝑇) + (♯‘𝑆))))
16	15	fneq2d 6615	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((reverse‘(𝑆 ++ 𝑇)) Fn (0..^(♯‘(reverse‘(𝑆 ++ 𝑇)))) ↔ (reverse‘(𝑆 ++ 𝑇)) Fn (0..^((♯‘𝑇) + (♯‘𝑆)))))
17	4, 16	mpbid 232	. 2 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (reverse‘(𝑆 ++ 𝑇)) Fn (0..^((♯‘𝑇) + (♯‘𝑆))))
18		revcl 14733	. . . . 5 ⊢ (𝑇 ∈ Word 𝐴 → (reverse‘𝑇) ∈ Word 𝐴)
19		revcl 14733	. . . . 5 ⊢ (𝑆 ∈ Word 𝐴 → (reverse‘𝑆) ∈ Word 𝐴)
20		ccatcl 14546	. . . . 5 ⊢ (((reverse‘𝑇) ∈ Word 𝐴 ∧ (reverse‘𝑆) ∈ Word 𝐴) → ((reverse‘𝑇) ++ (reverse‘𝑆)) ∈ Word 𝐴)
21	18, 19, 20	syl2anr 597	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((reverse‘𝑇) ++ (reverse‘𝑆)) ∈ Word 𝐴)
22		wrdfn 14500	. . . 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 14547	. . . . . . 7 ⊢ (((reverse‘𝑇) ∈ Word 𝐴 ∧ (reverse‘𝑆) ∈ Word 𝐴) → (♯‘((reverse‘𝑇) ++ (reverse‘𝑆))) = ((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆))))
25	18, 19, 24	syl2anr 597	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘((reverse‘𝑇) ++ (reverse‘𝑆))) = ((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆))))
26		revlen 14734	. . . . . . 7 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘(reverse‘𝑇)) = (♯‘𝑇))
27		revlen 14734	. . . . . . 7 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘(reverse‘𝑆)) = (♯‘𝑆))
28	26, 27	oveqan12rd 7410	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆))) = ((♯‘𝑇) + (♯‘𝑆)))
29	25, 28	eqtrd 2765	. . . . 5 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘((reverse‘𝑇) ++ (reverse‘𝑆))) = ((♯‘𝑇) + (♯‘𝑆)))
30	29	oveq2d 7406	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘((reverse‘𝑇) ++ (reverse‘𝑆)))) = (0..^((♯‘𝑇) + (♯‘𝑆))))
31	30	fneq2d 6615	. . 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 12562	. . . . 5 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ ℤ)
35	34	adantl 481	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘𝑇) ∈ ℤ)
36		fzospliti 13659	. . . 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 13628	. . . . . . . . . . . . 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 2815	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑥 ∈ (0..^(♯‘𝑇)) ↔ 𝑥 ∈ (0...((♯‘𝑇) − 1))))
44	43	biimpa 476	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑥 ∈ (0...((♯‘𝑇) − 1)))
45		fznn0sub2 13603	. . . . . . . . 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 2832	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((♯‘𝑇) − 1) − 𝑥) ∈ (0..^(♯‘𝑇)))
49		ccatval3 14551	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ (((♯‘𝑇) − 1) − 𝑥) ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆))) = (𝑇‘(((♯‘𝑇) − 1) − 𝑥)))
50	38, 39, 48, 49	syl3anc 1373	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆))) = (𝑇‘(((♯‘𝑇) − 1) − 𝑥)))
51	7, 13	eqtrd 2765	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(𝑆 ++ 𝑇)) = ((♯‘𝑇) + (♯‘𝑆)))
52	51	oveq1d 7405	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(𝑆 ++ 𝑇)) − 1) = (((♯‘𝑇) + (♯‘𝑆)) − 1))
53	11	adantl 481	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘𝑇) ∈ ℂ)
54	9	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘𝑆) ∈ ℂ)
55		1cnd 11176	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → 1 ∈ ℂ)
56	53, 54, 55	addsubd 11561	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑇) + (♯‘𝑆)) − 1) = (((♯‘𝑇) − 1) + (♯‘𝑆)))
57	52, 56	eqtrd 2765	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(𝑆 ++ 𝑇)) − 1) = (((♯‘𝑇) − 1) + (♯‘𝑆)))
58	57	oveq1d 7405	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) − 1) + (♯‘𝑆)) − 𝑥))
59	58	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) − 1) + (♯‘𝑆)) − 𝑥))
60		peano2zm 12583	. . . . . . . . . . . 12 ⊢ ((♯‘𝑇) ∈ ℤ → ((♯‘𝑇) − 1) ∈ ℤ)
61	34, 60	syl 17	. . . . . . . . . . 11 ⊢ (𝑇 ∈ Word 𝐴 → ((♯‘𝑇) − 1) ∈ ℤ)
62	61	zcnd 12646	. . . . . . . . . 10 ⊢ (𝑇 ∈ Word 𝐴 → ((♯‘𝑇) − 1) ∈ ℂ)
63	62	ad2antlr 727	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((♯‘𝑇) − 1) ∈ ℂ)
64	9	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (♯‘𝑆) ∈ ℂ)
65		elfzoelz 13627	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (0..^(♯‘𝑇)) → 𝑥 ∈ ℤ)
66	65	zcnd 12646	. . . . . . . . . 10 ⊢ (𝑥 ∈ (0..^(♯‘𝑇)) → 𝑥 ∈ ℂ)
67	66	adantl 481	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑥 ∈ ℂ)
68	63, 64, 67	addsubd 11561	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((((♯‘𝑇) − 1) + (♯‘𝑆)) − 𝑥) = ((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆)))
69	59, 68	eqtrd 2765	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆)))
70	69	fveq2d 6865	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = ((𝑆 ++ 𝑇)‘((((♯‘𝑇) − 1) − 𝑥) + (♯‘𝑆))))
71		revfv 14735	. . . . . . 7 ⊢ ((𝑇 ∈ Word 𝐴 ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((reverse‘𝑇)‘𝑥) = (𝑇‘(((♯‘𝑇) − 1) − 𝑥)))
72	71	adantll 714	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((reverse‘𝑇)‘𝑥) = (𝑇‘(((♯‘𝑇) − 1) − 𝑥)))
73	50, 70, 72	3eqtr4d 2775	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = ((reverse‘𝑇)‘𝑥))
74	34	uzidd 12816	. . . . . . . . . 10 ⊢ (𝑇 ∈ Word 𝐴 → (♯‘𝑇) ∈ (ℤ_≥‘(♯‘𝑇)))
75		uzaddcl 12870	. . . . . . . . . 10 ⊢ (((♯‘𝑇) ∈ (ℤ_≥‘(♯‘𝑇)) ∧ (♯‘𝑆) ∈ ℕ₀) → ((♯‘𝑇) + (♯‘𝑆)) ∈ (ℤ_≥‘(♯‘𝑇)))
76	74, 8, 75	syl2anr 597	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇) + (♯‘𝑆)) ∈ (ℤ_≥‘(♯‘𝑇)))
77	51, 76	eqeltrd 2829	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘(𝑆 ++ 𝑇)) ∈ (ℤ_≥‘(♯‘𝑇)))
78		fzoss2 13655	. . . . . . . 8 ⊢ ((♯‘(𝑆 ++ 𝑇)) ∈ (ℤ_≥‘(♯‘𝑇)) → (0..^(♯‘𝑇)) ⊆ (0..^(♯‘(𝑆 ++ 𝑇))))
79	77, 78	syl 17	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘𝑇)) ⊆ (0..^(♯‘(𝑆 ++ 𝑇))))
80	79	sselda 3949	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑥 ∈ (0..^(♯‘(𝑆 ++ 𝑇))))
81		revfv 14735	. . . . . 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 7406	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘(reverse‘𝑇))) = (0..^(♯‘𝑇)))
87	86	eleq2d 2815	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑥 ∈ (0..^(♯‘(reverse‘𝑇))) ↔ 𝑥 ∈ (0..^(♯‘𝑇))))
88	87	biimpar 477	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → 𝑥 ∈ (0..^(♯‘(reverse‘𝑇))))
89		ccatval1 14549	. . . . . 6 ⊢ (((reverse‘𝑇) ∈ Word 𝐴 ∧ (reverse‘𝑆) ∈ Word 𝐴 ∧ 𝑥 ∈ (0..^(♯‘(reverse‘𝑇)))) → (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥) = ((reverse‘𝑇)‘𝑥))
90	83, 84, 88, 89	syl3anc 1373	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥) = ((reverse‘𝑇)‘𝑥))
91	73, 82, 90	3eqtr4d 2775	. . . 4 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ (0..^(♯‘𝑇))) → ((reverse‘(𝑆 ++ 𝑇))‘𝑥) = (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥))
92	8	nn0zd 12562	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ Word 𝐴 → (♯‘𝑆) ∈ ℤ)
93		peano2zm 12583	. . . . . . . . . . . 12 ⊢ ((♯‘𝑆) ∈ ℤ → ((♯‘𝑆) − 1) ∈ ℤ)
94	92, 93	syl 17	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Word 𝐴 → ((♯‘𝑆) − 1) ∈ ℤ)
95	94	zcnd 12646	. . . . . . . . . 10 ⊢ (𝑆 ∈ Word 𝐴 → ((♯‘𝑆) − 1) ∈ ℂ)
96	95	ad2antrr 726	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((♯‘𝑆) − 1) ∈ ℂ)
97		elfzoelz 13627	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) → 𝑥 ∈ ℤ)
98	97	zcnd 12646	. . . . . . . . . 10 ⊢ (𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) → 𝑥 ∈ ℂ)
99	98	adantl 481	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑥 ∈ ℂ)
100	11	ad2antlr 727	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (♯‘𝑇) ∈ ℂ)
101	96, 99, 100	subsub3d 11570	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘𝑆) − 1) − (𝑥 − (♯‘𝑇))) = ((((♯‘𝑆) − 1) + (♯‘𝑇)) − 𝑥))
102	26	oveq2d 7406	. . . . . . . . . 10 ⊢ (𝑇 ∈ Word 𝐴 → (𝑥 − (♯‘(reverse‘𝑇))) = (𝑥 − (♯‘𝑇)))
103	102	oveq2d 7406	. . . . . . . . 9 ⊢ (𝑇 ∈ Word 𝐴 → (((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇)))) = (((♯‘𝑆) − 1) − (𝑥 − (♯‘𝑇))))
104	103	ad2antlr 727	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇)))) = (((♯‘𝑆) − 1) − (𝑥 − (♯‘𝑇))))
105	7	oveq1d 7405	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(𝑆 ++ 𝑇)) − 1) = (((♯‘𝑆) + (♯‘𝑇)) − 1))
106	54, 53, 55	addsubd 11561	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑆) + (♯‘𝑇)) − 1) = (((♯‘𝑆) − 1) + (♯‘𝑇)))
107	105, 106	eqtrd 2765	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(𝑆 ++ 𝑇)) − 1) = (((♯‘𝑆) − 1) + (♯‘𝑇)))
108	107	oveq1d 7405	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑆) − 1) + (♯‘𝑇)) − 𝑥))
109	108	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑆) − 1) + (♯‘𝑇)) − 𝑥))
110	101, 104, 109	3eqtr4rd 2776	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = (((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇)))))
111	110	fveq2d 6865	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (𝑆‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = (𝑆‘(((♯‘𝑆) − 1) − (𝑥 − (♯‘(reverse‘𝑇))))))
112		simpll 766	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑆 ∈ Word 𝐴)
113		simplr 768	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑇 ∈ Word 𝐴)
114		zaddcl 12580	. . . . . . . . . . 11 ⊢ (((♯‘𝑇) ∈ ℤ ∧ (♯‘𝑆) ∈ ℤ) → ((♯‘𝑇) + (♯‘𝑆)) ∈ ℤ)
115	34, 92, 114	syl2anr 597	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇) + (♯‘𝑆)) ∈ ℤ)
116		peano2zm 12583	. . . . . . . . . 10 ⊢ (((♯‘𝑇) + (♯‘𝑆)) ∈ ℤ → (((♯‘𝑇) + (♯‘𝑆)) − 1) ∈ ℤ)
117	115, 116	syl 17	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑇) + (♯‘𝑆)) − 1) ∈ ℤ)
118		fzoval 13628	. . . . . . . . . . . 12 ⊢ (((♯‘𝑇) + (♯‘𝑆)) ∈ ℤ → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) = ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1)))
119	115, 118	syl 17	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) = ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1)))
120	119	eleq2d 2815	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ↔ 𝑥 ∈ ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1))))
121	120	biimpa 476	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑥 ∈ ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1)))
122		fzrev2i 13557	. . . . . . . . 9 ⊢ (((((♯‘𝑇) + (♯‘𝑆)) − 1) ∈ ℤ ∧ 𝑥 ∈ ((♯‘𝑇)...(((♯‘𝑇) + (♯‘𝑆)) − 1))) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − 𝑥) ∈ (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))))
123	117, 121, 122	syl2an2r 685	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − 𝑥) ∈ (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))))
124	52	oveq1d 7405	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) + (♯‘𝑆)) − 1) − 𝑥))
125	124	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) = ((((♯‘𝑇) + (♯‘𝑆)) − 1) − 𝑥))
126	92	adantr 480	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (♯‘𝑆) ∈ ℤ)
127		fzoval 13628	. . . . . . . . . . 11 ⊢ ((♯‘𝑆) ∈ ℤ → (0..^(♯‘𝑆)) = (0...((♯‘𝑆) − 1)))
128	126, 127	syl 17	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘𝑆)) = (0...((♯‘𝑆) − 1)))
129	117	zcnd 12646	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑇) + (♯‘𝑆)) − 1) ∈ ℂ)
130	129	subidd 11528	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1)) = 0)
131		addcl 11157	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝑇) ∈ ℂ ∧ (♯‘𝑆) ∈ ℂ) → ((♯‘𝑇) + (♯‘𝑆)) ∈ ℂ)
132	11, 9, 131	syl2anr 597	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇) + (♯‘𝑆)) ∈ ℂ)
133	132, 55, 53	sub32d 11572	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇)) = ((((♯‘𝑇) + (♯‘𝑆)) − (♯‘𝑇)) − 1))
134		pncan2 11435	. . . . . . . . . . . . . 14 ⊢ (((♯‘𝑇) ∈ ℂ ∧ (♯‘𝑆) ∈ ℂ) → (((♯‘𝑇) + (♯‘𝑆)) − (♯‘𝑇)) = (♯‘𝑆))
135	11, 9, 134	syl2anr 597	. . . . . . . . . . . . 13 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((♯‘𝑇) + (♯‘𝑆)) − (♯‘𝑇)) = (♯‘𝑆))
136	135	oveq1d 7405	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((((♯‘𝑇) + (♯‘𝑆)) − (♯‘𝑇)) − 1) = ((♯‘𝑆) − 1))
137	133, 136	eqtrd 2765	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇)) = ((♯‘𝑆) − 1))
138	130, 137	oveq12d 7408	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))) = (0...((♯‘𝑆) − 1)))
139	128, 138	eqtr4d 2768	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘𝑆)) = (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))))
140	139	adantr 480	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (0..^(♯‘𝑆)) = (((((♯‘𝑇) + (♯‘𝑆)) − 1) − (((♯‘𝑇) + (♯‘𝑆)) − 1))...((((♯‘𝑇) + (♯‘𝑆)) − 1) − (♯‘𝑇))))
141	123, 125, 140	3eltr4d 2844	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) ∈ (0..^(♯‘𝑆)))
142		ccatval1 14549	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ (((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥) ∈ (0..^(♯‘𝑆))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = (𝑆‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)))
143	112, 113, 141, 142	syl3anc 1373	. . . . . 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 13694	. . . . . . . . 9 ⊢ ((𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ∧ (♯‘𝑆) ∈ ℤ) → (𝑥 − (♯‘𝑇)) ∈ (0..^(♯‘𝑆)))
148	146, 126, 147	syl2anr 597	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (𝑥 − (♯‘𝑇)) ∈ (0..^(♯‘𝑆)))
149	145, 148	eqeltrd 2829	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (𝑥 − (♯‘(reverse‘𝑇))) ∈ (0..^(♯‘𝑆)))
150		revfv 14735	. . . . . . 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 2775	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → ((𝑆 ++ 𝑇)‘(((♯‘(𝑆 ++ 𝑇)) − 1) − 𝑥)) = ((reverse‘𝑆)‘(𝑥 − (♯‘(reverse‘𝑇)))))
153		fzoss1 13654	. . . . . . . . . . 11 ⊢ ((♯‘𝑇) ∈ (ℤ_≥‘0) → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^((♯‘𝑇) + (♯‘𝑆))))
154		nn0uz 12842	. . . . . . . . . . 11 ⊢ ℕ₀ = (ℤ_≥‘0)
155	153, 154	eleq2s 2847	. . . . . . . . . 10 ⊢ ((♯‘𝑇) ∈ ℕ₀ → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^((♯‘𝑇) + (♯‘𝑆))))
156	10, 155	syl 17	. . . . . . . . 9 ⊢ (𝑇 ∈ Word 𝐴 → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^((♯‘𝑇) + (♯‘𝑆))))
157	156	adantl 481	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^((♯‘𝑇) + (♯‘𝑆))))
158	51	oveq2d 7406	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (0..^(♯‘(𝑆 ++ 𝑇))) = (0..^((♯‘𝑇) + (♯‘𝑆))))
159	157, 158	sseqtrrd 3987	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))) ⊆ (0..^(♯‘(𝑆 ++ 𝑇))))
160	159	sselda 3949	. . . . . 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 7408	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → ((♯‘(reverse‘𝑇))..^((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆)))) = ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆))))
165	164	eleq2d 2815	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑥 ∈ ((♯‘(reverse‘𝑇))..^((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆)))) ↔ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))))
166	165	biimpar 477	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → 𝑥 ∈ ((♯‘(reverse‘𝑇))..^((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆)))))
167		ccatval2 14550	. . . . . 6 ⊢ (((reverse‘𝑇) ∈ Word 𝐴 ∧ (reverse‘𝑆) ∈ Word 𝐴 ∧ 𝑥 ∈ ((♯‘(reverse‘𝑇))..^((♯‘(reverse‘𝑇)) + (♯‘(reverse‘𝑆))))) → (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥) = ((reverse‘𝑆)‘(𝑥 − (♯‘(reverse‘𝑇)))))
168	162, 163, 166, 167	syl3anc 1373	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) ∧ 𝑥 ∈ ((♯‘𝑇)..^((♯‘𝑇) + (♯‘𝑆)))) → (((reverse‘𝑇) ++ (reverse‘𝑆))‘𝑥) = ((reverse‘𝑆)‘(𝑥 − (♯‘(reverse‘𝑇)))))
169	152, 161, 168	3eqtr4d 2775	. . . 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 7009	1 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (reverse‘(𝑆 ++ 𝑇)) = ((reverse‘𝑇) ++ (reverse‘𝑆)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∨ wo 847 = wceq 1540 ∈ wcel 2109 ⊆ wss 3917 Fn wfn 6509 ‘cfv 6514 (class class class)co 7390 ℂcc 11073 0cc0 11075 1c1 11076 + caddc 11078 − cmin 11412 ℕ₀cn0 12449 ℤcz 12536 ℤ_≥cuz 12800 ...cfz 13475 ..^cfzo 13622 ♯chash 14302 Word cword 14485 ++ cconcat 14542 reversecreverse 14730

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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-cnex 11131 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 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-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-pss 3937 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-int 4914 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-tr 5218 df-id 5536 df-eprel 5541 df-po 5549 df-so 5550 df-fr 5594 df-we 5596 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-pred 6277 df-ord 6338 df-on 6339 df-lim 6340 df-suc 6341 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-om 7846 df-1st 7971 df-2nd 7972 df-frecs 8263 df-wrecs 8294 df-recs 8343 df-rdg 8381 df-1o 8437 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-card 9899 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-nn 12194 df-n0 12450 df-z 12537 df-uz 12801 df-fz 13476 df-fzo 13623 df-hash 14303 df-word 14486 df-concat 14543 df-reverse 14731

This theorem is referenced by: gsumwrev 19305 efginvrel2 19664

W3C validator