Theorem gsumwun 33019

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 7357	. . . . . 6 ⊢ (𝑣 = ∅ → (𝑀 Σg 𝑣) = (𝑀 Σg ∅))
3	2	eqeq1d 2731	. . . . 5 ⊢ (𝑣 = ∅ → ((𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ (𝑀 Σg ∅) = (𝑒 + 𝑓)))
4	3	2rexbidv 3194	. . . 4 ⊢ (𝑣 = ∅ → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg ∅) = (𝑒 + 𝑓)))
5	4	imbi2d 340	. . 3 ⊢ (𝑣 = ∅ → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓)) ↔ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg ∅) = (𝑒 + 𝑓))))
6		oveq2 7357	. . . . . 6 ⊢ (𝑣 = 𝑤 → (𝑀 Σg 𝑣) = (𝑀 Σg 𝑤))
7	6	eqeq1d 2731	. . . . 5 ⊢ (𝑣 = 𝑤 → ((𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)))
8	7	2rexbidv 3194	. . . 4 ⊢ (𝑣 = 𝑤 → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓)))
9	8	imbi2d 340	. . 3 ⊢ (𝑣 = 𝑤 → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓)) ↔ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑤) = (𝑒 + 𝑓))))
10		oveq1 7356	. . . . . . 7 ⊢ (𝑒 = 𝑖 → (𝑒 + 𝑓) = (𝑖 + 𝑓))
11	10	eqeq2d 2740	. . . . . 6 ⊢ (𝑒 = 𝑖 → ((𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ (𝑀 Σg 𝑣) = (𝑖 + 𝑓)))
12		oveq2 7357	. . . . . . 7 ⊢ (𝑓 = 𝑗 → (𝑖 + 𝑓) = (𝑖 + 𝑗))
13	12	eqeq2d 2740	. . . . . 6 ⊢ (𝑓 = 𝑗 → ((𝑀 Σg 𝑣) = (𝑖 + 𝑓) ↔ (𝑀 Σg 𝑣) = (𝑖 + 𝑗)))
14	11, 13	cbvrex2vw 3212	. . . . 5 ⊢ (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑖 + 𝑗))
15		oveq2 7357	. . . . . . 7 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → (𝑀 Σg 𝑣) = (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)))
16	15	eqeq1d 2731	. . . . . 6 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → ((𝑀 Σg 𝑣) = (𝑖 + 𝑗) ↔ (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗)))
17	16	2rexbidv 3194	. . . . 5 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → (∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑖 + 𝑗) ↔ ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗)))
18	14, 17	bitrid 283	. . . 4 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗)))
19	18	imbi2d 340	. . 3 ⊢ (𝑣 = (𝑤 ++ ⟨“𝑥”⟩) → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓)) ↔ (𝜑 → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))))
20		oveq2 7357	. . . . . 6 ⊢ (𝑣 = 𝑊 → (𝑀 Σg 𝑣) = (𝑀 Σg 𝑊))
21	20	eqeq1d 2731	. . . . 5 ⊢ (𝑣 = 𝑊 → ((𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ (𝑀 Σg 𝑊) = (𝑒 + 𝑓)))
22	21	2rexbidv 3194	. . . 4 ⊢ (𝑣 = 𝑊 → (∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓) ↔ ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓)))
23	22	imbi2d 340	. . 3 ⊢ (𝑣 = 𝑊 → ((𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑣) = (𝑒 + 𝑓)) ↔ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓))))
24		oveq1 7356	. . . . 5 ⊢ (𝑒 = (0g‘𝑀) → (𝑒 + 𝑓) = ((0g‘𝑀) + 𝑓))
25	24	eqeq2d 2740	. . . 4 ⊢ (𝑒 = (0g‘𝑀) → ((𝑀 Σg ∅) = (𝑒 + 𝑓) ↔ (𝑀 Σg ∅) = ((0g‘𝑀) + 𝑓)))
26		oveq2 7357	. . . . 5 ⊢ (𝑓 = (0g‘𝑀) → ((0g‘𝑀) + 𝑓) = ((0g‘𝑀) + (0g‘𝑀)))
27	26	eqeq2d 2740	. . . 4 ⊢ (𝑓 = (0g‘𝑀) → ((𝑀 Σg ∅) = ((0g‘𝑀) + 𝑓) ↔ (𝑀 Σg ∅) = ((0g‘𝑀) + (0g‘𝑀))))
28		gsumwun.e	. . . . 5 ⊢ (𝜑 → 𝐸 ∈ (SubMnd‘𝑀))
29		eqid 2729	. . . . . 6 ⊢ (0g‘𝑀) = (0g‘𝑀)
30	29	subm0cl 18685	. . . . 5 ⊢ (𝐸 ∈ (SubMnd‘𝑀) → (0g‘𝑀) ∈ 𝐸)
31	28, 30	syl 17	. . . 4 ⊢ (𝜑 → (0g‘𝑀) ∈ 𝐸)
32		gsumwun.f	. . . . 5 ⊢ (𝜑 → 𝐹 ∈ (SubMnd‘𝑀))
33	29	subm0cl 18685	. . . . 5 ⊢ (𝐹 ∈ (SubMnd‘𝑀) → (0g‘𝑀) ∈ 𝐹)
34	32, 33	syl 17	. . . 4 ⊢ (𝜑 → (0g‘𝑀) ∈ 𝐹)
35	29	gsum0 18558	. . . . 5 ⊢ (𝑀 Σg ∅) = (0g‘𝑀)
36		gsumwun.m	. . . . . . 7 ⊢ (𝜑 → 𝑀 ∈ CMnd)
37	36	cmnmndd 19683	. . . . . 6 ⊢ (𝜑 → 𝑀 ∈ Mnd)
38		eqid 2729	. . . . . . 7 ⊢ (Base‘𝑀) = (Base‘𝑀)
39	38, 29	mndidcl 18623	. . . . . 6 ⊢ (𝑀 ∈ Mnd → (0g‘𝑀) ∈ (Base‘𝑀))
40		gsumwun.p	. . . . . . 7 ⊢ + = (+g‘𝑀)
41	38, 40, 29	mndlid 18628	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ (0g‘𝑀) ∈ (Base‘𝑀)) → ((0g‘𝑀) + (0g‘𝑀)) = (0g‘𝑀))
42	37, 39, 41	syl2anc2 585	. . . . 5 ⊢ (𝜑 → ((0g‘𝑀) + (0g‘𝑀)) = (0g‘𝑀))
43	35, 42	eqtr4id 2783	. . . 4 ⊢ (𝜑 → (𝑀 Σg ∅) = ((0g‘𝑀) + (0g‘𝑀)))
44	25, 27, 31, 34, 43	2rspcedvdw 3591	. . 3 ⊢ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg ∅) = (𝑒 + 𝑓))
45		oveq1 7356	. . . . . . . . . . 11 ⊢ (𝑖 = (𝑒 + 𝑥) → (𝑖 + 𝑗) = ((𝑒 + 𝑥) + 𝑗))
46	45	eqeq2d 2740	. . . . . . . . . 10 ⊢ (𝑖 = (𝑒 + 𝑥) → ((𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗) ↔ (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑒 + 𝑥) + 𝑗)))
47		oveq2 7357	. . . . . . . . . . 11 ⊢ (𝑗 = 𝑓 → ((𝑒 + 𝑥) + 𝑗) = ((𝑒 + 𝑥) + 𝑓))
48	47	eqeq2d 2740	. . . . . . . . . 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 32990	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → (𝑒 + 𝑥) ∈ 𝐸)
53		simpllr 775	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → 𝑓 ∈ 𝐹)
54	37	ad5antr 734	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑀 ∈ Mnd)
55	38	submss 18683	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐸 ∈ (SubMnd‘𝑀) → 𝐸 ⊆ (Base‘𝑀))
56	28, 55	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐸 ⊆ (Base‘𝑀))
57	38	submss 18683	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐹 ∈ (SubMnd‘𝑀) → 𝐹 ⊆ (Base‘𝑀))
58	32, 57	syl 17	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝐹 ⊆ (Base‘𝑀))
59	56, 58	unssd 4143	. . . . . . . . . . . . . . . 16 ⊢ (𝜑 → (𝐸 ∪ 𝐹) ⊆ (Base‘𝑀))
60		sswrd 14429	. . . . . . . . . . . . . . . 16 ⊢ ((𝐸 ∪ 𝐹) ⊆ (Base‘𝑀) → Word (𝐸 ∪ 𝐹) ⊆ Word (Base‘𝑀))
61	59, 60	syl 17	. . . . . . . . . . . . . . 15 ⊢ (𝜑 → Word (𝐸 ∪ 𝐹) ⊆ Word (Base‘𝑀))
62	61	sselda 3935	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) → 𝑤 ∈ Word (Base‘𝑀))
63	62	ad4antr 732	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑤 ∈ Word (Base‘𝑀))
64	59	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) → (𝐸 ∪ 𝐹) ⊆ (Base‘𝑀))
65	64	sselda 3935	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) → 𝑥 ∈ (Base‘𝑀))
66	65	ad3antrrr 730	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑥 ∈ (Base‘𝑀))
67	38, 40	gsumccatsn 18717	. . . . . . . . . . . . 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 7364	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → ((𝑀 Σg 𝑤) + 𝑥) = ((𝑒 + 𝑓) + 𝑥))
71	56	ad2antrr 726	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) → 𝐸 ⊆ (Base‘𝑀))
72	71	sselda 3935	. . . . . . . . . . . . . 14 ⊢ ((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) → 𝑒 ∈ (Base‘𝑀))
73	72	ad2antrr 726	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑒 ∈ (Base‘𝑀))
74	58	ad3antrrr 730	. . . . . . . . . . . . . . 15 ⊢ ((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) → 𝐹 ⊆ (Base‘𝑀))
75	74	sselda 3935	. . . . . . . . . . . . . 14 ⊢ (((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) → 𝑓 ∈ (Base‘𝑀))
76	75	adantr 480	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑓 ∈ (Base‘𝑀))
77	36	ad5antr 734	. . . . . . . . . . . . . 14 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → 𝑀 ∈ CMnd)
78	38, 40	cmncom 19677	. . . . . . . . . . . . . 14 ⊢ ((𝑀 ∈ CMnd ∧ 𝑓 ∈ (Base‘𝑀) ∧ 𝑥 ∈ (Base‘𝑀)) → (𝑓 + 𝑥) = (𝑥 + 𝑓))
79	77, 76, 66, 78	syl3anc 1373	. . . . . . . . . . . . 13 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑓 + 𝑥) = (𝑥 + 𝑓))
80	38, 40, 54, 73, 76, 66, 79	mnd32g 18620	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → ((𝑒 + 𝑓) + 𝑥) = ((𝑒 + 𝑥) + 𝑓))
81	68, 70, 80	3eqtrd 2768	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑒 + 𝑥) + 𝑓))
82	81	adantr 480	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = ((𝑒 + 𝑥) + 𝑓))
83	46, 48, 52, 53, 82	2rspcedvdw 3591	. . . . . . . . 9 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐸) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))
84		oveq1 7356	. . . . . . . . . . 11 ⊢ (𝑖 = 𝑒 → (𝑖 + 𝑗) = (𝑒 + 𝑗))
85	84	eqeq2d 2740	. . . . . . . . . 10 ⊢ (𝑖 = 𝑒 → ((𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗) ↔ (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑒 + 𝑗)))
86		oveq2 7357	. . . . . . . . . . 11 ⊢ (𝑗 = (𝑓 + 𝑥) → (𝑒 + 𝑗) = (𝑒 + (𝑓 + 𝑥)))
87	86	eqeq2d 2740	. . . . . . . . . 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 32990	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → (𝑓 + 𝑥) ∈ 𝐹)
93	38, 40, 54, 73, 76, 66	mndassd 32978	. . . . . . . . . . . 12 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → ((𝑒 + 𝑓) + 𝑥) = (𝑒 + (𝑓 + 𝑥)))
94	68, 70, 93	3eqtrd 2768	. . . . . . . . . . 11 ⊢ ((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑒 + (𝑓 + 𝑥)))
95	94	adantr 480	. . . . . . . . . 10 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑒 + (𝑓 + 𝑥)))
96	85, 87, 88, 92, 95	2rspcedvdw 3591	. . . . . . . . 9 ⊢ (((((((𝜑 ∧ 𝑤 ∈ Word (𝐸 ∪ 𝐹)) ∧ 𝑥 ∈ (𝐸 ∪ 𝐹)) ∧ 𝑒 ∈ 𝐸) ∧ 𝑓 ∈ 𝐹) ∧ (𝑀 Σg 𝑤) = (𝑒 + 𝑓)) ∧ 𝑥 ∈ 𝐹) → ∃𝑖 ∈ 𝐸 ∃𝑗 ∈ 𝐹 (𝑀 Σg (𝑤 ++ ⟨“𝑥”⟩)) = (𝑖 + 𝑗))
97		elun 4104	. . . . . . . . . . 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 32415	. . . . . . 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 14628	. 2 ⊢ (𝑊 ∈ Word (𝐸 ∪ 𝐹) → (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓)))
107	1, 106	mpcom 38	1 ⊢ (𝜑 → ∃𝑒 ∈ 𝐸 ∃𝑓 ∈ 𝐹 (𝑀 Σg 𝑊) = (𝑒 + 𝑓))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 847   = wceq 1540   ∈ wcel 2109  ∃wrex 3053   ∪ cun 3901   ⊆ wss 3903  ∅c0 4284  ‘cfv 6482  (class class class)co 7349  Word cword 14420   ++ cconcat 14477  ⟨“cs1 14502  Basecbs 17120  +_gcplusg 17161  0_gc0g 17343   Σ_g cgsu 17344  Mndcmnd 18608  SubMndcsubmnd 18656  CMndccmn 19659

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 2701  ax-rep 5218  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671  ax-cnex 11065  ax-resscn 11066  ax-1cn 11067  ax-icn 11068  ax-addcl 11069  ax-addrcl 11070  ax-mulcl 11071  ax-mulrcl 11072  ax-mulcom 11073  ax-addass 11074  ax-mulass 11075  ax-distr 11076  ax-i2m1 11077  ax-1ne0 11078  ax-1rid 11079  ax-rnegex 11080  ax-rrecex 11081  ax-cnre 11082  ax-pre-lttri 11083  ax-pre-lttrn 11084  ax-pre-ltadd 11085  ax-pre-mulgt0 11086

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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-nel 3030  df-ral 3045  df-rex 3054  df-rmo 3343  df-reu 3344  df-rab 3395  df-v 3438  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-int 4897  df-iun 4943  df-br 5093  df-opab 5155  df-mpt 5174  df-tr 5200  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6249  df-ord 6310  df-on 6311  df-lim 6312  df-suc 6313  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-f1 6487  df-fo 6488  df-f1o 6489  df-fv 6490  df-riota 7306  df-ov 7352  df-oprab 7353  df-mpo 7354  df-om 7800  df-1st 7924  df-2nd 7925  df-frecs 8214  df-wrecs 8245  df-recs 8294  df-rdg 8332  df-1o 8388  df-er 8625  df-en 8873  df-dom 8874  df-sdom 8875  df-fin 8876  df-card 9835  df-pnf 11151  df-mnf 11152  df-xr 11153  df-ltxr 11154  df-le 11155  df-sub 11349  df-neg 11350  df-nn 12129  df-2 12191  df-n0 12385  df-xnn0 12458  df-z 12472  df-uz 12736  df-fz 13411  df-fzo 13558  df-seq 13909  df-hash 14238  df-word 14421  df-lsw 14470  df-concat 14478  df-s1 14503  df-substr 14548  df-pfx 14578  df-sets 17075  df-slot 17093  df-ndx 17105  df-base 17121  df-ress 17142  df-plusg 17174  df-0g 17345  df-gsum 17346  df-mgm 18514  df-sgrp 18593  df-mnd 18609  df-submnd 18658  df-cmn 19661

This theorem is referenced by:  elrgspnsubrunlem2  33189