Theorem gsumwun 33012

Description: In a commutative ring, a group sum of a word 𝑊 of characters taken from two submonoids 𝐸 and 𝐹 can be written as a simple sum. (Contributed by Thierry Arnoux, 6-Oct-2025.)

Hypotheses

Ref	Expression
gsumwun.p	⊢ + = (+g‘𝑀)
gsumwun.m	⊢ (𝜑 → 𝑀 ∈ CMnd)
gsumwun.e	⊢ (𝜑 → 𝐸 ∈ (SubMnd‘𝑀))
gsumwun.f	⊢ (𝜑 → 𝐹 ∈ (SubMnd‘𝑀))
gsumwun.w	⊢ (𝜑 → 𝑊 ∈ Word (𝐸 ∪ 𝐹))

Assertion

Ref	Expression
gsumwun	⊢ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓))

Distinct variable groups:   + ,𝑒,𝑓   𝑒,𝐸,𝑓   𝑒,𝐹,𝑓   𝑒,𝑀,𝑓   𝑒,𝑊,𝑓   𝜑,𝑒,𝑓

Proof of Theorem gsumwun

Dummy variables 𝑖 𝑗 𝑣 𝑤 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gsumwun.w	. 2 ⊢ (𝜑 → 𝑊 ∈ Word (𝐸 ∪ 𝐹))
2		oveq2 7398	. . . . . 6 ⊢ (𝑣 = ∅ → (𝑀 Σg 𝑣) = (𝑀 Σg ∅))
3	2	eqeq1d 2732	. . . . 5 ⊢ (𝑣 = ∅ → ((𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ (𝑀 Σg ∅) = (𝑒 + 𝑓)))
4	3	2rexbidv 3203	. . . 4 ⊢ (𝑣 = ∅ → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg ∅) = (𝑒 + 𝑓)))
5	4	imbi2d 340	. . 3 ⊢ (𝑣 = ∅ → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓)) ↔ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg ∅) = (𝑒 + 𝑓))))
6		oveq2 7398	. . . . . 6 ⊢ (𝑣 = 𝑤 → (𝑀 Σg 𝑣) = (𝑀 Σg 𝑤))
7	6	eqeq1d 2732	. . . . 5 ⊢ (𝑣 = 𝑤 → ((𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)))
8	7	2rexbidv 3203	. . . 4 ⊢ (𝑣 = 𝑤 → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓)))
9	8	imbi2d 340	. . 3 ⊢ (𝑣 = 𝑤 → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓)) ↔ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓))))
10		oveq1 7397	. . . . . . 7 ⊢ (𝑒 = 𝑖 → (𝑒 + 𝑓) = (𝑖 + 𝑓))
11	10	eqeq2d 2741	. . . . . 6 ⊢ (𝑒 = 𝑖 → ((𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ (𝑀 Σg 𝑣) = (𝑖 + 𝑓)))
12		oveq2 7398	. . . . . . 7 ⊢ (𝑓 = 𝑗 → (𝑖 + 𝑓) = (𝑖 + 𝑗))
13	12	eqeq2d 2741	. . . . . 6 ⊢ (𝑓 = 𝑗 → ((𝑀 Σg 𝑣) = (𝑖 + 𝑓) ↔ (𝑀 Σg 𝑣) = (𝑖 + 𝑗)))
14	11, 13	cbvrex2vw 3221	. . . . 5 ⊢ (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑖 + 𝑗))
15		oveq2 7398	. . . . . . 7 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → (𝑀 Σg 𝑣) = (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)))
16	15	eqeq1d 2732	. . . . . 6 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → ((𝑀 Σg 𝑣) = (𝑖 + 𝑗) ↔ (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗)))
17	16	2rexbidv 3203	. . . . 5 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → (∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑖 + 𝑗) ↔ ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗)))
18	14, 17	bitrid 283	. . . 4 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗)))
19	18	imbi2d 340	. . 3 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓)) ↔ (𝜑 → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))))
20		oveq2 7398	. . . . . 6 ⊢ (𝑣 = 𝑊 → (𝑀 Σg 𝑣) = (𝑀 Σg 𝑊))
21	20	eqeq1d 2732	. . . . 5 ⊢ (𝑣 = 𝑊 → ((𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ (𝑀 Σg 𝑊) = (𝑒 + 𝑓)))
22	21	2rexbidv 3203	. . . 4 ⊢ (𝑣 = 𝑊 → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓)))
23	22	imbi2d 340	. . 3 ⊢ (𝑣 = 𝑊 → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓)) ↔ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓))))
24		oveq1 7397	. . . . 5 ⊢ (𝑒 = (0g‘𝑀) → (𝑒 + 𝑓) = ((0g‘𝑀) + 𝑓))
25	24	eqeq2d 2741	. . . 4 ⊢ (𝑒 = (0g‘𝑀) → ((𝑀 Σg ∅) = (𝑒 + 𝑓) ↔ (𝑀 Σg ∅) = ((0g‘𝑀) + 𝑓)))
26		oveq2 7398	. . . . 5 ⊢ (𝑓 = (0g‘𝑀) → ((0g‘𝑀) + 𝑓) = ((0g‘𝑀) + (0g‘𝑀)))
27	26	eqeq2d 2741	. . . 4 ⊢ (𝑓 = (0g‘𝑀) → ((𝑀 Σg ∅) = ((0g‘𝑀) + 𝑓) ↔ (𝑀 Σg ∅) = ((0g‘𝑀) + (0g‘𝑀))))
28		gsumwun.e	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ (SubMnd‘𝑀))
29		eqid 2730	. . . . . 6 ⊢ (0g‘𝑀) = (0g‘𝑀)
30	29	subm0cl 18745	. . . . 5 ⊢ (𝐸 ∈ (SubMnd‘𝑀) → (0g‘𝑀) ∈ 𝐸)
31	28, 30	syl 17	. . . 4 ⊢ (𝜑 → (0g‘𝑀) ∈ 𝐸)
32		gsumwun.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (SubMnd‘𝑀))
33	29	subm0cl 18745	. . . . 5 ⊢ (𝐹 ∈ (SubMnd‘𝑀) → (0g‘𝑀) ∈ 𝐹)
34	32, 33	syl 17	. . . 4 ⊢ (𝜑 → (0g‘𝑀) ∈ 𝐹)
35	29	gsum0 18618	. . . . 5 ⊢ (𝑀 Σg ∅) = (0g‘𝑀)
36		gsumwun.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ CMnd)
37	36	cmnmndd 19741	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ Mnd)
38		eqid 2730	. . . . . . 7 ⊢ (Base‘𝑀) = (Base‘𝑀)
39	38, 29	mndidcl 18683	. . . . . 6 ⊢ (𝑀 ∈ Mnd → (0g‘𝑀) ∈ (Base‘𝑀))
40		gsumwun.p	. . . . . . 7 ⊢ + = (+g‘𝑀)
41	38, 40, 29	mndlid 18688	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ (0g‘𝑀) ∈ (Base‘𝑀)) → ((0g‘𝑀) + (0g‘𝑀)) = (0g‘𝑀))
42	37, 39, 41	syl2anc2 585	. . . . 5 ⊢ (𝜑 → ((0g‘𝑀) + (0g‘𝑀)) = (0g‘𝑀))
43	35, 42	eqtr4id 2784	. . . 4 ⊢ (𝜑 → (𝑀 Σg ∅) = ((0g‘𝑀) + (0g‘𝑀)))
44	25, 27, 31, 34, 43	2rspcedvdw 3605	. . 3 ⊢ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg ∅) = (𝑒 + 𝑓))
45		oveq1 7397	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑒 + 𝑥) → (𝑖 + 𝑗) = ((𝑒 + 𝑥) + 𝑗))
46	45	eqeq2d 2741	. . . . . . . . . 10 ⊢ (𝑖 = (𝑒 + 𝑥) → ((𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗) ↔ (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑒 + 𝑥) + 𝑗)))
47		oveq2 7398	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑓 → ((𝑒 + 𝑥) + 𝑗) = ((𝑒 + 𝑥) + 𝑓))
48	47	eqeq2d 2741	. . . . . . . . . 10 ⊢ (𝑗 = 𝑓 → ((𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑒 + 𝑥) + 𝑗) ↔ (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑒 + 𝑥) + 𝑓)))
49	28	ad6antr 736	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → 𝐸 ∈ (SubMnd‘𝑀))
50		simp-4r 783	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → 𝑒 ∈ 𝐸)
51		simpr 484	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → 𝑥 ∈ 𝐸)
52	40, 49, 50, 51	submcld 32983	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → (𝑒 + 𝑥) ∈ 𝐸)
53		simpllr 775	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → 𝑓 ∈ 𝐹)
54	37	ad5antr 734	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑀 ∈ Mnd)
55	38	submss 18743	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐸 ∈ (SubMnd‘𝑀) → 𝐸 ⊆ (Base‘𝑀))
56	28, 55	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐸 ⊆ (Base‘𝑀))
57	38	submss 18743	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐹 ∈ (SubMnd‘𝑀) → 𝐹 ⊆ (Base‘𝑀))
58	32, 57	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐹 ⊆ (Base‘𝑀))
59	56, 58	unssd 4158	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐸 ∪ 𝐹) ⊆ (Base‘𝑀))
60		sswrd 14494	. . . . . . . . . . . . . . . 16 ⊢ ((𝐸 ∪ 𝐹) ⊆ (Base‘𝑀) → Word (𝐸 ∪ 𝐹) ⊆ Word (Base‘𝑀))
61	59, 60	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → Word (𝐸 ∪ 𝐹) ⊆ Word (Base‘𝑀))
62	61	sselda 3949	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) → 𝑤 ∈ Word (Base‘𝑀))
63	62	ad4antr 732	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑤 ∈ Word (Base‘𝑀))
64	59	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) → (𝐸 ∪ 𝐹) ⊆ (Base‘𝑀))
65	64	sselda 3949	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) → 𝑥 ∈ (Base‘𝑀))
66	65	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑥 ∈ (Base‘𝑀))
67	38, 40	gsumccatsn 18777	. . . . . . . . . . . . 13 ⊢ ((𝑀 ∈ Mnd ∧ 𝑤 ∈ Word (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑀 Σg 𝑤) + 𝑥))
68	54, 63, 66, 67	syl3anc 1373	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑀 Σg 𝑤) + 𝑥))
69		simpr 484	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑀 Σg 𝑤) = (𝑒 + 𝑓))
70	69	oveq1d 7405	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → ((𝑀 Σg 𝑤) + 𝑥) = ((𝑒 + 𝑓) + 𝑥))
71	56	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) → 𝐸 ⊆ (Base‘𝑀))
72	71	sselda 3949	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) → 𝑒 ∈ (Base‘𝑀))
73	72	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑒 ∈ (Base‘𝑀))
74	58	ad3antrrr 730	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) → 𝐹 ⊆ (Base‘𝑀))
75	74	sselda 3949	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) → 𝑓 ∈ (Base‘𝑀))
76	75	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑓 ∈ (Base‘𝑀))
77	36	ad5antr 734	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑀 ∈ CMnd)
78	38, 40	cmncom 19735	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ CMnd ∧ 𝑓 ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑓 + 𝑥) = (𝑥 + 𝑓))
79	77, 76, 66, 78	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑓 + 𝑥) = (𝑥 + 𝑓))
80	38, 40, 54, 73, 76, 66, 79	mnd32g 18680	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → ((𝑒 + 𝑓) + 𝑥) = ((𝑒 + 𝑥) + 𝑓))
81	68, 70, 80	3eqtrd 2769	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑒 + 𝑥) + 𝑓))
82	81	adantr 480	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑒 + 𝑥) + 𝑓))
83	46, 48, 52, 53, 82	2rspcedvdw 3605	. . . . . . . . 9 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))
84		oveq1 7397	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑒 → (𝑖 + 𝑗) = (𝑒 + 𝑗))
85	84	eqeq2d 2741	. . . . . . . . . 10 ⊢ (𝑖 = 𝑒 → ((𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗) ↔ (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑒 + 𝑗)))
86		oveq2 7398	. . . . . . . . . . 11 ⊢ (𝑗 = (𝑓 + 𝑥) → (𝑒 + 𝑗) = (𝑒 + (𝑓 + 𝑥)))
87	86	eqeq2d 2741	. . . . . . . . . 10 ⊢ (𝑗 = (𝑓 + 𝑥) → ((𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑒 + 𝑗) ↔ (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑒 + (𝑓 + 𝑥))))
88		simp-4r 783	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → 𝑒 ∈ 𝐸)
89	32	ad6antr 736	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → 𝐹 ∈ (SubMnd‘𝑀))
90		simpllr 775	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → 𝑓 ∈ 𝐹)
91		simpr 484	. . . . . . . . . . 11 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → 𝑥 ∈ 𝐹)
92	40, 89, 90, 91	submcld 32983	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → (𝑓 + 𝑥) ∈ 𝐹)
93	38, 40, 54, 73, 76, 66	mndassd 32971	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → ((𝑒 + 𝑓) + 𝑥) = (𝑒 + (𝑓 + 𝑥)))
94	68, 70, 93	3eqtrd 2769	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑒 + (𝑓 + 𝑥)))
95	94	adantr 480	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑒 + (𝑓 + 𝑥)))
96	85, 87, 88, 92, 95	2rspcedvdw 3605	. . . . . . . . 9 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))
97		elun 4119	. . . . . . . . . . 11 ⊢ (𝑥 ∈ (𝐸 ∪ 𝐹) ↔ (𝑥 ∈ 𝐸 ∨ 𝑥 ∈ 𝐹))
98	97	biimpi 216	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝐸 ∪ 𝐹) → (𝑥 ∈ 𝐸 ∨ 𝑥 ∈ 𝐹))
99	98	ad4antlr 733	. . . . . . . . 9 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑥 ∈ 𝐸 ∨ 𝑥 ∈ 𝐹))
100	83, 96, 99	mpjaodan 960	. . . . . . . 8 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))
101	100	r19.29ffa 32407	. . . . . . 7 ⊢ ((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))
102	101	ex 412	. . . . . 6 ⊢ (((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗)))
103	102	expl 457	. . . . 5 ⊢ (𝜑 → ((𝑤 ∈ Word (𝐸 ∪ 𝐹) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))))
104	103	com12 32	. . . 4 ⊢ ((𝑤 ∈ Word (𝐸 ∪ 𝐹) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) → (𝜑 → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))))
105	104	a2d 29	. . 3 ⊢ ((𝑤 ∈ Word (𝐸 ∪ 𝐹) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝜑 → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))))
106	5, 9, 19, 23, 44, 105	wrdind 14694	. 2 ⊢ (𝑊 ∈ Word (𝐸 ∪ 𝐹) → (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓)))
107	1, 106	mpcom 38	1 ⊢ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109  ∃wrex 3054   ∪ cun 3915   ⊆ wss 3917  ∅c0 4299  ‘cfv 6514  (class class class)co 7390  Word cword 14485   ++ cconcat 14542  ⟨“cs1 14567  Basecbs 17186  +_gcplusg 17227  0_gc0g 17409   Σ_g cgsu 17410  Mndcmnd 18668  SubMndcsubmnd 18716  CMndccmn 19717

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-rmo 3356  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-2 12256  df-n0 12450  df-xnn0 12523  df-z 12537  df-uz 12801  df-fz 13476  df-fzo 13623  df-seq 13974  df-hash 14303  df-word 14486  df-lsw 14535  df-concat 14543  df-s1 14568  df-substr 14613  df-pfx 14643  df-sets 17141  df-slot 17159  df-ndx 17171  df-base 17187  df-ress 17208  df-plusg 17240  df-0g 17411  df-gsum 17412  df-mgm 18574  df-sgrp 18653  df-mnd 18669  df-submnd 18718  df-cmn 19719

This theorem is referenced by:  elrgspnsubrunlem2  33206