ccatco - Metamath Proof Explorer

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

Theorem ccatco 13581

Description: Mapping of words commutes with concatenation. (Contributed by Stefan O'Rear, 27-Aug-2015.)

**Assertion**
Ref	Expression
ccatco	⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ (𝑆 ++ 𝑇)) = ((𝐹 ∘ 𝑆) ++ (𝐹 ∘ 𝑇)))

Proof of Theorem ccatco Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		lenco 13578	. . . . . . 7 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (#‘(𝐹 ∘ 𝑆)) = (#‘𝑆))
2	1	3adant2 1080	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (#‘(𝐹 ∘ 𝑆)) = (#‘𝑆))
3		lenco 13578	. . . . . . 7 ⊢ ((𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (#‘(𝐹 ∘ 𝑇)) = (#‘𝑇))
4	3	3adant1 1079	. . . . . 6 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (#‘(𝐹 ∘ 𝑇)) = (#‘𝑇))
5	2, 4	oveq12d 6668	. . . . 5 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → ((#‘(𝐹 ∘ 𝑆)) + (#‘(𝐹 ∘ 𝑇))) = ((#‘𝑆) + (#‘𝑇)))
6	5	oveq2d 6666	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (0..^((#‘(𝐹 ∘ 𝑆)) + (#‘(𝐹 ∘ 𝑇)))) = (0..^((#‘𝑆) + (#‘𝑇))))
7	6	mpteq1d 4738	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝑥 ∈ (0..^((#‘(𝐹 ∘ 𝑆)) + (#‘(𝐹 ∘ 𝑇)))) ↦ if(𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))))) = (𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇))) ↦ if(𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))))))
8	2	oveq2d 6666	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (0..^(#‘(𝐹 ∘ 𝑆))) = (0..^(#‘𝑆)))
9	8	adantr 481	. . . . . . 7 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → (0..^(#‘(𝐹 ∘ 𝑆))) = (0..^(#‘𝑆)))
10	9	eleq2d 2687	. . . . . 6 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → (𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))) ↔ 𝑥 ∈ (0..^(#‘𝑆))))
11	10	ifbid 4108	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → if(𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆))))) = if(𝑥 ∈ (0..^(#‘𝑆)), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆))))))
12		wrdf 13310	. . . . . . . . . . 11 ⊢ (𝑆 ∈ Word 𝐴 → 𝑆:(0..^(#‘𝑆))⟶𝐴)
13	12	3ad2ant1 1082	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 𝑆:(0..^(#‘𝑆))⟶𝐴)
14	13	adantr 481	. . . . . . . . 9 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → 𝑆:(0..^(#‘𝑆))⟶𝐴)
15		ffn 6045	. . . . . . . . 9 ⊢ (𝑆:(0..^(#‘𝑆))⟶𝐴 → 𝑆 Fn (0..^(#‘𝑆)))
16	14, 15	syl 17	. . . . . . . 8 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → 𝑆 Fn (0..^(#‘𝑆)))
17		fvco2 6273	. . . . . . . 8 ⊢ ((𝑆 Fn (0..^(#‘𝑆)) ∧ 𝑥 ∈ (0..^(#‘𝑆))) → ((𝐹 ∘ 𝑆)‘𝑥) = (𝐹‘(𝑆‘𝑥)))
18	16, 17	sylan 488	. . . . . . 7 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ 𝑥 ∈ (0..^(#‘𝑆))) → ((𝐹 ∘ 𝑆)‘𝑥) = (𝐹‘(𝑆‘𝑥)))
19		iftrue 4092	. . . . . . . 8 ⊢ (𝑥 ∈ (0..^(#‘𝑆)) → if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))) = (𝐹‘(𝑆‘𝑥)))
20	19	adantl 482	. . . . . . 7 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ 𝑥 ∈ (0..^(#‘𝑆))) → if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))) = (𝐹‘(𝑆‘𝑥)))
21	18, 20	eqtr4d 2659	. . . . . 6 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ 𝑥 ∈ (0..^(#‘𝑆))) → ((𝐹 ∘ 𝑆)‘𝑥) = if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))))
22		wrdf 13310	. . . . . . . . . . 11 ⊢ (𝑇 ∈ Word 𝐴 → 𝑇:(0..^(#‘𝑇))⟶𝐴)
23	22	3ad2ant2 1083	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 𝑇:(0..^(#‘𝑇))⟶𝐴)
24	23	ad2antrr 762	. . . . . . . . 9 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → 𝑇:(0..^(#‘𝑇))⟶𝐴)
25		ffn 6045	. . . . . . . . 9 ⊢ (𝑇:(0..^(#‘𝑇))⟶𝐴 → 𝑇 Fn (0..^(#‘𝑇)))
26	24, 25	syl 17	. . . . . . . 8 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → 𝑇 Fn (0..^(#‘𝑇)))
27		lencl 13324	. . . . . . . . . . . . 13 ⊢ (𝑆 ∈ Word 𝐴 → (#‘𝑆) ∈ ℕ₀)
28	27	nn0zd 11480	. . . . . . . . . . . 12 ⊢ (𝑆 ∈ Word 𝐴 → (#‘𝑆) ∈ ℤ)
29	28	3ad2ant1 1082	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (#‘𝑆) ∈ ℤ)
30		fzospliti 12500	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇))) ∧ (#‘𝑆) ∈ ℤ) → (𝑥 ∈ (0..^(#‘𝑆)) ∨ 𝑥 ∈ ((#‘𝑆)..^((#‘𝑆) + (#‘𝑇)))))
31	30	ancoms 469	. . . . . . . . . . 11 ⊢ (((#‘𝑆) ∈ ℤ ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → (𝑥 ∈ (0..^(#‘𝑆)) ∨ 𝑥 ∈ ((#‘𝑆)..^((#‘𝑆) + (#‘𝑇)))))
32	29, 31	sylan 488	. . . . . . . . . 10 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → (𝑥 ∈ (0..^(#‘𝑆)) ∨ 𝑥 ∈ ((#‘𝑆)..^((#‘𝑆) + (#‘𝑇)))))
33	32	orcanai 952	. . . . . . . . 9 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → 𝑥 ∈ ((#‘𝑆)..^((#‘𝑆) + (#‘𝑇))))
34		lencl 13324	. . . . . . . . . . . 12 ⊢ (𝑇 ∈ Word 𝐴 → (#‘𝑇) ∈ ℕ₀)
35	34	nn0zd 11480	. . . . . . . . . . 11 ⊢ (𝑇 ∈ Word 𝐴 → (#‘𝑇) ∈ ℤ)
36	35	3ad2ant2 1083	. . . . . . . . . 10 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (#‘𝑇) ∈ ℤ)
37	36	ad2antrr 762	. . . . . . . . 9 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → (#‘𝑇) ∈ ℤ)
38		fzosubel3 12528	. . . . . . . . 9 ⊢ ((𝑥 ∈ ((#‘𝑆)..^((#‘𝑆) + (#‘𝑇))) ∧ (#‘𝑇) ∈ ℤ) → (𝑥 − (#‘𝑆)) ∈ (0..^(#‘𝑇)))
39	33, 37, 38	syl2anc 693	. . . . . . . 8 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → (𝑥 − (#‘𝑆)) ∈ (0..^(#‘𝑇)))
40		fvco2 6273	. . . . . . . 8 ⊢ ((𝑇 Fn (0..^(#‘𝑇)) ∧ (𝑥 − (#‘𝑆)) ∈ (0..^(#‘𝑇))) → ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘𝑆))) = (𝐹‘(𝑇‘(𝑥 − (#‘𝑆)))))
41	26, 39, 40	syl2anc 693	. . . . . . 7 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘𝑆))) = (𝐹‘(𝑇‘(𝑥 − (#‘𝑆)))))
42	2	oveq2d 6666	. . . . . . . . 9 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝑥 − (#‘(𝐹 ∘ 𝑆))) = (𝑥 − (#‘𝑆)))
43	42	fveq2d 6195	. . . . . . . 8 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))) = ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘𝑆))))
44	43	ad2antrr 762	. . . . . . 7 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))) = ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘𝑆))))
45		iffalse 4095	. . . . . . . 8 ⊢ (¬ 𝑥 ∈ (0..^(#‘𝑆)) → if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))) = (𝐹‘(𝑇‘(𝑥 − (#‘𝑆)))))
46	45	adantl 482	. . . . . . 7 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))) = (𝐹‘(𝑇‘(𝑥 − (#‘𝑆)))))
47	41, 44, 46	3eqtr4d 2666	. . . . . 6 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))) = if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))))
48	21, 47	ifeqda 4121	. . . . 5 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → if(𝑥 ∈ (0..^(#‘𝑆)), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆))))) = if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))))
49	11, 48	eqtrd 2656	. . . 4 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → if(𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆))))) = if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))))
50	49	mpteq2dva 4744	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇))) ↦ if(𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))))) = (𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇))) ↦ if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆)))))))
51	7, 50	eqtr2d 2657	. 2 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇))) ↦ if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆)))))) = (𝑥 ∈ (0..^((#‘(𝐹 ∘ 𝑆)) + (#‘(𝐹 ∘ 𝑇)))) ↦ if(𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))))))
52	14	ffvelrnda 6359	. . . 4 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ 𝑥 ∈ (0..^(#‘𝑆))) → (𝑆‘𝑥) ∈ 𝐴)
53	24, 39	ffvelrnd 6360	. . . 4 ⊢ ((((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) ∧ ¬ 𝑥 ∈ (0..^(#‘𝑆))) → (𝑇‘(𝑥 − (#‘𝑆))) ∈ 𝐴)
54	52, 53	ifclda 4120	. . 3 ⊢ (((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇)))) → if(𝑥 ∈ (0..^(#‘𝑆)), (𝑆‘𝑥), (𝑇‘(𝑥 − (#‘𝑆)))) ∈ 𝐴)
55		ccatfval 13358	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴) → (𝑆 ++ 𝑇) = (𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇))) ↦ if(𝑥 ∈ (0..^(#‘𝑆)), (𝑆‘𝑥), (𝑇‘(𝑥 − (#‘𝑆))))))
56	55	3adant3 1081	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝑆 ++ 𝑇) = (𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇))) ↦ if(𝑥 ∈ (0..^(#‘𝑆)), (𝑆‘𝑥), (𝑇‘(𝑥 − (#‘𝑆))))))
57		simp3 1063	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 𝐹:𝐴⟶𝐵)
58	57	feqmptd 6249	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 𝐹 = (𝑦 ∈ 𝐴 ↦ (𝐹‘𝑦)))
59		fveq2 6191	. . . 4 ⊢ (𝑦 = if(𝑥 ∈ (0..^(#‘𝑆)), (𝑆‘𝑥), (𝑇‘(𝑥 − (#‘𝑆)))) → (𝐹‘𝑦) = (𝐹‘if(𝑥 ∈ (0..^(#‘𝑆)), (𝑆‘𝑥), (𝑇‘(𝑥 − (#‘𝑆))))))
60		fvif 6204	. . . 4 ⊢ (𝐹‘if(𝑥 ∈ (0..^(#‘𝑆)), (𝑆‘𝑥), (𝑇‘(𝑥 − (#‘𝑆))))) = if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆)))))
61	59, 60	syl6eq 2672	. . 3 ⊢ (𝑦 = if(𝑥 ∈ (0..^(#‘𝑆)), (𝑆‘𝑥), (𝑇‘(𝑥 − (#‘𝑆)))) → (𝐹‘𝑦) = if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆))))))
62	54, 56, 58, 61	fmptco 6396	. 2 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ (𝑆 ++ 𝑇)) = (𝑥 ∈ (0..^((#‘𝑆) + (#‘𝑇))) ↦ if(𝑥 ∈ (0..^(#‘𝑆)), (𝐹‘(𝑆‘𝑥)), (𝐹‘(𝑇‘(𝑥 − (#‘𝑆)))))))
63		ffun 6048	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → Fun 𝐹)
64	63	3ad2ant3 1084	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → Fun 𝐹)
65		simp1 1061	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 𝑆 ∈ Word 𝐴)
66		cofunexg 7130	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑆 ∈ Word 𝐴) → (𝐹 ∘ 𝑆) ∈ V)
67	64, 65, 66	syl2anc 693	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ 𝑆) ∈ V)
68		simp2 1062	. . . 4 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → 𝑇 ∈ Word 𝐴)
69		cofunexg 7130	. . . 4 ⊢ ((Fun 𝐹 ∧ 𝑇 ∈ Word 𝐴) → (𝐹 ∘ 𝑇) ∈ V)
70	64, 68, 69	syl2anc 693	. . 3 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ 𝑇) ∈ V)
71		ccatfval 13358	. . 3 ⊢ (((𝐹 ∘ 𝑆) ∈ V ∧ (𝐹 ∘ 𝑇) ∈ V) → ((𝐹 ∘ 𝑆) ++ (𝐹 ∘ 𝑇)) = (𝑥 ∈ (0..^((#‘(𝐹 ∘ 𝑆)) + (#‘(𝐹 ∘ 𝑇)))) ↦ if(𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))))))
72	67, 70, 71	syl2anc 693	. 2 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → ((𝐹 ∘ 𝑆) ++ (𝐹 ∘ 𝑇)) = (𝑥 ∈ (0..^((#‘(𝐹 ∘ 𝑆)) + (#‘(𝐹 ∘ 𝑇)))) ↦ if(𝑥 ∈ (0..^(#‘(𝐹 ∘ 𝑆))), ((𝐹 ∘ 𝑆)‘𝑥), ((𝐹 ∘ 𝑇)‘(𝑥 − (#‘(𝐹 ∘ 𝑆)))))))
73	51, 62, 72	3eqtr4d 2666	1 ⊢ ((𝑆 ∈ Word 𝐴 ∧ 𝑇 ∈ Word 𝐴 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ (𝑆 ++ 𝑇)) = ((𝐹 ∘ 𝑆) ++ (𝐹 ∘ 𝑇)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∨ wo 383 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 Vcvv 3200 ifcif 4086 ↦ cmpt 4729 ∘ ccom 5118 Fun wfun 5882 Fn wfn 5883 ⟶wf 5884 ‘cfv 5888 (class class class)co 6650 0cc0 9936 + caddc 9939 − cmin 10266 ℤcz 11377 ..^cfzo 12465 #chash 13117 Word cword 13291 ++ cconcat 13293

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-cnex 9992 ax-resscn 9993 ax-1cn 9994 ax-icn 9995 ax-addcl 9996 ax-addrcl 9997 ax-mulcl 9998 ax-mulrcl 9999 ax-mulcom 10000 ax-addass 10001 ax-mulass 10002 ax-distr 10003 ax-i2m1 10004 ax-1ne0 10005 ax-1rid 10006 ax-rnegex 10007 ax-rrecex 10008 ax-cnre 10009 ax-pre-lttri 10010 ax-pre-lttrn 10011 ax-pre-ltadd 10012 ax-pre-mulgt0 10013

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-pss 3590 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-tp 4182 df-op 4184 df-uni 4437 df-int 4476 df-iun 4522 df-br 4654 df-opab 4713 df-mpt 4730 df-tr 4753 df-id 5024 df-eprel 5029 df-po 5035 df-so 5036 df-fr 5073 df-we 5075 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-pred 5680 df-ord 5726 df-on 5727 df-lim 5728 df-suc 5729 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-om 7066 df-1st 7168 df-2nd 7169 df-wrecs 7407 df-recs 7468 df-rdg 7506 df-1o 7560 df-oadd 7564 df-er 7742 df-en 7956 df-dom 7957 df-sdom 7958 df-fin 7959 df-card 8765 df-pnf 10076 df-mnf 10077 df-xr 10078 df-ltxr 10079 df-le 10080 df-sub 10268 df-neg 10269 df-nn 11021 df-n0 11293 df-z 11378 df-uz 11688 df-fz 12327 df-fzo 12466 df-hash 13118 df-word 13299 df-concat 13301

This theorem is referenced by: cats1co 13601 frmdgsum 17399 frmdup1 17401 efginvrel2 18140 frgpuplem 18185 frgpup1 18188 mrsubccat 31415

W3C validator