mrsubccat - Mathbox for Mario Carneiro

	Mathbox for Mario Carneiro		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > mrsubccat		Structured version Visualization version GIF version

Theorem mrsubccat 35634

Description: Substitution distributes over concatenation. (Contributed by Mario Carneiro, 18-Jul-2016.)

**Hypotheses**
Ref	Expression
mrsubccat.s	⊢ 𝑆 = (mRSubst‘𝑇)
mrsubccat.r	⊢ 𝑅 = (mREx‘𝑇)

**Assertion**
Ref	Expression
mrsubccat	⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝐹‘(𝑋 ++ 𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌)))

Proof of Theorem mrsubccat Dummy variables 𝑓 𝑣 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		n0i 4289	. . . . . 6 ⊢ (𝐹 ∈ ran 𝑆 → ¬ ran 𝑆 = ∅)
2		mrsubccat.s	. . . . . . 7 ⊢ 𝑆 = (mRSubst‘𝑇)
3	2	rnfvprc 6825	. . . . . 6 ⊢ (¬ 𝑇 ∈ V → ran 𝑆 = ∅)
4	1, 3	nsyl2 141	. . . . 5 ⊢ (𝐹 ∈ ran 𝑆 → 𝑇 ∈ V)
5		eqid 2733	. . . . . 6 ⊢ (mVR‘𝑇) = (mVR‘𝑇)
6		mrsubccat.r	. . . . . 6 ⊢ 𝑅 = (mREx‘𝑇)
7	5, 6, 2	mrsubff 35628	. . . . 5 ⊢ (𝑇 ∈ V → 𝑆:(𝑅 ↑_pm (mVR‘𝑇))⟶(𝑅 ↑_m 𝑅))
8		ffun 6662	. . . . 5 ⊢ (𝑆:(𝑅 ↑_pm (mVR‘𝑇))⟶(𝑅 ↑_m 𝑅) → Fun 𝑆)
9	4, 7, 8	3syl 18	. . . 4 ⊢ (𝐹 ∈ ran 𝑆 → Fun 𝑆)
10	5, 6, 2	mrsubrn 35629	. . . . . 6 ⊢ ran 𝑆 = (𝑆 “ (𝑅 ↑_m (mVR‘𝑇)))
11	10	eleq2i 2825	. . . . 5 ⊢ (𝐹 ∈ ran 𝑆 ↔ 𝐹 ∈ (𝑆 “ (𝑅 ↑_m (mVR‘𝑇))))
12	11	biimpi 216	. . . 4 ⊢ (𝐹 ∈ ran 𝑆 → 𝐹 ∈ (𝑆 “ (𝑅 ↑_m (mVR‘𝑇))))
13		fvelima 6896	. . . 4 ⊢ ((Fun 𝑆 ∧ 𝐹 ∈ (𝑆 “ (𝑅 ↑_m (mVR‘𝑇)))) → ∃𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇))(𝑆‘𝑓) = 𝐹)
14	9, 12, 13	syl2anc 584	. . 3 ⊢ (𝐹 ∈ ran 𝑆 → ∃𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇))(𝑆‘𝑓) = 𝐹)
15		simprl 770	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → 𝑋 ∈ 𝑅)
16		elfvex 6866	. . . . . . . . . . . . . 14 ⊢ (𝑋 ∈ (mREx‘𝑇) → 𝑇 ∈ V)
17	16, 6	eleq2s 2851	. . . . . . . . . . . . 13 ⊢ (𝑋 ∈ 𝑅 → 𝑇 ∈ V)
18		eqid 2733	. . . . . . . . . . . . . 14 ⊢ (mCN‘𝑇) = (mCN‘𝑇)
19	18, 5, 6	mrexval 35617	. . . . . . . . . . . . 13 ⊢ (𝑇 ∈ V → 𝑅 = Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
20	15, 17, 19	3syl 18	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → 𝑅 = Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
21	15, 20	eleqtrd 2835	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → 𝑋 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
22		simprr 772	. . . . . . . . . . . 12 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → 𝑌 ∈ 𝑅)
23	22, 20	eleqtrd 2835	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → 𝑌 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
24		elmapi 8782	. . . . . . . . . . . . . . . . 17 ⊢ (𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) → 𝑓:(mVR‘𝑇)⟶𝑅)
25	24	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → 𝑓:(mVR‘𝑇)⟶𝑅)
26	25	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇))) → 𝑓:(mVR‘𝑇)⟶𝑅)
27	26	ffvelcdmda 7026	. . . . . . . . . . . . . 14 ⊢ ((((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇))) ∧ 𝑣 ∈ (mVR‘𝑇)) → (𝑓‘𝑣) ∈ 𝑅)
28	20	ad2antrr 726	. . . . . . . . . . . . . 14 ⊢ ((((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇))) ∧ 𝑣 ∈ (mVR‘𝑇)) → 𝑅 = Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
29	27, 28	eleqtrd 2835	. . . . . . . . . . . . 13 ⊢ ((((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇))) ∧ 𝑣 ∈ (mVR‘𝑇)) → (𝑓‘𝑣) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
30		simplr 768	. . . . . . . . . . . . . 14 ⊢ ((((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇))) ∧ ¬ 𝑣 ∈ (mVR‘𝑇)) → 𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)))
31	30	s1cld 14518	. . . . . . . . . . . . 13 ⊢ ((((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇))) ∧ ¬ 𝑣 ∈ (mVR‘𝑇)) → ⟨“𝑣”⟩ ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
32	29, 31	ifclda 4512	. . . . . . . . . . . 12 ⊢ (((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) ∧ 𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇))) → if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
33	32	fmpttd 7057	. . . . . . . . . . 11 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → (𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ (mVR‘𝑇))⟶Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
34		ccatco 14749	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∧ 𝑌 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∧ (𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ (mVR‘𝑇))⟶Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ (𝑋 ++ 𝑌)) = (((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ++ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌)))
35	21, 23, 33, 34	syl3anc 1373	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ (𝑋 ++ 𝑌)) = (((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ++ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌)))
36	35	oveq2d 7371	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ (𝑋 ++ 𝑌))) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g (((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ++ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))))
37		fvex 6844	. . . . . . . . . . . 12 ⊢ (mCN‘𝑇) ∈ V
38		fvex 6844	. . . . . . . . . . . 12 ⊢ (mVR‘𝑇) ∈ V
39	37, 38	unex 7686	. . . . . . . . . . 11 ⊢ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∈ V
40		eqid 2733	. . . . . . . . . . . 12 ⊢ (freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) = (freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇)))
41	40	frmdmnd 18775	. . . . . . . . . . 11 ⊢ (((mCN‘𝑇) ∪ (mVR‘𝑇)) ∈ V → (freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) ∈ Mnd)
42	39, 41	mp1i 13	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → (freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) ∈ Mnd)
43		wrdco 14745	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∧ (𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ (mVR‘𝑇))⟶Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ∈ Word Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
44	21, 33, 43	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ∈ Word Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
45		wrdco 14745	. . . . . . . . . . 11 ⊢ ((𝑌 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∧ (𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)):((mCN‘𝑇) ∪ (mVR‘𝑇))⟶Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌) ∈ Word Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
46	23, 33, 45	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌) ∈ Word Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
47		eqid 2733	. . . . . . . . . . . . . 14 ⊢ (Base‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇)))) = (Base‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))))
48	40, 47	frmdbas 18768	. . . . . . . . . . . . 13 ⊢ (((mCN‘𝑇) ∪ (mVR‘𝑇)) ∈ V → (Base‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇)))) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
49	39, 48	ax-mp 5	. . . . . . . . . . . 12 ⊢ (Base‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇)))) = Word ((mCN‘𝑇) ∪ (mVR‘𝑇))
50	49	eqcomi 2742	. . . . . . . . . . 11 ⊢ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) = (Base‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))))
51		eqid 2733	. . . . . . . . . . 11 ⊢ (+_g‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇)))) = (+_g‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))))
52	50, 51	gsumccat 18757	. . . . . . . . . 10 ⊢ (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) ∈ Mnd ∧ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ∈ Word Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∧ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌) ∈ Word Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g (((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ++ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))) = (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋))(+_g‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))))((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))))
53	42, 44, 46, 52	syl3anc 1373	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g (((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ++ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))) = (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋))(+_g‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))))((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))))
54	50	gsumwcl 18755	. . . . . . . . . . 11 ⊢ (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) ∈ Mnd ∧ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋) ∈ Word Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
55	42, 44, 54	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
56	50	gsumwcl 18755	. . . . . . . . . . 11 ⊢ (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) ∈ Mnd ∧ ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌) ∈ Word Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌)) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
57	42, 46, 56	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌)) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
58	40, 50, 51	frmdadd 18771	. . . . . . . . . 10 ⊢ ((((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∧ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌)) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋))(+_g‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))))((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))) = (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)) ++ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))))
59	55, 57, 58	syl2anc 584	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋))(+_g‘(freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))))((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))) = (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)) ++ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))))
60	36, 53, 59	3eqtrd 2772	. . . . . . . 8 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ (𝑋 ++ 𝑌))) = (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)) ++ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))))
61		ssidd 3954	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → (mVR‘𝑇) ⊆ (mVR‘𝑇))
62		ccatcl 14488	. . . . . . . . . . 11 ⊢ ((𝑋 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)) ∧ 𝑌 ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇))) → (𝑋 ++ 𝑌) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
63	21, 23, 62	syl2anc 584	. . . . . . . . . 10 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → (𝑋 ++ 𝑌) ∈ Word ((mCN‘𝑇) ∪ (mVR‘𝑇)))
64	63, 20	eleqtrrd 2836	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → (𝑋 ++ 𝑌) ∈ 𝑅)
65	18, 5, 6, 2, 40	mrsubval 35625	. . . . . . . . 9 ⊢ ((𝑓:(mVR‘𝑇)⟶𝑅 ∧ (mVR‘𝑇) ⊆ (mVR‘𝑇) ∧ (𝑋 ++ 𝑌) ∈ 𝑅) → ((𝑆‘𝑓)‘(𝑋 ++ 𝑌)) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ (𝑋 ++ 𝑌))))
66	25, 61, 64, 65	syl3anc 1373	. . . . . . . 8 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((𝑆‘𝑓)‘(𝑋 ++ 𝑌)) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ (𝑋 ++ 𝑌))))
67	18, 5, 6, 2, 40	mrsubval 35625	. . . . . . . . . 10 ⊢ ((𝑓:(mVR‘𝑇)⟶𝑅 ∧ (mVR‘𝑇) ⊆ (mVR‘𝑇) ∧ 𝑋 ∈ 𝑅) → ((𝑆‘𝑓)‘𝑋) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)))
68	25, 61, 15, 67	syl3anc 1373	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((𝑆‘𝑓)‘𝑋) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)))
69	18, 5, 6, 2, 40	mrsubval 35625	. . . . . . . . . 10 ⊢ ((𝑓:(mVR‘𝑇)⟶𝑅 ∧ (mVR‘𝑇) ⊆ (mVR‘𝑇) ∧ 𝑌 ∈ 𝑅) → ((𝑆‘𝑓)‘𝑌) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌)))
70	25, 61, 22, 69	syl3anc 1373	. . . . . . . . 9 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((𝑆‘𝑓)‘𝑌) = ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌)))
71	68, 70	oveq12d 7373	. . . . . . . 8 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → (((𝑆‘𝑓)‘𝑋) ++ ((𝑆‘𝑓)‘𝑌)) = (((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑋)) ++ ((freeMnd‘((mCN‘𝑇) ∪ (mVR‘𝑇))) Σ_g ((𝑣 ∈ ((mCN‘𝑇) ∪ (mVR‘𝑇)) ↦ if(𝑣 ∈ (mVR‘𝑇), (𝑓‘𝑣), ⟨“𝑣”⟩)) ∘ 𝑌))))
72	60, 66, 71	3eqtr4d 2778	. . . . . . 7 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((𝑆‘𝑓)‘(𝑋 ++ 𝑌)) = (((𝑆‘𝑓)‘𝑋) ++ ((𝑆‘𝑓)‘𝑌)))
73		fveq1 6830	. . . . . . . 8 ⊢ ((𝑆‘𝑓) = 𝐹 → ((𝑆‘𝑓)‘(𝑋 ++ 𝑌)) = (𝐹‘(𝑋 ++ 𝑌)))
74		fveq1 6830	. . . . . . . . 9 ⊢ ((𝑆‘𝑓) = 𝐹 → ((𝑆‘𝑓)‘𝑋) = (𝐹‘𝑋))
75		fveq1 6830	. . . . . . . . 9 ⊢ ((𝑆‘𝑓) = 𝐹 → ((𝑆‘𝑓)‘𝑌) = (𝐹‘𝑌))
76	74, 75	oveq12d 7373	. . . . . . . 8 ⊢ ((𝑆‘𝑓) = 𝐹 → (((𝑆‘𝑓)‘𝑋) ++ ((𝑆‘𝑓)‘𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌)))
77	73, 76	eqeq12d 2749	. . . . . . 7 ⊢ ((𝑆‘𝑓) = 𝐹 → (((𝑆‘𝑓)‘(𝑋 ++ 𝑌)) = (((𝑆‘𝑓)‘𝑋) ++ ((𝑆‘𝑓)‘𝑌)) ↔ (𝐹‘(𝑋 ++ 𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌))))
78	72, 77	syl5ibcom 245	. . . . . 6 ⊢ ((𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) ∧ (𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅)) → ((𝑆‘𝑓) = 𝐹 → (𝐹‘(𝑋 ++ 𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌))))
79	78	ex 412	. . . . 5 ⊢ (𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) → ((𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → ((𝑆‘𝑓) = 𝐹 → (𝐹‘(𝑋 ++ 𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌)))))
80	79	com23 86	. . . 4 ⊢ (𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇)) → ((𝑆‘𝑓) = 𝐹 → ((𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝐹‘(𝑋 ++ 𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌)))))
81	80	rexlimiv 3127	. . 3 ⊢ (∃𝑓 ∈ (𝑅 ↑_m (mVR‘𝑇))(𝑆‘𝑓) = 𝐹 → ((𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝐹‘(𝑋 ++ 𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌))))
82	14, 81	syl 17	. 2 ⊢ (𝐹 ∈ ran 𝑆 → ((𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝐹‘(𝑋 ++ 𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌))))
83	82	3impib 1116	1 ⊢ ((𝐹 ∈ ran 𝑆 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝐹‘(𝑋 ++ 𝑌)) = ((𝐹‘𝑋) ++ (𝐹‘𝑌)))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ∃wrex 3057 Vcvv 3437 ∪ cun 3896 ⊆ wss 3898 ∅c0 4282 ifcif 4476 ↦ cmpt 5176 ran crn 5622 “ cima 5624 ∘ ccom 5625 Fun wfun 6483 ⟶wf 6485 ‘cfv 6489 (class class class)co 7355 ↑_m cmap 8759 ↑_pm cpm 8760 Word cword 14427 ++ cconcat 14484 ⟨“cs1 14510 Basecbs 17127 +_gcplusg 17168 Σ_g cgsu 17351 Mndcmnd 18650 freeMndcfrmd 18763 mCNcmcn 35576 mVRcmvar 35577 mRExcmrex 35582 mRSubstcmrsub 35586

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-er 8631 df-map 8761 df-pm 8762 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-card 9843 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-nn 12137 df-2 12199 df-n0 12393 df-z 12480 df-uz 12743 df-fz 13415 df-fzo 13562 df-seq 13916 df-hash 14245 df-word 14428 df-concat 14485 df-s1 14511 df-struct 17065 df-sets 17082 df-slot 17100 df-ndx 17112 df-base 17128 df-ress 17149 df-plusg 17181 df-0g 17352 df-gsum 17353 df-mgm 18556 df-sgrp 18635 df-mnd 18651 df-submnd 18700 df-frmd 18765 df-mrex 35602 df-mrsub 35606

This theorem is referenced by: elmrsubrn 35636 mrsubco 35637 mrsubvrs 35638

W3C validator