Theorem smndex1mgm 18717

Description: The monoid of endofunctions on ℕ₀ restricted to the modulo function 𝐼 and the constant functions (𝐺‘𝐾) is a magma. (Contributed by AV, 14-Feb-2024.)

Hypotheses

Ref	Expression
smndex1ibas.m	⊢ 𝑀 = (EndoFMnd‘ℕ0)
smndex1ibas.n	⊢ 𝑁 ∈ ℕ
smndex1ibas.i	⊢ 𝐼 = (𝑥 ∈ ℕ0 ↦ (𝑥 mod 𝑁))
smndex1ibas.g	⊢ 𝐺 = (𝑛 ∈ (0..^𝑁) ↦ (𝑥 ∈ ℕ0 ↦ 𝑛))
smndex1mgm.b	⊢ 𝐵 = ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)})
smndex1mgm.s	⊢ 𝑆 = (𝑀 ↾s 𝐵)

Assertion

Ref	Expression
smndex1mgm	⊢ 𝑆 ∈ Mgm

Distinct variable groups:   𝑥,𝑁,𝑛   𝑥,𝑀   𝑛,𝐺   𝑛,𝑀   𝑥,𝐺   𝑛,𝐼,𝑥

Allowed substitution hints:   𝐵(𝑥,𝑛)   𝑆(𝑥,𝑛)

Proof of Theorem smndex1mgm

Dummy variables 𝑏 𝑘 𝑎 𝑚 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		smndex1ibas.m	. . . . . . 7 ⊢ 𝑀 = (EndoFMnd‘ℕ0)
2		smndex1ibas.n	. . . . . . 7 ⊢ 𝑁 ∈ ℕ
3		smndex1ibas.i	. . . . . . 7 ⊢ 𝐼 = (𝑥 ∈ ℕ0 ↦ (𝑥 mod 𝑁))
4		smndex1ibas.g	. . . . . . 7 ⊢ 𝐺 = (𝑛 ∈ (0..^𝑁) ↦ (𝑥 ∈ ℕ0 ↦ 𝑛))
5		smndex1mgm.b	. . . . . . 7 ⊢ 𝐵 = ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)})
6	1, 2, 3, 4, 5	smndex1basss 18715	. . . . . 6 ⊢ 𝐵 ⊆ (Base‘𝑀)
7		ssel 3937	. . . . . . 7 ⊢ (𝐵 ⊆ (Base‘𝑀) → (𝑎 ∈ 𝐵 → 𝑎 ∈ (Base‘𝑀)))
8		ssel 3937	. . . . . . 7 ⊢ (𝐵 ⊆ (Base‘𝑀) → (𝑏 ∈ 𝐵 → 𝑏 ∈ (Base‘𝑀)))
9	7, 8	anim12d 609	. . . . . 6 ⊢ (𝐵 ⊆ (Base‘𝑀) → ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀))))
10	6, 9	ax-mp 5	. . . . 5 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)))
11		eqid 2736	. . . . . 6 ⊢ (Base‘𝑀) = (Base‘𝑀)
12		eqid 2736	. . . . . 6 ⊢ (+g‘𝑀) = (+g‘𝑀)
13	1, 11, 12	efmndov 18691	. . . . 5 ⊢ ((𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)) → (𝑎(+g‘𝑀)𝑏) = (𝑎 ∘ 𝑏))
14	10, 13	syl 17	. . . 4 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑀)𝑏) = (𝑎 ∘ 𝑏))
15		simpl 483	. . . . . . . . . . . 12 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → 𝑎 = 𝐼)
16		simpr 485	. . . . . . . . . . . 12 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → 𝑏 = 𝐼)
17	15, 16	coeq12d 5820	. . . . . . . . . . 11 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → (𝑎 ∘ 𝑏) = (𝐼 ∘ 𝐼))
18	1, 2, 3	smndex1iidm 18711	. . . . . . . . . . 11 ⊢ (𝐼 ∘ 𝐼) = 𝐼
19	17, 18	eqtrdi 2792	. . . . . . . . . 10 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → (𝑎 ∘ 𝑏) = 𝐼)
20	19	orcd 871	. . . . . . . . 9 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
21	20	ex 413	. . . . . . . 8 ⊢ (𝑎 = 𝐼 → (𝑏 = 𝐼 → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
22		simpll 765	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → 𝑎 = 𝐼)
23		simpr 485	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → 𝑏 = (𝐺‘𝑘))
24	22, 23	coeq12d 5820	. . . . . . . . . . . . . 14 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = (𝐼 ∘ (𝐺‘𝑘)))
25	1, 2, 3, 4	smndex1igid 18714	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝑘)) = (𝐺‘𝑘))
26	25	ad2antlr 725	. . . . . . . . . . . . . 14 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → (𝐼 ∘ (𝐺‘𝑘)) = (𝐺‘𝑘))
27	24, 26	eqtrd 2776	. . . . . . . . . . . . 13 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘))
28	27	ex 413	. . . . . . . . . . . 12 ⊢ ((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑏 = (𝐺‘𝑘) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
29	28	reximdva 3165	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐼 → (∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
30	29	imp 407	. . . . . . . . . 10 ⊢ ((𝑎 = 𝐼 ∧ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
31	30	olcd 872	. . . . . . . . 9 ⊢ ((𝑎 = 𝐼 ∧ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
32	31	ex 413	. . . . . . . 8 ⊢ (𝑎 = 𝐼 → (∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
33	21, 32	jaod 857	. . . . . . 7 ⊢ (𝑎 = 𝐼 → ((𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
34		simpr 485	. . . . . . . . . . . . . . 15 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → 𝑎 = (𝐺‘𝑘))
35		simpll 765	. . . . . . . . . . . . . . 15 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → 𝑏 = 𝐼)
36	34, 35	coeq12d 5820	. . . . . . . . . . . . . 14 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = ((𝐺‘𝑘) ∘ 𝐼))
37	1, 2, 3	smndex1ibas 18710	. . . . . . . . . . . . . . . 16 ⊢ 𝐼 ∈ (Base‘𝑀)
38	1, 2, 3, 4	smndex1gid 18713	. . . . . . . . . . . . . . . 16 ⊢ ((𝐼 ∈ (Base‘𝑀) ∧ 𝑘 ∈ (0..^𝑁)) → ((𝐺‘𝑘) ∘ 𝐼) = (𝐺‘𝑘))
39	37, 38	mpan 688	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (0..^𝑁) → ((𝐺‘𝑘) ∘ 𝐼) = (𝐺‘𝑘))
40	39	ad2antlr 725	. . . . . . . . . . . . . 14 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → ((𝐺‘𝑘) ∘ 𝐼) = (𝐺‘𝑘))
41	36, 40	eqtrd 2776	. . . . . . . . . . . . 13 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘))
42	41	ex 413	. . . . . . . . . . . 12 ⊢ ((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑎 = (𝐺‘𝑘) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
43	42	reximdva 3165	. . . . . . . . . . 11 ⊢ (𝑏 = 𝐼 → (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
44	43	imp 407	. . . . . . . . . 10 ⊢ ((𝑏 = 𝐼 ∧ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
45	44	olcd 872	. . . . . . . . 9 ⊢ ((𝑏 = 𝐼 ∧ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
46	45	expcom 414	. . . . . . . 8 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → (𝑏 = 𝐼 → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
47		fveq2 6842	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑚 → (𝐺‘𝑘) = (𝐺‘𝑚))
48	47	eqeq2d 2747	. . . . . . . . . 10 ⊢ (𝑘 = 𝑚 → (𝑏 = (𝐺‘𝑘) ↔ 𝑏 = (𝐺‘𝑚)))
49	48	cbvrexvw 3226	. . . . . . . . 9 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘) ↔ ∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚))
50		simpr 485	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → 𝑎 = (𝐺‘𝑘))
51		simpllr 774	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → 𝑏 = (𝐺‘𝑚))
52	50, 51	coeq12d 5820	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = ((𝐺‘𝑘) ∘ (𝐺‘𝑚)))
53	1, 2, 3, 4	smndex1gbas 18712	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ (0..^𝑁) → (𝐺‘𝑚) ∈ (Base‘𝑀))
54	1, 2, 3, 4	smndex1gid 18713	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐺‘𝑚) ∈ (Base‘𝑀) ∧ 𝑘 ∈ (0..^𝑁)) → ((𝐺‘𝑘) ∘ (𝐺‘𝑚)) = (𝐺‘𝑘))
55	53, 54	sylan 580	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ∈ (0..^𝑁) ∧ 𝑘 ∈ (0..^𝑁)) → ((𝐺‘𝑘) ∘ (𝐺‘𝑚)) = (𝐺‘𝑘))
56	55	ad4ant13 749	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → ((𝐺‘𝑘) ∘ (𝐺‘𝑚)) = (𝐺‘𝑘))
57	52, 56	eqtrd 2776	. . . . . . . . . . . . . . 15 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘))
58	57	ex 413	. . . . . . . . . . . . . 14 ⊢ (((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) → (𝑎 = (𝐺‘𝑘) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
59	58	reximdva 3165	. . . . . . . . . . . . 13 ⊢ ((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) → (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
60	59	rexlimiva 3144	. . . . . . . . . . . 12 ⊢ (∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚) → (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
61	60	imp 407	. . . . . . . . . . 11 ⊢ ((∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚) ∧ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
62	61	olcd 872	. . . . . . . . . 10 ⊢ ((∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚) ∧ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
63	62	expcom 414	. . . . . . . . 9 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → (∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
64	49, 63	biimtrid 241	. . . . . . . 8 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → (∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
65	46, 64	jaod 857	. . . . . . 7 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → ((𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
66	33, 65	jaoi 855	. . . . . 6 ⊢ ((𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ((𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
67	66	imp 407	. . . . 5 ⊢ (((𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) ∧ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘))) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
68	5	eleq2i 2829	. . . . . . . 8 ⊢ (𝑎 ∈ 𝐵 ↔ 𝑎 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}))
69		fveq2 6842	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑘 → (𝐺‘𝑛) = (𝐺‘𝑘))
70	69	sneqd 4598	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑘 → {(𝐺‘𝑛)} = {(𝐺‘𝑘)})
71	70	cbviunv 5000	. . . . . . . . . 10 ⊢ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)} = ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}
72	71	uneq2i 4120	. . . . . . . . 9 ⊢ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) = ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)})
73	72	eleq2i 2829	. . . . . . . 8 ⊢ (𝑎 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) ↔ 𝑎 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
74	68, 73	bitri 274	. . . . . . 7 ⊢ (𝑎 ∈ 𝐵 ↔ 𝑎 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
75		elun 4108	. . . . . . 7 ⊢ (𝑎 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑎 ∈ {𝐼} ∨ 𝑎 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
76		velsn 4602	. . . . . . . 8 ⊢ (𝑎 ∈ {𝐼} ↔ 𝑎 = 𝐼)
77		eliun 4958	. . . . . . . . 9 ⊢ (𝑎 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑎 ∈ {(𝐺‘𝑘)})
78		velsn 4602	. . . . . . . . . 10 ⊢ (𝑎 ∈ {(𝐺‘𝑘)} ↔ 𝑎 = (𝐺‘𝑘))
79	78	rexbii 3097	. . . . . . . . 9 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 ∈ {(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘))
80	77, 79	bitri 274	. . . . . . . 8 ⊢ (𝑎 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘))
81	76, 80	orbi12i 913	. . . . . . 7 ⊢ ((𝑎 ∈ {𝐼} ∨ 𝑎 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)))
82	74, 75, 81	3bitri 296	. . . . . 6 ⊢ (𝑎 ∈ 𝐵 ↔ (𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)))
83	5	eleq2i 2829	. . . . . . . 8 ⊢ (𝑏 ∈ 𝐵 ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}))
84	72	eleq2i 2829	. . . . . . . 8 ⊢ (𝑏 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
85	83, 84	bitri 274	. . . . . . 7 ⊢ (𝑏 ∈ 𝐵 ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
86		elun 4108	. . . . . . 7 ⊢ (𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑏 ∈ {𝐼} ∨ 𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
87		velsn 4602	. . . . . . . 8 ⊢ (𝑏 ∈ {𝐼} ↔ 𝑏 = 𝐼)
88		eliun 4958	. . . . . . . . 9 ⊢ (𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)})
89		velsn 4602	. . . . . . . . . 10 ⊢ (𝑏 ∈ {(𝐺‘𝑘)} ↔ 𝑏 = (𝐺‘𝑘))
90	89	rexbii 3097	. . . . . . . . 9 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘))
91	88, 90	bitri 274	. . . . . . . 8 ⊢ (𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘))
92	87, 91	orbi12i 913	. . . . . . 7 ⊢ ((𝑏 ∈ {𝐼} ∨ 𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)))
93	85, 86, 92	3bitri 296	. . . . . 6 ⊢ (𝑏 ∈ 𝐵 ↔ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)))
94	82, 93	anbi12i 627	. . . . 5 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) ↔ ((𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) ∧ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘))))
95	5	eleq2i 2829	. . . . . . 7 ⊢ ((𝑎 ∘ 𝑏) ∈ 𝐵 ↔ (𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}))
96	72	eleq2i 2829	. . . . . . 7 ⊢ ((𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) ↔ (𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
97	95, 96	bitri 274	. . . . . 6 ⊢ ((𝑎 ∘ 𝑏) ∈ 𝐵 ↔ (𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
98		elun 4108	. . . . . 6 ⊢ ((𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ ((𝑎 ∘ 𝑏) ∈ {𝐼} ∨ (𝑎 ∘ 𝑏) ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
99		vex 3449	. . . . . . . . 9 ⊢ 𝑎 ∈ V
100		vex 3449	. . . . . . . . 9 ⊢ 𝑏 ∈ V
101	99, 100	coex 7867	. . . . . . . 8 ⊢ (𝑎 ∘ 𝑏) ∈ V
102	101	elsn 4601	. . . . . . 7 ⊢ ((𝑎 ∘ 𝑏) ∈ {𝐼} ↔ (𝑎 ∘ 𝑏) = 𝐼)
103		eliun 4958	. . . . . . . 8 ⊢ ((𝑎 ∘ 𝑏) ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) ∈ {(𝐺‘𝑘)})
104	101	elsn 4601	. . . . . . . . 9 ⊢ ((𝑎 ∘ 𝑏) ∈ {(𝐺‘𝑘)} ↔ (𝑎 ∘ 𝑏) = (𝐺‘𝑘))
105	104	rexbii 3097	. . . . . . . 8 ⊢ (∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) ∈ {(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
106	103, 105	bitri 274	. . . . . . 7 ⊢ ((𝑎 ∘ 𝑏) ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
107	102, 106	orbi12i 913	. . . . . 6 ⊢ (((𝑎 ∘ 𝑏) ∈ {𝐼} ∨ (𝑎 ∘ 𝑏) ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
108	97, 98, 107	3bitri 296	. . . . 5 ⊢ ((𝑎 ∘ 𝑏) ∈ 𝐵 ↔ ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
109	67, 94, 108	3imtr4i 291	. . . 4 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 ∘ 𝑏) ∈ 𝐵)
110	14, 109	eqeltrd 2838	. . 3 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)
111	110	rgen2 3194	. 2 ⊢ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵
112		smndex1mgm.s	. . . 4 ⊢ 𝑆 = (𝑀 ↾s 𝐵)
113	112	ovexi 7391	. . 3 ⊢ 𝑆 ∈ V
114	1, 2, 3, 4, 5, 112	smndex1bas 18716	. . . . 5 ⊢ (Base‘𝑆) = 𝐵
115	114	eqcomi 2745	. . . 4 ⊢ 𝐵 = (Base‘𝑆)
116	115	fvexi 6856	. . . . 5 ⊢ 𝐵 ∈ V
117	112, 12	ressplusg 17171	. . . . 5 ⊢ (𝐵 ∈ V → (+g‘𝑀) = (+g‘𝑆))
118	116, 117	ax-mp 5	. . . 4 ⊢ (+g‘𝑀) = (+g‘𝑆)
119	115, 118	ismgm 18498	. . 3 ⊢ (𝑆 ∈ V → (𝑆 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))
120	113, 119	ax-mp 5	. 2 ⊢ (𝑆 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)
121	111, 120	mpbir 230	1 ⊢ 𝑆 ∈ Mgm

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   = wceq 1541   ∈ wcel 2106  ∀wral 3064  ∃wrex 3073  Vcvv 3445   ∪ cun 3908   ⊆ wss 3910  {csn 4586  ∪ ciun 4954   ↦ cmpt 5188   ∘ ccom 5637  ‘cfv 6496  (class class class)co 7357  0cc0 11051  ℕcn 12153  ℕ₀cn0 12413  ..^cfzo 13567   mod cmo 13774  Basecbs 17083   ↾_s cress 17112  +_gcplusg 17133  Mgmcmgm 18495  EndoFMndcefmnd 18678

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2707  ax-rep 5242  ax-sep 5256  ax-nul 5263  ax-pow 5320  ax-pr 5384  ax-un 7672  ax-cnex 11107  ax-resscn 11108  ax-1cn 11109  ax-icn 11110  ax-addcl 11111  ax-addrcl 11112  ax-mulcl 11113  ax-mulrcl 11114  ax-mulcom 11115  ax-addass 11116  ax-mulass 11117  ax-distr 11118  ax-i2m1 11119  ax-1ne0 11120  ax-1rid 11121  ax-rnegex 11122  ax-rrecex 11123  ax-cnre 11124  ax-pre-lttri 11125  ax-pre-lttrn 11126  ax-pre-ltadd 11127  ax-pre-mulgt0 11128  ax-pre-sup 11129

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2538  df-eu 2567  df-clab 2714  df-cleq 2728  df-clel 2814  df-nfc 2889  df-ne 2944  df-nel 3050  df-ral 3065  df-rex 3074  df-rmo 3353  df-reu 3354  df-rab 3408  df-v 3447  df-sbc 3740  df-csb 3856  df-dif 3913  df-un 3915  df-in 3917  df-ss 3927  df-pss 3929  df-nul 4283  df-if 4487  df-pw 4562  df-sn 4587  df-pr 4589  df-tp 4591  df-op 4593  df-uni 4866  df-iun 4956  df-br 5106  df-opab 5168  df-mpt 5189  df-tr 5223  df-id 5531  df-eprel 5537  df-po 5545  df-so 5546  df-fr 5588  df-we 5590  df-xp 5639  df-rel 5640  df-cnv 5641  df-co 5642  df-dm 5643  df-rn 5644  df-res 5645  df-ima 5646  df-pred 6253  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6498  df-fn 6499  df-f 6500  df-f1 6501  df-fo 6502  df-f1o 6503  df-fv 6504  df-riota 7313  df-ov 7360  df-oprab 7361  df-mpo 7362  df-om 7803  df-1st 7921  df-2nd 7922  df-frecs 8212  df-wrecs 8243  df-recs 8317  df-rdg 8356  df-1o 8412  df-er 8648  df-map 8767  df-en 8884  df-dom 8885  df-sdom 8886  df-fin 8887  df-sup 9378  df-inf 9379  df-pnf 11191  df-mnf 11192  df-xr 11193  df-ltxr 11194  df-le 11195  df-sub 11387  df-neg 11388  df-div 11813  df-nn 12154  df-2 12216  df-3 12217  df-4 12218  df-5 12219  df-6 12220  df-7 12221  df-8 12222  df-9 12223  df-n0 12414  df-z 12500  df-uz 12764  df-rp 12916  df-fz 13425  df-fzo 13568  df-fl 13697  df-mod 13775  df-struct 17019  df-sets 17036  df-slot 17054  df-ndx 17066  df-base 17084  df-ress 17113  df-plusg 17146  df-tset 17152  df-mgm 18497  df-efmnd 18679

This theorem is referenced by:  smndex1sgrp  18718