Theorem frgp0 19834

Description: The free group is a group. (Contributed by Mario Carneiro, 1-Oct-2015.) (Revised by Mario Carneiro, 27-Feb-2016.)

Hypotheses

Ref	Expression
frgp0.m	⊢ 𝐺 = (freeGrp‘𝐼)
frgp0.r	⊢ ∼ = ( ~FG ‘𝐼)

Assertion

Ref	Expression
frgp0	⊢ (𝐼 ∈ 𝑉 → (𝐺 ∈ Grp ∧ [∅] ∼ = (0g‘𝐺)))

Proof of Theorem frgp0

Dummy variables 𝑎 𝑏 𝑐 𝑑 𝑥 𝑦 𝑧 𝑛 𝑣 𝑤 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		frgp0.m	. . 3 ⊢ 𝐺 = (freeGrp‘𝐼)
2		eqid 2763	. . 3 ⊢ (freeMnd‘(𝐼 × 2o)) = (freeMnd‘(𝐼 × 2o))
3		frgp0.r	. . 3 ⊢ ∼ = ( ~FG ‘𝐼)
4	1, 2, 3	frgpval 19832	. 2 ⊢ (𝐼 ∈ 𝑉 → 𝐺 = ((freeMnd‘(𝐼 × 2o)) /s ∼ ))
5		2on 8463	. . . . 5 ⊢ 2o ∈ On
6		xpexg 7745	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 2o ∈ On) → (𝐼 × 2o) ∈ V)
7	5, 6	mpan2 703	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (𝐼 × 2o) ∈ V)
8		eqid 2763	. . . . 5 ⊢ (Base‘(freeMnd‘(𝐼 × 2o))) = (Base‘(freeMnd‘(𝐼 × 2o)))
9	2, 8	frmdbas 18915	. . . 4 ⊢ ((𝐼 × 2o) ∈ V → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o))
10	7, 9	syl 18	. . 3 ⊢ (𝐼 ∈ 𝑉 → (Base‘(freeMnd‘(𝐼 × 2o))) = Word (𝐼 × 2o))
11	10	eqcomd 2769	. 2 ⊢ (𝐼 ∈ 𝑉 → Word (𝐼 × 2o) = (Base‘(freeMnd‘(𝐼 × 2o))))
12		eqidd 2764	. 2 ⊢ (𝐼 ∈ 𝑉 → (+g‘(freeMnd‘(𝐼 × 2o))) = (+g‘(freeMnd‘(𝐼 × 2o))))
13		eqid 2763	. . . 4 ⊢ ( I ‘Word (𝐼 × 2o)) = ( I ‘Word (𝐼 × 2o))
14	13, 3	efger 19792	. . 3 ⊢ ∼ Er ( I ‘Word (𝐼 × 2o))
15		wrdexg 14566	. . . . 5 ⊢ ((𝐼 × 2o) ∈ V → Word (𝐼 × 2o) ∈ V)
16		fvi 6957	. . . . 5 ⊢ (Word (𝐼 × 2o) ∈ V → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o))
17	7, 15, 16	3syl 19	. . . 4 ⊢ (𝐼 ∈ 𝑉 → ( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o))
18		ereq2 8699	. . . 4 ⊢ (( I ‘Word (𝐼 × 2o)) = Word (𝐼 × 2o) → ( ∼ Er ( I ‘Word (𝐼 × 2o)) ↔ ∼ Er Word (𝐼 × 2o)))
19	17, 18	syl 18	. . 3 ⊢ (𝐼 ∈ 𝑉 → ( ∼ Er ( I ‘Word (𝐼 × 2o)) ↔ ∼ Er Word (𝐼 × 2o)))
20	14, 19	mpbii 236	. 2 ⊢ (𝐼 ∈ 𝑉 → ∼ Er Word (𝐼 × 2o))
21		fvexd 6896	. 2 ⊢ (𝐼 ∈ 𝑉 → (freeMnd‘(𝐼 × 2o)) ∈ V)
22		eqid 2763	. . . 4 ⊢ (+g‘(freeMnd‘(𝐼 × 2o))) = (+g‘(freeMnd‘(𝐼 × 2o)))
23	1, 2, 3, 22	frgpcpbl 19833	. . 3 ⊢ ((𝑎 ∼ 𝑏 ∧ 𝑐 ∼ 𝑑) → (𝑎(+g‘(freeMnd‘(𝐼 × 2o)))𝑐) ∼ (𝑏(+g‘(freeMnd‘(𝐼 × 2o)))𝑑))
24	23	a1i 11	. 2 ⊢ (𝐼 ∈ 𝑉 → ((𝑎 ∼ 𝑏 ∧ 𝑐 ∼ 𝑑) → (𝑎(+g‘(freeMnd‘(𝐼 × 2o)))𝑐) ∼ (𝑏(+g‘(freeMnd‘(𝐼 × 2o)))𝑑)))
25	2	frmdmnd 18922	. . . . . 6 ⊢ ((𝐼 × 2o) ∈ V → (freeMnd‘(𝐼 × 2o)) ∈ Mnd)
26	7, 25	syl 18	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → (freeMnd‘(𝐼 × 2o)) ∈ Mnd)
27	26	3ad2ant1 1151	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o)) → (freeMnd‘(𝐼 × 2o)) ∈ Mnd)
28		simp2 1155	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o)) → 𝑥 ∈ Word (𝐼 × 2o))
29	11	3ad2ant1 1151	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o)) → Word (𝐼 × 2o) = (Base‘(freeMnd‘(𝐼 × 2o))))
30	28, 29	eleqtrd 2865	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o)) → 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
31		simp3 1156	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o)) → 𝑦 ∈ Word (𝐼 × 2o))
32	31, 29	eleqtrd 2865	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o)) → 𝑦 ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
33	8, 22	mndcl 18804	. . . 4 ⊢ (((freeMnd‘(𝐼 × 2o)) ∈ Mnd ∧ 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2o))) ∧ 𝑦 ∈ (Base‘(freeMnd‘(𝐼 × 2o)))) → (𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦) ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
34	27, 30, 32, 33	syl3anc 1398	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o)) → (𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦) ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
35	34, 29	eleqtrrd 2866	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o)) → (𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦) ∈ Word (𝐼 × 2o))
36	20	adantr 485	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → ∼ Er Word (𝐼 × 2o))
37	26	adantr 485	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → (freeMnd‘(𝐼 × 2o)) ∈ Mnd)
38	34	3adant3r3 1203	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → (𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦) ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
39		simpr3 1215	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → 𝑧 ∈ Word (𝐼 × 2o))
40	11	adantr 485	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → Word (𝐼 × 2o) = (Base‘(freeMnd‘(𝐼 × 2o))))
41	39, 40	eleqtrd 2865	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → 𝑧 ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
42	8, 22	mndcl 18804	. . . . . 6 ⊢ (((freeMnd‘(𝐼 × 2o)) ∈ Mnd ∧ (𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦) ∈ (Base‘(freeMnd‘(𝐼 × 2o))) ∧ 𝑧 ∈ (Base‘(freeMnd‘(𝐼 × 2o)))) → ((𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦)(+g‘(freeMnd‘(𝐼 × 2o)))𝑧) ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
43	37, 38, 41, 42	syl3anc 1398	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → ((𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦)(+g‘(freeMnd‘(𝐼 × 2o)))𝑧) ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
44	43, 40	eleqtrrd 2866	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → ((𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦)(+g‘(freeMnd‘(𝐼 × 2o)))𝑧) ∈ Word (𝐼 × 2o))
45	36, 44	erref 8711	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → ((𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦)(+g‘(freeMnd‘(𝐼 × 2o)))𝑧) ∼ ((𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦)(+g‘(freeMnd‘(𝐼 × 2o)))𝑧))
46	30	3adant3r3 1203	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
47	32	3adant3r3 1203	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → 𝑦 ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
48	8, 22	mndass 18805	. . . 4 ⊢ (((freeMnd‘(𝐼 × 2o)) ∈ Mnd ∧ (𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2o))) ∧ 𝑦 ∈ (Base‘(freeMnd‘(𝐼 × 2o))) ∧ 𝑧 ∈ (Base‘(freeMnd‘(𝐼 × 2o))))) → ((𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦)(+g‘(freeMnd‘(𝐼 × 2o)))𝑧) = (𝑥(+g‘(freeMnd‘(𝐼 × 2o)))(𝑦(+g‘(freeMnd‘(𝐼 × 2o)))𝑧)))
49	37, 46, 47, 41, 48	syl13anc 1399	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → ((𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦)(+g‘(freeMnd‘(𝐼 × 2o)))𝑧) = (𝑥(+g‘(freeMnd‘(𝐼 × 2o)))(𝑦(+g‘(freeMnd‘(𝐼 × 2o)))𝑧)))
50	45, 49	breqtrd 5137	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2o) ∧ 𝑦 ∈ Word (𝐼 × 2o) ∧ 𝑧 ∈ Word (𝐼 × 2o))) → ((𝑥(+g‘(freeMnd‘(𝐼 × 2o)))𝑦)(+g‘(freeMnd‘(𝐼 × 2o)))𝑧) ∼ (𝑥(+g‘(freeMnd‘(𝐼 × 2o)))(𝑦(+g‘(freeMnd‘(𝐼 × 2o)))𝑧)))
51		wrd0 14581	. . 3 ⊢ ∅ ∈ Word (𝐼 × 2o)
52	51	a1i 11	. 2 ⊢ (𝐼 ∈ 𝑉 → ∅ ∈ Word (𝐼 × 2o))
53	51, 11	eleqtrid 2869	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → ∅ ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
54	53	adantr 485	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → ∅ ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
55	11	eleq2d 2849	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → (𝑥 ∈ Word (𝐼 × 2o) ↔ 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2o)))))
56	55	biimpa 481	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
57	2, 8, 22	frmdadd 18918	. . . . 5 ⊢ ((∅ ∈ (Base‘(freeMnd‘(𝐼 × 2o))) ∧ 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2o)))) → (∅(+g‘(freeMnd‘(𝐼 × 2o)))𝑥) = (∅ ++ 𝑥))
58	54, 56, 57	syl2anc 595	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (∅(+g‘(freeMnd‘(𝐼 × 2o)))𝑥) = (∅ ++ 𝑥))
59		ccatlid 14629	. . . . 5 ⊢ (𝑥 ∈ Word (𝐼 × 2o) → (∅ ++ 𝑥) = 𝑥)
60	59	adantl 486	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (∅ ++ 𝑥) = 𝑥)
61	58, 60	eqtrd 2798	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (∅(+g‘(freeMnd‘(𝐼 × 2o)))𝑥) = 𝑥)
62	20	adantr 485	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → ∼ Er Word (𝐼 × 2o))
63		simpr 489	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → 𝑥 ∈ Word (𝐼 × 2o))
64	62, 63	erref 8711	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → 𝑥 ∼ 𝑥)
65	61, 64	eqbrtrd 5133	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (∅(+g‘(freeMnd‘(𝐼 × 2o)))𝑥) ∼ 𝑥)
66		revcl 14803	. . . 4 ⊢ (𝑥 ∈ Word (𝐼 × 2o) → (reverse‘𝑥) ∈ Word (𝐼 × 2o))
67	66	adantl 486	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (reverse‘𝑥) ∈ Word (𝐼 × 2o))
68		eqid 2763	. . . . 5 ⊢ (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩)
69	68	efgmf 19787	. . . 4 ⊢ (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩):(𝐼 × 2o)⟶(𝐼 × 2o)
70	69	a1i 11	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩):(𝐼 × 2o)⟶(𝐼 × 2o))
71		wrdco 14873	. . 3 ⊢ (((reverse‘𝑥) ∈ Word (𝐼 × 2o) ∧ (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩):(𝐼 × 2o)⟶(𝐼 × 2o)) → ((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ∈ Word (𝐼 × 2o))
72	67, 70, 71	syl2anc 595	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → ((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ∈ Word (𝐼 × 2o))
73	11	adantr 485	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → Word (𝐼 × 2o) = (Base‘(freeMnd‘(𝐼 × 2o))))
74	72, 73	eleqtrd 2865	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → ((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ∈ (Base‘(freeMnd‘(𝐼 × 2o))))
75	2, 8, 22	frmdadd 18918	. . . 4 ⊢ ((((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ∈ (Base‘(freeMnd‘(𝐼 × 2o))) ∧ 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2o)))) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥))(+g‘(freeMnd‘(𝐼 × 2o)))𝑥) = (((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ++ 𝑥))
76	74, 56, 75	syl2anc 595	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥))(+g‘(freeMnd‘(𝐼 × 2o)))𝑥) = (((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ++ 𝑥))
77	17	eleq2d 2849	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → (𝑥 ∈ ( I ‘Word (𝐼 × 2o)) ↔ 𝑥 ∈ Word (𝐼 × 2o)))
78	77	biimpar 482	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → 𝑥 ∈ ( I ‘Word (𝐼 × 2o)))
79		eqid 2763	. . . . 5 ⊢ (𝑣 ∈ ( I ‘Word (𝐼 × 2o)) ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩)‘𝑤)”⟩⟩))) = (𝑣 ∈ ( I ‘Word (𝐼 × 2o)) ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩)‘𝑤)”⟩⟩)))
80	13, 3, 68, 79	efginvrel1 19802	. . . 4 ⊢ (𝑥 ∈ ( I ‘Word (𝐼 × 2o)) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ++ 𝑥) ∼ ∅)
81	78, 80	syl 18	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ++ 𝑥) ∼ ∅)
82	76, 81	eqbrtrd 5133	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2o)) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ ⟨𝑦, (1o ∖ 𝑧)⟩) ∘ (reverse‘𝑥))(+g‘(freeMnd‘(𝐼 × 2o)))𝑥) ∼ ∅)
83	4, 11, 12, 20, 21, 24, 35, 50, 52, 65, 72, 82	qusgrp2 19128	1 ⊢ (𝐼 ∈ 𝑉 → (𝐺 ∈ Grp ∧ [∅] ∼ = (0g‘𝐺)))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1103   = wceq 1570   ∈ wcel 2143  Vcvv 3455   ∖ cdif 3902  ∅c0 4286  ⟨cop 4595  ⟨cotp 4597   class class class wbr 5109   ↦ cmpt 5192   I cid 5555   × cxp 5659   ∘ ccom 5665  Oncon0 6360  ⟶wf 6532  ‘cfv 6536  (class class class)co 7410   ∈ cmpo 7412  1_oc1o 8442  2_oc2o 8443   Er wer 8687  [cec 8688  0cc0 11104  ...cfz 13539  ♯chash 14371  Word cword 14555   ++ cconcat 14612   splice csplice 14791  reversecreverse 14800  ⟨“cs2 14883  Basecbs 17273  +_gcplusg 17314  0_gc0g 17496  Mndcmnd 18796  freeMndcfrmd 18910  Grpcgrp 19004   ~_FG cefg 19780  freeGrpcfrgp 19781

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11160  ax-resscn 11161  ax-1cn 11162  ax-icn 11163  ax-addcl 11164  ax-addrcl 11165  ax-mulcl 11166  ax-mulrcl 11167  ax-mulcom 11168  ax-addass 11169  ax-mulass 11170  ax-distr 11171  ax-i2m1 11172  ax-1ne0 11173  ax-1rid 11174  ax-rnegex 11175  ax-rrecex 11176  ax-cnre 11177  ax-pre-lttri 11178  ax-pre-lttrn 11179  ax-pre-ltadd 11180  ax-pre-mulgt0 11181

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-tp 4594  df-op 4596  df-ot 4598  df-uni 4873  df-int 4913  df-iun 4958  df-iin 4959  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-2o 8450  df-er 8690  df-ec 8692  df-qs 8696  df-map 8822  df-en 8940  df-dom 8941  df-sdom 8942  df-fin 8943  df-sup 9398  df-inf 9399  df-card 9930  df-pnf 11249  df-mnf 11250  df-xr 11251  df-ltxr 11252  df-le 11253  df-sub 11447  df-neg 11448  df-nn 12238  df-2 12307  df-3 12308  df-4 12309  df-5 12310  df-6 12311  df-7 12312  df-8 12313  df-9 12314  df-n0 12509  df-xnn0 12582  df-z 12596  df-dec 12716  df-uz 12867  df-fz 13540  df-fzo 13688  df-hash 14372  df-word 14556  df-lsw 14605  df-concat 14613  df-s1 14639  df-substr 14684  df-pfx 14714  df-splice 14792  df-reverse 14801  df-s2 14890  df-struct 17211  df-slot 17246  df-ndx 17258  df-base 17274  df-plusg 17327  df-mulr 17328  df-sca 17330  df-vsca 17331  df-ip 17332  df-tset 17333  df-ple 17334  df-ds 17336  df-0g 17498  df-imas 17566  df-qus 17567  df-mgm 18702  df-sgrp 18781  df-mnd 18797  df-frmd 18912  df-grp 19007  df-efg 19783  df-frgp 19784

This theorem is used by:  frgpgrp  19836  frgpinv  19838  frgpmhm  19839