Theorem smndex1mgm 19010

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 19008	. . . . . 6 ⊢ 𝐵 ⊆ (Base‘𝑀)
7		ssel 3932	. . . . . . 7 ⊢ (𝐵 ⊆ (Base‘𝑀) → (𝑎 ∈ 𝐵 → 𝑎 ∈ (Base‘𝑀)))
8		ssel 3932	. . . . . . 7 ⊢ (𝐵 ⊆ (Base‘𝑀) → (𝑏 ∈ 𝐵 → 𝑏 ∈ (Base‘𝑀)))
9	7, 8	anim12d 621	. . . . . 6 ⊢ (𝐵 ⊆ (Base‘𝑀) → ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀))))
10	6, 9	ax-mp 5	. . . . 5 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)))
11		eqid 2765	. . . . . 6 ⊢ (Base‘𝑀) = (Base‘𝑀)
12		eqid 2765	. . . . . 6 ⊢ (+g‘𝑀) = (+g‘𝑀)
13	1, 11, 12	efmndov 18981	. . . . 5 ⊢ ((𝑎 ∈ (Base‘𝑀) ∧ 𝑏 ∈ (Base‘𝑀)) → (𝑎(+g‘𝑀)𝑏) = (𝑎 ∘ 𝑏))
14	10, 13	syl 18	. . . 4 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑀)𝑏) = (𝑎 ∘ 𝑏))
15		simpl 488	. . . . . . . . . . . 12 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → 𝑎 = 𝐼)
16		simpr 490	. . . . . . . . . . . 12 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → 𝑏 = 𝐼)
17	15, 16	coeq12d 5852	. . . . . . . . . . 11 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → (𝑎 ∘ 𝑏) = (𝐼 ∘ 𝐼))
18	1, 2, 3	smndex1iidm 19001	. . . . . . . . . . 11 ⊢ (𝐼 ∘ 𝐼) = 𝐼
19	17, 18	eqtrdi 2816	. . . . . . . . . 10 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → (𝑎 ∘ 𝑏) = 𝐼)
20	19	orcd 887	. . . . . . . . 9 ⊢ ((𝑎 = 𝐼 ∧ 𝑏 = 𝐼) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
21	20	ex 418	. . . . . . . 8 ⊢ (𝑎 = 𝐼 → (𝑏 = 𝐼 → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
22		simpll 779	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → 𝑎 = 𝐼)
23		simpr 490	. . . . . . . . . . . . . . 15 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → 𝑏 = (𝐺‘𝑘))
24	22, 23	coeq12d 5852	. . . . . . . . . . . . . 14 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = (𝐼 ∘ (𝐺‘𝑘)))
25	1, 2, 3, 4	smndex1igid 19006	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (0..^𝑁) → (𝐼 ∘ (𝐺‘𝑘)) = (𝐺‘𝑘))
26	25	ad2antlr 740	. . . . . . . . . . . . . 14 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → (𝐼 ∘ (𝐺‘𝑘)) = (𝐺‘𝑘))
27	24, 26	eqtrd 2800	. . . . . . . . . . . . 13 ⊢ (((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑏 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘))
28	27	ex 418	. . . . . . . . . . . 12 ⊢ ((𝑎 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑏 = (𝐺‘𝑘) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
29	28	reximdva 3180	. . . . . . . . . . 11 ⊢ (𝑎 = 𝐼 → (∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
30	29	imp 412	. . . . . . . . . 10 ⊢ ((𝑎 = 𝐼 ∧ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
31	30	olcd 888	. . . . . . . . 9 ⊢ ((𝑎 = 𝐼 ∧ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
32	31	ex 418	. . . . . . . 8 ⊢ (𝑎 = 𝐼 → (∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
33	21, 32	jaod 873	. . . . . . 7 ⊢ (𝑎 = 𝐼 → ((𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
34		simpr 490	. . . . . . . . . . . . . . 15 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → 𝑎 = (𝐺‘𝑘))
35		simpll 779	. . . . . . . . . . . . . . 15 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → 𝑏 = 𝐼)
36	34, 35	coeq12d 5852	. . . . . . . . . . . . . 14 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = ((𝐺‘𝑘) ∘ 𝐼))
37	1, 2, 3	smndex1ibas 19000	. . . . . . . . . . . . . . . 16 ⊢ 𝐼 ∈ (Base‘𝑀)
38	1, 2, 3, 4	smndex1gid 19004	. . . . . . . . . . . . . . . 16 ⊢ ((𝐼 ∈ (Base‘𝑀) ∧ 𝑘 ∈ (0..^𝑁)) → ((𝐺‘𝑘) ∘ 𝐼) = (𝐺‘𝑘))
39	37, 38	mpan 703	. . . . . . . . . . . . . . 15 ⊢ (𝑘 ∈ (0..^𝑁) → ((𝐺‘𝑘) ∘ 𝐼) = (𝐺‘𝑘))
40	39	ad2antlr 740	. . . . . . . . . . . . . 14 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → ((𝐺‘𝑘) ∘ 𝐼) = (𝐺‘𝑘))
41	36, 40	eqtrd 2800	. . . . . . . . . . . . 13 ⊢ (((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘))
42	41	ex 418	. . . . . . . . . . . 12 ⊢ ((𝑏 = 𝐼 ∧ 𝑘 ∈ (0..^𝑁)) → (𝑎 = (𝐺‘𝑘) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
43	42	reximdva 3180	. . . . . . . . . . 11 ⊢ (𝑏 = 𝐼 → (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
44	43	imp 412	. . . . . . . . . 10 ⊢ ((𝑏 = 𝐼 ∧ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
45	44	olcd 888	. . . . . . . . 9 ⊢ ((𝑏 = 𝐼 ∧ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
46	45	expcom 419	. . . . . . . 8 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → (𝑏 = 𝐼 → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
47		fveq2 6885	. . . . . . . . . . 11 ⊢ (𝑘 = 𝑚 → (𝐺‘𝑘) = (𝐺‘𝑚))
48	47	eqeq2d 2776	. . . . . . . . . 10 ⊢ (𝑘 = 𝑚 → (𝑏 = (𝐺‘𝑘) ↔ 𝑏 = (𝐺‘𝑚)))
49	48	cbvrexvw 3246	. . . . . . . . 9 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘) ↔ ∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚))
50		simpr 490	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → 𝑎 = (𝐺‘𝑘))
51		simpllr 788	. . . . . . . . . . . . . . . . 17 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → 𝑏 = (𝐺‘𝑚))
52	50, 51	coeq12d 5852	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = ((𝐺‘𝑘) ∘ (𝐺‘𝑚)))
53	1, 2, 3, 4	smndex1gbas 19002	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑚 ∈ (0..^𝑁) → (𝐺‘𝑚) ∈ (Base‘𝑀))
54	1, 2, 3, 4	smndex1gid 19004	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝐺‘𝑚) ∈ (Base‘𝑀) ∧ 𝑘 ∈ (0..^𝑁)) → ((𝐺‘𝑘) ∘ (𝐺‘𝑚)) = (𝐺‘𝑘))
55	53, 54	sylan 592	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑚 ∈ (0..^𝑁) ∧ 𝑘 ∈ (0..^𝑁)) → ((𝐺‘𝑘) ∘ (𝐺‘𝑚)) = (𝐺‘𝑘))
56	55	ad4ant13 764	. . . . . . . . . . . . . . . 16 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → ((𝐺‘𝑘) ∘ (𝐺‘𝑚)) = (𝐺‘𝑘))
57	52, 56	eqtrd 2800	. . . . . . . . . . . . . . 15 ⊢ ((((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) ∧ 𝑎 = (𝐺‘𝑘)) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘))
58	57	ex 418	. . . . . . . . . . . . . 14 ⊢ (((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) ∧ 𝑘 ∈ (0..^𝑁)) → (𝑎 = (𝐺‘𝑘) → (𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
59	58	reximdva 3180	. . . . . . . . . . . . 13 ⊢ ((𝑚 ∈ (0..^𝑁) ∧ 𝑏 = (𝐺‘𝑚)) → (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
60	59	rexlimiva 3160	. . . . . . . . . . . 12 ⊢ (∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚) → (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
61	60	imp 412	. . . . . . . . . . 11 ⊢ ((∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚) ∧ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
62	61	olcd 888	. . . . . . . . . 10 ⊢ ((∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚) ∧ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
63	62	expcom 419	. . . . . . . . 9 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → (∃𝑚 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑚) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
64	49, 63	biimtrid 245	. . . . . . . 8 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → (∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
65	46, 64	jaod 873	. . . . . . 7 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘) → ((𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
66	33, 65	jaoi 871	. . . . . 6 ⊢ ((𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) → ((𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))))
67	66	imp 412	. . . . 5 ⊢ (((𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) ∧ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘))) → ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
68	5	eleq2i 2857	. . . . . . . 8 ⊢ (𝑎 ∈ 𝐵 ↔ 𝑎 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}))
69		fveq2 6885	. . . . . . . . . . . 12 ⊢ (𝑛 = 𝑘 → (𝐺‘𝑛) = (𝐺‘𝑘))
70	69	sneqd 4603	. . . . . . . . . . 11 ⊢ (𝑛 = 𝑘 → {(𝐺‘𝑛)} = {(𝐺‘𝑘)})
71	70	cbviunv 5005	. . . . . . . . . 10 ⊢ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)} = ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}
72	71	uneq2i 4119	. . . . . . . . 9 ⊢ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) = ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)})
73	72	eleq2i 2857	. . . . . . . 8 ⊢ (𝑎 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) ↔ 𝑎 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
74	68, 73	bitri 278	. . . . . . 7 ⊢ (𝑎 ∈ 𝐵 ↔ 𝑎 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
75		elun 4107	. . . . . . 7 ⊢ (𝑎 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑎 ∈ {𝐼} ∨ 𝑎 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
76		velsn 4607	. . . . . . . 8 ⊢ (𝑎 ∈ {𝐼} ↔ 𝑎 = 𝐼)
77		eliun 4962	. . . . . . . . 9 ⊢ (𝑎 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑎 ∈ {(𝐺‘𝑘)})
78		velsn 4607	. . . . . . . . . 10 ⊢ (𝑎 ∈ {(𝐺‘𝑘)} ↔ 𝑎 = (𝐺‘𝑘))
79	78	rexbii 3114	. . . . . . . . 9 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑎 ∈ {(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘))
80	77, 79	bitri 278	. . . . . . . 8 ⊢ (𝑎 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘))
81	76, 80	orbi12i 928	. . . . . . 7 ⊢ ((𝑎 ∈ {𝐼} ∨ 𝑎 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)))
82	74, 75, 81	3bitri 300	. . . . . 6 ⊢ (𝑎 ∈ 𝐵 ↔ (𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)))
83	5	eleq2i 2857	. . . . . . . 8 ⊢ (𝑏 ∈ 𝐵 ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}))
84	72	eleq2i 2857	. . . . . . . 8 ⊢ (𝑏 ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
85	83, 84	bitri 278	. . . . . . 7 ⊢ (𝑏 ∈ 𝐵 ↔ 𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
86		elun 4107	. . . . . . 7 ⊢ (𝑏 ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑏 ∈ {𝐼} ∨ 𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
87		velsn 4607	. . . . . . . 8 ⊢ (𝑏 ∈ {𝐼} ↔ 𝑏 = 𝐼)
88		eliun 4962	. . . . . . . . 9 ⊢ (𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)})
89		velsn 4607	. . . . . . . . . 10 ⊢ (𝑏 ∈ {(𝐺‘𝑘)} ↔ 𝑏 = (𝐺‘𝑘))
90	89	rexbii 3114	. . . . . . . . 9 ⊢ (∃𝑘 ∈ (0..^𝑁)𝑏 ∈ {(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘))
91	88, 90	bitri 278	. . . . . . . 8 ⊢ (𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘))
92	87, 91	orbi12i 928	. . . . . . 7 ⊢ ((𝑏 ∈ {𝐼} ∨ 𝑏 ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)))
93	85, 86, 92	3bitri 300	. . . . . 6 ⊢ (𝑏 ∈ 𝐵 ↔ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘)))
94	82, 93	anbi12i 640	. . . . 5 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) ↔ ((𝑎 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑎 = (𝐺‘𝑘)) ∧ (𝑏 = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)𝑏 = (𝐺‘𝑘))))
95	5	eleq2i 2857	. . . . . . 7 ⊢ ((𝑎 ∘ 𝑏) ∈ 𝐵 ↔ (𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}))
96	72	eleq2i 2857	. . . . . . 7 ⊢ ((𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑛 ∈ (0..^𝑁){(𝐺‘𝑛)}) ↔ (𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
97	95, 96	bitri 278	. . . . . 6 ⊢ ((𝑎 ∘ 𝑏) ∈ 𝐵 ↔ (𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
98		elun 4107	. . . . . 6 ⊢ ((𝑎 ∘ 𝑏) ∈ ({𝐼} ∪ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ ((𝑎 ∘ 𝑏) ∈ {𝐼} ∨ (𝑎 ∘ 𝑏) ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}))
99		vex 3461	. . . . . . . . 9 ⊢ 𝑎 ∈ V
100		vex 3461	. . . . . . . . 9 ⊢ 𝑏 ∈ V
101	99, 100	coex 7933	. . . . . . . 8 ⊢ (𝑎 ∘ 𝑏) ∈ V
102	101	elsn 4606	. . . . . . 7 ⊢ ((𝑎 ∘ 𝑏) ∈ {𝐼} ↔ (𝑎 ∘ 𝑏) = 𝐼)
103		eliun 4962	. . . . . . . 8 ⊢ ((𝑎 ∘ 𝑏) ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) ∈ {(𝐺‘𝑘)})
104	101	elsn 4606	. . . . . . . . 9 ⊢ ((𝑎 ∘ 𝑏) ∈ {(𝐺‘𝑘)} ↔ (𝑎 ∘ 𝑏) = (𝐺‘𝑘))
105	104	rexbii 3114	. . . . . . . 8 ⊢ (∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) ∈ {(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
106	103, 105	bitri 278	. . . . . . 7 ⊢ ((𝑎 ∘ 𝑏) ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)} ↔ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘))
107	102, 106	orbi12i 928	. . . . . 6 ⊢ (((𝑎 ∘ 𝑏) ∈ {𝐼} ∨ (𝑎 ∘ 𝑏) ∈ ∪ 𝑘 ∈ (0..^𝑁){(𝐺‘𝑘)}) ↔ ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
108	97, 98, 107	3bitri 300	. . . . 5 ⊢ ((𝑎 ∘ 𝑏) ∈ 𝐵 ↔ ((𝑎 ∘ 𝑏) = 𝐼 ∨ ∃𝑘 ∈ (0..^𝑁)(𝑎 ∘ 𝑏) = (𝐺‘𝑘)))
109	67, 94, 108	3imtr4i 295	. . . 4 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎 ∘ 𝑏) ∈ 𝐵)
110	14, 109	eqeltrd 2865	. . 3 ⊢ ((𝑎 ∈ 𝐵 ∧ 𝑏 ∈ 𝐵) → (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)
111	110	rgen2 3207	. 2 ⊢ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵
112		smndex1mgm.s	. . . 4 ⊢ 𝑆 = (𝑀 ↾s 𝐵)
113	112	ovexi 7453	. . 3 ⊢ 𝑆 ∈ V
114	1, 2, 3, 4, 5, 112	smndex1bas 19009	. . . . 5 ⊢ (Base‘𝑆) = 𝐵
115	114	eqcomi 2774	. . . 4 ⊢ 𝐵 = (Base‘𝑆)
116	115	fvexi 6899	. . . . 5 ⊢ 𝐵 ∈ V
117	112, 12	ressplusg 17370	. . . . 5 ⊢ (𝐵 ∈ V → (+g‘𝑀) = (+g‘𝑆))
118	116, 117	ax-mp 5	. . . 4 ⊢ (+g‘𝑀) = (+g‘𝑆)
119	115, 118	ismgm 18725	. . 3 ⊢ (𝑆 ∈ V → (𝑆 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵))
120	113, 119	ax-mp 5	. 2 ⊢ (𝑆 ∈ Mgm ↔ ∀𝑎 ∈ 𝐵 ∀𝑏 ∈ 𝐵 (𝑎(+g‘𝑀)𝑏) ∈ 𝐵)
121	111, 120	mpbir 234	1 ⊢ 𝑆 ∈ Mgm

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ∃wrex 3091  Vcvv 3457   ∪ cun 3904   ⊆ wss 3906  {csn 4591  ∪ ciun 4958   ↦ cmpt 5194   ∘ ccom 5667  ‘cfv 6540  (class class class)co 7419  0cc0 11119  ℕcn 12252  ℕ₀cn0 12523  ..^cfzo 13703   mod cmo 13924  Basecbs 17295   ↾_s cress 17316  +_gcplusg 17336  Mgmcmgm 18722  EndoFMndcefmnd 18968

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11175  ax-resscn 11176  ax-1cn 11177  ax-icn 11178  ax-addcl 11179  ax-addrcl 11180  ax-mulcl 11181  ax-mulrcl 11182  ax-mulcom 11183  ax-addass 11184  ax-mulass 11185  ax-distr 11186  ax-i2m1 11187  ax-1ne0 11188  ax-1rid 11189  ax-rnegex 11190  ax-rrecex 11191  ax-cnre 11192  ax-pre-lttri 11193  ax-pre-lttrn 11194  ax-pre-ltadd 11195  ax-pre-mulgt0 11196  ax-pre-sup 11197

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-er 8700  df-map 8832  df-en 8950  df-dom 8951  df-sdom 8952  df-fin 8953  df-sup 9409  df-inf 9410  df-pnf 11264  df-mnf 11265  df-xr 11266  df-ltxr 11267  df-le 11268  df-sub 11462  df-neg 11463  df-div 11891  df-nn 12253  df-2 12322  df-3 12323  df-4 12324  df-5 12325  df-6 12326  df-7 12327  df-8 12328  df-9 12329  df-n0 12524  df-z 12611  df-uz 12883  df-rp 13037  df-fz 13556  df-fzo 13704  df-fl 13847  df-mod 13925  df-struct 17233  df-sets 17250  df-slot 17268  df-ndx 17280  df-base 17296  df-ress 17317  df-plusg 17349  df-tset 17355  df-mgm 18724  df-efmnd 18969

This theorem is used by:  smndex1sgrp  19011