Theorem gsumwspan 18010

Description: The submonoid generated by a set of elements is precisely the set of elements which can be expressed as finite products of the generator. (Contributed by Stefan O'Rear, 22-Aug-2015.)

Hypotheses

Ref	Expression
gsumwspan.b	⊢ 𝐵 = (Base‘𝑀)
gsumwspan.k	⊢ 𝐾 = (mrCls‘(SubMnd‘𝑀))

Assertion

Ref	Expression
gsumwspan	⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (𝐾‘𝐺) = ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))

Distinct variable groups:   𝑤,𝐺   𝑤,𝐵   𝑤,𝑀   𝑤,𝐾

Proof of Theorem gsumwspan

Dummy variables 𝑣 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		gsumwspan.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝑀)
2	1	submacs 17990	. . . . 5 ⊢ (𝑀 ∈ Mnd → (SubMnd‘𝑀) ∈ (ACS‘𝐵))
3	2	acsmred 16926	. . . 4 ⊢ (𝑀 ∈ Mnd → (SubMnd‘𝑀) ∈ (Moore‘𝐵))
4	3	adantr 483	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (SubMnd‘𝑀) ∈ (Moore‘𝐵))
5		simpr 487	. . . . . . . 8 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑥 ∈ 𝐺) → 𝑥 ∈ 𝐺)
6	5	s1cld 13956	. . . . . . 7 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑥 ∈ 𝐺) → ⟨“𝑥”⟩ ∈ Word 𝐺)
7		ssel2 3961	. . . . . . . . . 10 ⊢ ((𝐺 ⊆ 𝐵 ∧ 𝑥 ∈ 𝐺) → 𝑥 ∈ 𝐵)
8	7	adantll 712	. . . . . . . . 9 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑥 ∈ 𝐺) → 𝑥 ∈ 𝐵)
9	1	gsumws1 18001	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝐵 → (𝑀 Σg ⟨“𝑥”⟩) = 𝑥)
10	8, 9	syl 17	. . . . . . . 8 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑥 ∈ 𝐺) → (𝑀 Σg ⟨“𝑥”⟩) = 𝑥)
11	10	eqcomd 2827	. . . . . . 7 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑥 ∈ 𝐺) → 𝑥 = (𝑀 Σg ⟨“𝑥”⟩))
12		oveq2 7163	. . . . . . . 8 ⊢ (𝑤 = ⟨“𝑥”⟩ → (𝑀 Σg 𝑤) = (𝑀 Σg ⟨“𝑥”⟩))
13	12	rspceeqv 3637	. . . . . . 7 ⊢ ((⟨“𝑥”⟩ ∈ Word 𝐺 ∧ 𝑥 = (𝑀 Σg ⟨“𝑥”⟩)) → ∃𝑤 ∈ Word 𝐺𝑥 = (𝑀 Σg 𝑤))
14	6, 11, 13	syl2anc 586	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑥 ∈ 𝐺) → ∃𝑤 ∈ Word 𝐺𝑥 = (𝑀 Σg 𝑤))
15		eqid 2821	. . . . . . . 8 ⊢ (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) = (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))
16	15	elrnmpt 5827	. . . . . . 7 ⊢ (𝑥 ∈ V → (𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝐺𝑥 = (𝑀 Σg 𝑤)))
17	16	elv 3499	. . . . . 6 ⊢ (𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝐺𝑥 = (𝑀 Σg 𝑤))
18	14, 17	sylibr 236	. . . . 5 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑥 ∈ 𝐺) → 𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
19	18	ex 415	. . . 4 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (𝑥 ∈ 𝐺 → 𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))))
20	19	ssrdv 3972	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → 𝐺 ⊆ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
21		gsumwspan.k	. . . . . . . . . 10 ⊢ 𝐾 = (mrCls‘(SubMnd‘𝑀))
22	21	mrccl 16881	. . . . . . . . 9 ⊢ (((SubMnd‘𝑀) ∈ (Moore‘𝐵) ∧ 𝐺 ⊆ 𝐵) → (𝐾‘𝐺) ∈ (SubMnd‘𝑀))
23	3, 22	sylan 582	. . . . . . . 8 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (𝐾‘𝐺) ∈ (SubMnd‘𝑀))
24	21	mrcssid 16887	. . . . . . . . . . 11 ⊢ (((SubMnd‘𝑀) ∈ (Moore‘𝐵) ∧ 𝐺 ⊆ 𝐵) → 𝐺 ⊆ (𝐾‘𝐺))
25	3, 24	sylan 582	. . . . . . . . . 10 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → 𝐺 ⊆ (𝐾‘𝐺))
26		sswrd 13868	. . . . . . . . . 10 ⊢ (𝐺 ⊆ (𝐾‘𝐺) → Word 𝐺 ⊆ Word (𝐾‘𝐺))
27	25, 26	syl 17	. . . . . . . . 9 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → Word 𝐺 ⊆ Word (𝐾‘𝐺))
28	27	sselda 3966	. . . . . . . 8 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑤 ∈ Word 𝐺) → 𝑤 ∈ Word (𝐾‘𝐺))
29		gsumwsubmcl 18000	. . . . . . . 8 ⊢ (((𝐾‘𝐺) ∈ (SubMnd‘𝑀) ∧ 𝑤 ∈ Word (𝐾‘𝐺)) → (𝑀 Σg 𝑤) ∈ (𝐾‘𝐺))
30	23, 28, 29	syl2an2r 683	. . . . . . 7 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ 𝑤 ∈ Word 𝐺) → (𝑀 Σg 𝑤) ∈ (𝐾‘𝐺))
31	30	fmpttd 6878	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)):Word 𝐺⟶(𝐾‘𝐺))
32	31	frnd 6520	. . . . 5 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ⊆ (𝐾‘𝐺))
33	3, 21	mrcssvd 16893	. . . . . 6 ⊢ (𝑀 ∈ Mnd → (𝐾‘𝐺) ⊆ 𝐵)
34	33	adantr 483	. . . . 5 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (𝐾‘𝐺) ⊆ 𝐵)
35	32, 34	sstrd 3976	. . . 4 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ⊆ 𝐵)
36		wrd0 13888	. . . . . 6 ⊢ ∅ ∈ Word 𝐺
37		eqid 2821	. . . . . . . . 9 ⊢ (0g‘𝑀) = (0g‘𝑀)
38	37	gsum0 17893	. . . . . . . 8 ⊢ (𝑀 Σg ∅) = (0g‘𝑀)
39	38	eqcomi 2830	. . . . . . 7 ⊢ (0g‘𝑀) = (𝑀 Σg ∅)
40	39	a1i 11	. . . . . 6 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (0g‘𝑀) = (𝑀 Σg ∅))
41		oveq2 7163	. . . . . . 7 ⊢ (𝑤 = ∅ → (𝑀 Σg 𝑤) = (𝑀 Σg ∅))
42	41	rspceeqv 3637	. . . . . 6 ⊢ ((∅ ∈ Word 𝐺 ∧ (0g‘𝑀) = (𝑀 Σg ∅)) → ∃𝑤 ∈ Word 𝐺(0g‘𝑀) = (𝑀 Σg 𝑤))
43	36, 40, 42	sylancr 589	. . . . 5 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → ∃𝑤 ∈ Word 𝐺(0g‘𝑀) = (𝑀 Σg 𝑤))
44		fvex 6682	. . . . . 6 ⊢ (0g‘𝑀) ∈ V
45	15	elrnmpt 5827	. . . . . 6 ⊢ ((0g‘𝑀) ∈ V → ((0g‘𝑀) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝐺(0g‘𝑀) = (𝑀 Σg 𝑤)))
46	44, 45	ax-mp 5	. . . . 5 ⊢ ((0g‘𝑀) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝐺(0g‘𝑀) = (𝑀 Σg 𝑤))
47	43, 46	sylibr 236	. . . 4 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (0g‘𝑀) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
48		ccatcl 13925	. . . . . . . 8 ⊢ ((𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺) → (𝑧 ++ 𝑣) ∈ Word 𝐺)
49		simpll 765	. . . . . . . . . 10 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → 𝑀 ∈ Mnd)
50		sswrd 13868	. . . . . . . . . . . 12 ⊢ (𝐺 ⊆ 𝐵 → Word 𝐺 ⊆ Word 𝐵)
51	50	ad2antlr 725	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → Word 𝐺 ⊆ Word 𝐵)
52		simprl 769	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → 𝑧 ∈ Word 𝐺)
53	51, 52	sseldd 3967	. . . . . . . . . 10 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → 𝑧 ∈ Word 𝐵)
54		simprr 771	. . . . . . . . . . 11 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → 𝑣 ∈ Word 𝐺)
55	51, 54	sseldd 3967	. . . . . . . . . 10 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → 𝑣 ∈ Word 𝐵)
56		eqid 2821	. . . . . . . . . . 11 ⊢ (+g‘𝑀) = (+g‘𝑀)
57	1, 56	gsumccat 18005	. . . . . . . . . 10 ⊢ ((𝑀 ∈ Mnd ∧ 𝑧 ∈ Word 𝐵 ∧ 𝑣 ∈ Word 𝐵) → (𝑀 Σg (𝑧 ++ 𝑣)) = ((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)))
58	49, 53, 55, 57	syl3anc 1367	. . . . . . . . 9 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → (𝑀 Σg (𝑧 ++ 𝑣)) = ((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)))
59	58	eqcomd 2827	. . . . . . . 8 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → ((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) = (𝑀 Σg (𝑧 ++ 𝑣)))
60		oveq2 7163	. . . . . . . . 9 ⊢ (𝑤 = (𝑧 ++ 𝑣) → (𝑀 Σg 𝑤) = (𝑀 Σg (𝑧 ++ 𝑣)))
61	60	rspceeqv 3637	. . . . . . . 8 ⊢ (((𝑧 ++ 𝑣) ∈ Word 𝐺 ∧ ((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) = (𝑀 Σg (𝑧 ++ 𝑣))) → ∃𝑤 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) = (𝑀 Σg 𝑤))
62	48, 59, 61	syl2an2 684	. . . . . . 7 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → ∃𝑤 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) = (𝑀 Σg 𝑤))
63		ovex 7188	. . . . . . . 8 ⊢ ((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ V
64	15	elrnmpt 5827	. . . . . . . 8 ⊢ (((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ V → (((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) = (𝑀 Σg 𝑤)))
65	63, 64	ax-mp 5	. . . . . . 7 ⊢ (((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) = (𝑀 Σg 𝑤))
66	62, 65	sylibr 236	. . . . . 6 ⊢ (((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) ∧ (𝑧 ∈ Word 𝐺 ∧ 𝑣 ∈ Word 𝐺)) → ((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
67	66	ralrimivva 3191	. . . . 5 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → ∀𝑧 ∈ Word 𝐺∀𝑣 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
68		oveq2 7163	. . . . . . . . 9 ⊢ (𝑤 = 𝑧 → (𝑀 Σg 𝑤) = (𝑀 Σg 𝑧))
69	68	cbvmptv 5168	. . . . . . . 8 ⊢ (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) = (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧))
70	69	rneqi 5806	. . . . . . 7 ⊢ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) = ran (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧))
71	70	raleqi 3413	. . . . . 6 ⊢ (∀𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑥 ∈ ran (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧))∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
72		oveq2 7163	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑣 → (𝑀 Σg 𝑤) = (𝑀 Σg 𝑣))
73	72	cbvmptv 5168	. . . . . . . . . 10 ⊢ (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) = (𝑣 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑣))
74	73	rneqi 5806	. . . . . . . . 9 ⊢ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) = ran (𝑣 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑣))
75	74	raleqi 3413	. . . . . . . 8 ⊢ (∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑦 ∈ ran (𝑣 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑣))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
76		eqid 2821	. . . . . . . . . 10 ⊢ (𝑣 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑣)) = (𝑣 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑣))
77		oveq2 7163	. . . . . . . . . . 11 ⊢ (𝑦 = (𝑀 Σg 𝑣) → (𝑥(+g‘𝑀)𝑦) = (𝑥(+g‘𝑀)(𝑀 Σg 𝑣)))
78	77	eleq1d 2897	. . . . . . . . . 10 ⊢ (𝑦 = (𝑀 Σg 𝑣) → ((𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ (𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))))
79	76, 78	ralrnmptw 6859	. . . . . . . . 9 ⊢ (∀𝑣 ∈ Word 𝐺(𝑀 Σg 𝑣) ∈ V → (∀𝑦 ∈ ran (𝑣 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑣))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑣 ∈ Word 𝐺(𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))))
80		ovexd 7190	. . . . . . . . 9 ⊢ (𝑣 ∈ Word 𝐺 → (𝑀 Σg 𝑣) ∈ V)
81	79, 80	mprg 3152	. . . . . . . 8 ⊢ (∀𝑦 ∈ ran (𝑣 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑣))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑣 ∈ Word 𝐺(𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
82	75, 81	bitri 277	. . . . . . 7 ⊢ (∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑣 ∈ Word 𝐺(𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
83	82	ralbii 3165	. . . . . 6 ⊢ (∀𝑥 ∈ ran (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧))∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑥 ∈ ran (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧))∀𝑣 ∈ Word 𝐺(𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
84		eqid 2821	. . . . . . . 8 ⊢ (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧)) = (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧))
85		oveq1 7162	. . . . . . . . . 10 ⊢ (𝑥 = (𝑀 Σg 𝑧) → (𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) = ((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)))
86	85	eleq1d 2897	. . . . . . . . 9 ⊢ (𝑥 = (𝑀 Σg 𝑧) → ((𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))))
87	86	ralbidv 3197	. . . . . . . 8 ⊢ (𝑥 = (𝑀 Σg 𝑧) → (∀𝑣 ∈ Word 𝐺(𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑣 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))))
88	84, 87	ralrnmptw 6859	. . . . . . 7 ⊢ (∀𝑧 ∈ Word 𝐺(𝑀 Σg 𝑧) ∈ V → (∀𝑥 ∈ ran (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧))∀𝑣 ∈ Word 𝐺(𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑧 ∈ Word 𝐺∀𝑣 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))))
89		ovexd 7190	. . . . . . 7 ⊢ (𝑧 ∈ Word 𝐺 → (𝑀 Σg 𝑧) ∈ V)
90	88, 89	mprg 3152	. . . . . 6 ⊢ (∀𝑥 ∈ ran (𝑧 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑧))∀𝑣 ∈ Word 𝐺(𝑥(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑧 ∈ Word 𝐺∀𝑣 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
91	71, 83, 90	3bitri 299	. . . . 5 ⊢ (∀𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ↔ ∀𝑧 ∈ Word 𝐺∀𝑣 ∈ Word 𝐺((𝑀 Σg 𝑧)(+g‘𝑀)(𝑀 Σg 𝑣)) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
92	67, 91	sylibr 236	. . . 4 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → ∀𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
93	1, 37, 56	issubm 17967	. . . . 5 ⊢ (𝑀 ∈ Mnd → (ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ∈ (SubMnd‘𝑀) ↔ (ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ⊆ 𝐵 ∧ (0g‘𝑀) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ∧ ∀𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))))
94	93	adantr 483	. . . 4 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ∈ (SubMnd‘𝑀) ↔ (ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ⊆ 𝐵 ∧ (0g‘𝑀) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ∧ ∀𝑥 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))∀𝑦 ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤))(𝑥(+g‘𝑀)𝑦) ∈ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))))
95	35, 47, 92, 94	mpbir3and 1338	. . 3 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ∈ (SubMnd‘𝑀))
96	21	mrcsscl 16890	. . 3 ⊢ (((SubMnd‘𝑀) ∈ (Moore‘𝐵) ∧ 𝐺 ⊆ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ∧ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)) ∈ (SubMnd‘𝑀)) → (𝐾‘𝐺) ⊆ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
97	4, 20, 95, 96	syl3anc 1367	. 2 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (𝐾‘𝐺) ⊆ ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))
98	97, 32	eqssd 3983	1 ⊢ ((𝑀 ∈ Mnd ∧ 𝐺 ⊆ 𝐵) → (𝐾‘𝐺) = ran (𝑤 ∈ Word 𝐺 ↦ (𝑀 Σg 𝑤)))

Syntax hints:   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1533   ∈ wcel 2110  ∀wral 3138  ∃wrex 3139  Vcvv 3494   ⊆ wss 3935  ∅c0 4290   ↦ cmpt 5145  ran crn 5555  ‘cfv 6354  (class class class)co 7155  Word cword 13860   ++ cconcat 13921  ⟨“cs1 13948  Basecbs 16482  +_gcplusg 16564  0_gc0g 16712   Σ_g cgsu 16713  Moorecmre 16852  mrClscmrc 16853  Mndcmnd 17910  SubMndcsubmnd 17954

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-cnex 10592  ax-resscn 10593  ax-1cn 10594  ax-icn 10595  ax-addcl 10596  ax-addrcl 10597  ax-mulcl 10598  ax-mulrcl 10599  ax-mulcom 10600  ax-addass 10601  ax-mulass 10602  ax-distr 10603  ax-i2m1 10604  ax-1ne0 10605  ax-1rid 10606  ax-rnegex 10607  ax-rrecex 10608  ax-cnre 10609  ax-pre-lttri 10610  ax-pre-lttrn 10611  ax-pre-ltadd 10612  ax-pre-mulgt0 10613

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4838  df-int 4876  df-iun 4920  df-iin 4921  df-br 5066  df-opab 5128  df-mpt 5146  df-tr 5172  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-riota 7113  df-ov 7158  df-oprab 7159  df-mpo 7160  df-om 7580  df-1st 7688  df-2nd 7689  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-1o 8101  df-oadd 8105  df-er 8288  df-en 8509  df-dom 8510  df-sdom 8511  df-fin 8512  df-card 9367  df-pnf 10676  df-mnf 10677  df-xr 10678  df-ltxr 10679  df-le 10680  df-sub 10871  df-neg 10872  df-nn 11638  df-2 11699  df-n0 11897  df-z 11981  df-uz 12243  df-fz 12892  df-fzo 13033  df-seq 13369  df-hash 13690  df-word 13861  df-concat 13922  df-s1 13949  df-ndx 16485  df-slot 16486  df-base 16488  df-sets 16489  df-ress 16490  df-plusg 16577  df-0g 16714  df-gsum 16715  df-mre 16856  df-mrc 16857  df-acs 16859  df-mgm 17851  df-sgrp 17900  df-mnd 17911  df-submnd 17956

This theorem is referenced by:  psgneldm2  18631  psgnfitr  18644