Theorem repsco 14873

Description: Mapping of words commutes with the "repeated symbol" operation. (Contributed by AV, 11-Nov-2018.)

Assertion

Ref	Expression
repsco	⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ (𝑆 repeatS 𝑁)) = ((𝐹‘𝑆) repeatS 𝑁))

Proof of Theorem repsco

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl1 1210	. . . . 5 ⊢ (((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^𝑁)) → 𝑆 ∈ 𝐴)
2		simpl2 1211	. . . . 5 ⊢ (((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^𝑁)) → 𝑁 ∈ ℕ0)
3		simpr 489	. . . . 5 ⊢ (((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^𝑁)) → 𝑥 ∈ (0..^𝑁))
4		repswsymb 14807	. . . . 5 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝑥 ∈ (0..^𝑁)) → ((𝑆 repeatS 𝑁)‘𝑥) = 𝑆)
5	1, 2, 3, 4	syl3anc 1398	. . . 4 ⊢ (((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^𝑁)) → ((𝑆 repeatS 𝑁)‘𝑥) = 𝑆)
6	5	fveq2d 6885	. . 3 ⊢ (((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) ∧ 𝑥 ∈ (0..^𝑁)) → (𝐹‘((𝑆 repeatS 𝑁)‘𝑥)) = (𝐹‘𝑆))
7	6	mpteq2dva 5204	. 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) → (𝑥 ∈ (0..^𝑁) ↦ (𝐹‘((𝑆 repeatS 𝑁)‘𝑥))) = (𝑥 ∈ (0..^𝑁) ↦ (𝐹‘𝑆)))
8		simp3 1156	. . 3 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) → 𝐹:𝐴⟶𝐵)
9		repsf 14806	. . . 4 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0) → (𝑆 repeatS 𝑁):(0..^𝑁)⟶𝐴)
10	9	3adant3 1150	. . 3 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) → (𝑆 repeatS 𝑁):(0..^𝑁)⟶𝐴)
11		fcompt 7129	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝑆 repeatS 𝑁):(0..^𝑁)⟶𝐴) → (𝐹 ∘ (𝑆 repeatS 𝑁)) = (𝑥 ∈ (0..^𝑁) ↦ (𝐹‘((𝑆 repeatS 𝑁)‘𝑥))))
12	8, 10, 11	syl2anc 595	. 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ (𝑆 repeatS 𝑁)) = (𝑥 ∈ (0..^𝑁) ↦ (𝐹‘((𝑆 repeatS 𝑁)‘𝑥))))
13		fvexd 6896	. . . . 5 ⊢ (𝑆 ∈ 𝐴 → (𝐹‘𝑆) ∈ V)
14	13	anim1i 626	. . . 4 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0) → ((𝐹‘𝑆) ∈ V ∧ 𝑁 ∈ ℕ0))
15	14	3adant3 1150	. . 3 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) → ((𝐹‘𝑆) ∈ V ∧ 𝑁 ∈ ℕ0))
16		reps 14803	. . 3 ⊢ (((𝐹‘𝑆) ∈ V ∧ 𝑁 ∈ ℕ0) → ((𝐹‘𝑆) repeatS 𝑁) = (𝑥 ∈ (0..^𝑁) ↦ (𝐹‘𝑆)))
17	15, 16	syl 18	. 2 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) → ((𝐹‘𝑆) repeatS 𝑁) = (𝑥 ∈ (0..^𝑁) ↦ (𝐹‘𝑆)))
18	7, 12, 17	3eqtr4d 2808	1 ⊢ ((𝑆 ∈ 𝐴 ∧ 𝑁 ∈ ℕ0 ∧ 𝐹:𝐴⟶𝐵) → (𝐹 ∘ (𝑆 repeatS 𝑁)) = ((𝐹‘𝑆) repeatS 𝑁))

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ↦ cmpt 5192   ∘ ccom 5665  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410  0cc0 11095  ℕ₀cn0 12499  ..^cfzo 13678   repeatS creps 14801

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pr 5404

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-reps 14802

This theorem is referenced by: (None)