frgp0 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > frgp0		Structured version Visualization version GIF version

Theorem frgp0 19669

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 ∧ [∅] ∼ = (0_g‘𝐺)))

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 2732	. . 3 ⊢ (freeMnd‘(𝐼 × 2_o)) = (freeMnd‘(𝐼 × 2_o))
3		frgp0.r	. . 3 ⊢ ∼ = ( ~_FG ‘𝐼)
4	1, 2, 3	frgpval 19667	. 2 ⊢ (𝐼 ∈ 𝑉 → 𝐺 = ((freeMnd‘(𝐼 × 2_o)) /_s ∼ ))
5		2on 8482	. . . . 5 ⊢ 2_o ∈ On
6		xpexg 7739	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 2_o ∈ On) → (𝐼 × 2_o) ∈ V)
7	5, 6	mpan2 689	. . . 4 ⊢ (𝐼 ∈ 𝑉 → (𝐼 × 2_o) ∈ V)
8		eqid 2732	. . . . 5 ⊢ (Base‘(freeMnd‘(𝐼 × 2_o))) = (Base‘(freeMnd‘(𝐼 × 2_o)))
9	2, 8	frmdbas 18769	. . . 4 ⊢ ((𝐼 × 2_o) ∈ V → (Base‘(freeMnd‘(𝐼 × 2_o))) = Word (𝐼 × 2_o))
10	7, 9	syl 17	. . 3 ⊢ (𝐼 ∈ 𝑉 → (Base‘(freeMnd‘(𝐼 × 2_o))) = Word (𝐼 × 2_o))
11	10	eqcomd 2738	. 2 ⊢ (𝐼 ∈ 𝑉 → Word (𝐼 × 2_o) = (Base‘(freeMnd‘(𝐼 × 2_o))))
12		eqidd 2733	. 2 ⊢ (𝐼 ∈ 𝑉 → (+_g‘(freeMnd‘(𝐼 × 2_o))) = (+_g‘(freeMnd‘(𝐼 × 2_o))))
13		eqid 2732	. . . 4 ⊢ ( I ‘Word (𝐼 × 2_o)) = ( I ‘Word (𝐼 × 2_o))
14	13, 3	efger 19627	. . 3 ⊢ ∼ Er ( I ‘Word (𝐼 × 2_o))
15		wrdexg 14478	. . . . 5 ⊢ ((𝐼 × 2_o) ∈ V → Word (𝐼 × 2_o) ∈ V)
16		fvi 6967	. . . . 5 ⊢ (Word (𝐼 × 2_o) ∈ V → ( I ‘Word (𝐼 × 2_o)) = Word (𝐼 × 2_o))
17	7, 15, 16	3syl 18	. . . 4 ⊢ (𝐼 ∈ 𝑉 → ( I ‘Word (𝐼 × 2_o)) = Word (𝐼 × 2_o))
18		ereq2 8713	. . . 4 ⊢ (( I ‘Word (𝐼 × 2_o)) = Word (𝐼 × 2_o) → ( ∼ Er ( I ‘Word (𝐼 × 2_o)) ↔ ∼ Er Word (𝐼 × 2_o)))
19	17, 18	syl 17	. . 3 ⊢ (𝐼 ∈ 𝑉 → ( ∼ Er ( I ‘Word (𝐼 × 2_o)) ↔ ∼ Er Word (𝐼 × 2_o)))
20	14, 19	mpbii 232	. 2 ⊢ (𝐼 ∈ 𝑉 → ∼ Er Word (𝐼 × 2_o))
21		fvexd 6906	. 2 ⊢ (𝐼 ∈ 𝑉 → (freeMnd‘(𝐼 × 2_o)) ∈ V)
22		eqid 2732	. . . 4 ⊢ (+_g‘(freeMnd‘(𝐼 × 2_o))) = (+_g‘(freeMnd‘(𝐼 × 2_o)))
23	1, 2, 3, 22	frgpcpbl 19668	. . 3 ⊢ ((𝑎 ∼ 𝑏 ∧ 𝑐 ∼ 𝑑) → (𝑎(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑐) ∼ (𝑏(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑑))
24	23	a1i 11	. 2 ⊢ (𝐼 ∈ 𝑉 → ((𝑎 ∼ 𝑏 ∧ 𝑐 ∼ 𝑑) → (𝑎(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑐) ∼ (𝑏(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑑)))
25	2	frmdmnd 18776	. . . . . 6 ⊢ ((𝐼 × 2_o) ∈ V → (freeMnd‘(𝐼 × 2_o)) ∈ Mnd)
26	7, 25	syl 17	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → (freeMnd‘(𝐼 × 2_o)) ∈ Mnd)
27	26	3ad2ant1 1133	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o)) → (freeMnd‘(𝐼 × 2_o)) ∈ Mnd)
28		simp2 1137	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o)) → 𝑥 ∈ Word (𝐼 × 2_o))
29	11	3ad2ant1 1133	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o)) → Word (𝐼 × 2_o) = (Base‘(freeMnd‘(𝐼 × 2_o))))
30	28, 29	eleqtrd 2835	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o)) → 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
31		simp3 1138	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o)) → 𝑦 ∈ Word (𝐼 × 2_o))
32	31, 29	eleqtrd 2835	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o)) → 𝑦 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
33	8, 22	mndcl 18667	. . . 4 ⊢ (((freeMnd‘(𝐼 × 2_o)) ∈ Mnd ∧ 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))) ∧ 𝑦 ∈ (Base‘(freeMnd‘(𝐼 × 2_o)))) → (𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦) ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
34	27, 30, 32, 33	syl3anc 1371	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o)) → (𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦) ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
35	34, 29	eleqtrrd 2836	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o)) → (𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦) ∈ Word (𝐼 × 2_o))
36	20	adantr 481	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → ∼ Er Word (𝐼 × 2_o))
37	26	adantr 481	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → (freeMnd‘(𝐼 × 2_o)) ∈ Mnd)
38	34	3adant3r3 1184	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → (𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦) ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
39		simpr3 1196	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → 𝑧 ∈ Word (𝐼 × 2_o))
40	11	adantr 481	. . . . . . 7 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → Word (𝐼 × 2_o) = (Base‘(freeMnd‘(𝐼 × 2_o))))
41	39, 40	eleqtrd 2835	. . . . . 6 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → 𝑧 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
42	8, 22	mndcl 18667	. . . . . 6 ⊢ (((freeMnd‘(𝐼 × 2_o)) ∈ Mnd ∧ (𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦) ∈ (Base‘(freeMnd‘(𝐼 × 2_o))) ∧ 𝑧 ∈ (Base‘(freeMnd‘(𝐼 × 2_o)))) → ((𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦)(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧) ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
43	37, 38, 41, 42	syl3anc 1371	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → ((𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦)(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧) ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
44	43, 40	eleqtrrd 2836	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → ((𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦)(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧) ∈ Word (𝐼 × 2_o))
45	36, 44	erref 8725	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → ((𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦)(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧) ∼ ((𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦)(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧))
46	30	3adant3r3 1184	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
47	32	3adant3r3 1184	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → 𝑦 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
48	8, 22	mndass 18668	. . . 4 ⊢ (((freeMnd‘(𝐼 × 2_o)) ∈ Mnd ∧ (𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))) ∧ 𝑦 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))) ∧ 𝑧 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))) → ((𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦)(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧) = (𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))(𝑦(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧)))
49	37, 46, 47, 41, 48	syl13anc 1372	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → ((𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦)(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧) = (𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))(𝑦(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧)))
50	45, 49	breqtrd 5174	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ (𝑥 ∈ Word (𝐼 × 2_o) ∧ 𝑦 ∈ Word (𝐼 × 2_o) ∧ 𝑧 ∈ Word (𝐼 × 2_o))) → ((𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑦)(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧) ∼ (𝑥(+_g‘(freeMnd‘(𝐼 × 2_o)))(𝑦(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑧)))
51		wrd0 14493	. . 3 ⊢ ∅ ∈ Word (𝐼 × 2_o)
52	51	a1i 11	. 2 ⊢ (𝐼 ∈ 𝑉 → ∅ ∈ Word (𝐼 × 2_o))
53	51, 11	eleqtrid 2839	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → ∅ ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
54	53	adantr 481	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → ∅ ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
55	11	eleq2d 2819	. . . . . 6 ⊢ (𝐼 ∈ 𝑉 → (𝑥 ∈ Word (𝐼 × 2_o) ↔ 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2_o)))))
56	55	biimpa 477	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
57	2, 8, 22	frmdadd 18772	. . . . 5 ⊢ ((∅ ∈ (Base‘(freeMnd‘(𝐼 × 2_o))) ∧ 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2_o)))) → (∅(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑥) = (∅ ++ 𝑥))
58	54, 56, 57	syl2anc 584	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (∅(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑥) = (∅ ++ 𝑥))
59		ccatlid 14540	. . . . 5 ⊢ (𝑥 ∈ Word (𝐼 × 2_o) → (∅ ++ 𝑥) = 𝑥)
60	59	adantl 482	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (∅ ++ 𝑥) = 𝑥)
61	58, 60	eqtrd 2772	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (∅(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑥) = 𝑥)
62	20	adantr 481	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → ∼ Er Word (𝐼 × 2_o))
63		simpr 485	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → 𝑥 ∈ Word (𝐼 × 2_o))
64	62, 63	erref 8725	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → 𝑥 ∼ 𝑥)
65	61, 64	eqbrtrd 5170	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (∅(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑥) ∼ 𝑥)
66		revcl 14715	. . . 4 ⊢ (𝑥 ∈ Word (𝐼 × 2_o) → (reverse‘𝑥) ∈ Word (𝐼 × 2_o))
67	66	adantl 482	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (reverse‘𝑥) ∈ Word (𝐼 × 2_o))
68		eqid 2732	. . . . 5 ⊢ (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) = (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)
69	68	efgmf 19622	. . . 4 ⊢ (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩):(𝐼 × 2_o)⟶(𝐼 × 2_o)
70	69	a1i 11	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩):(𝐼 × 2_o)⟶(𝐼 × 2_o))
71		wrdco 14786	. . 3 ⊢ (((reverse‘𝑥) ∈ Word (𝐼 × 2_o) ∧ (𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩):(𝐼 × 2_o)⟶(𝐼 × 2_o)) → ((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ∈ Word (𝐼 × 2_o))
72	67, 70, 71	syl2anc 584	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → ((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ∈ Word (𝐼 × 2_o))
73	11	adantr 481	. . . . 5 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → Word (𝐼 × 2_o) = (Base‘(freeMnd‘(𝐼 × 2_o))))
74	72, 73	eleqtrd 2835	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → ((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ∈ (Base‘(freeMnd‘(𝐼 × 2_o))))
75	2, 8, 22	frmdadd 18772	. . . 4 ⊢ ((((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ∈ (Base‘(freeMnd‘(𝐼 × 2_o))) ∧ 𝑥 ∈ (Base‘(freeMnd‘(𝐼 × 2_o)))) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥))(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑥) = (((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ++ 𝑥))
76	74, 56, 75	syl2anc 584	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥))(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑥) = (((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ++ 𝑥))
77	17	eleq2d 2819	. . . . 5 ⊢ (𝐼 ∈ 𝑉 → (𝑥 ∈ ( I ‘Word (𝐼 × 2_o)) ↔ 𝑥 ∈ Word (𝐼 × 2_o)))
78	77	biimpar 478	. . . 4 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → 𝑥 ∈ ( I ‘Word (𝐼 × 2_o)))
79		eqid 2732	. . . . 5 ⊢ (𝑣 ∈ ( I ‘Word (𝐼 × 2_o)) ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)‘𝑤)”⟩⟩))) = (𝑣 ∈ ( I ‘Word (𝐼 × 2_o)) ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2_o) ↦ (𝑣 splice ⟨𝑛, 𝑛, ⟨“𝑤((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩)‘𝑤)”⟩⟩)))
80	13, 3, 68, 79	efginvrel1 19637	. . . 4 ⊢ (𝑥 ∈ ( I ‘Word (𝐼 × 2_o)) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ++ 𝑥) ∼ ∅)
81	78, 80	syl 17	. . 3 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥)) ++ 𝑥) ∼ ∅)
82	76, 81	eqbrtrd 5170	. 2 ⊢ ((𝐼 ∈ 𝑉 ∧ 𝑥 ∈ Word (𝐼 × 2_o)) → (((𝑦 ∈ 𝐼, 𝑧 ∈ 2_o ↦ ⟨𝑦, (1_o ∖ 𝑧)⟩) ∘ (reverse‘𝑥))(+_g‘(freeMnd‘(𝐼 × 2_o)))𝑥) ∼ ∅)
83	4, 11, 12, 20, 21, 24, 35, 50, 52, 65, 72, 82	qusgrp2 18977	1 ⊢ (𝐼 ∈ 𝑉 → (𝐺 ∈ Grp ∧ [∅] ∼ = (0_g‘𝐺)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 Vcvv 3474 ∖ cdif 3945 ∅c0 4322 ⟨cop 4634 ⟨cotp 4636 class class class wbr 5148 ↦ cmpt 5231 I cid 5573 × cxp 5674 ∘ ccom 5680 Oncon0 6364 ⟶wf 6539 ‘cfv 6543 (class class class)co 7411 ∈ cmpo 7413 1_oc1o 8461 2_oc2o 8462 Er wer 8702 [cec 8703 0cc0 11112 ...cfz 13488 ♯chash 14294 Word cword 14468 ++ cconcat 14524 splice csplice 14703 reversecreverse 14712 ⟨“cs2 14796 Basecbs 17148 +_gcplusg 17201 0_gc0g 17389 Mndcmnd 18659 freeMndcfrmd 18764 Grpcgrp 18855 ~_FG cefg 19615 freeGrpcfrgp 19616

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 2703 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7727 ax-cnex 11168 ax-resscn 11169 ax-1cn 11170 ax-icn 11171 ax-addcl 11172 ax-addrcl 11173 ax-mulcl 11174 ax-mulrcl 11175 ax-mulcom 11176 ax-addass 11177 ax-mulass 11178 ax-distr 11179 ax-i2m1 11180 ax-1ne0 11181 ax-1rid 11182 ax-rnegex 11183 ax-rrecex 11184 ax-cnre 11185 ax-pre-lttri 11186 ax-pre-lttrn 11187 ax-pre-ltadd 11188 ax-pre-mulgt0 11189

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 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-pss 3967 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-tp 4633 df-op 4635 df-ot 4637 df-uni 4909 df-int 4951 df-iun 4999 df-iin 5000 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5574 df-eprel 5580 df-po 5588 df-so 5589 df-fr 5631 df-we 5633 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-pred 6300 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7367 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7858 df-1st 7977 df-2nd 7978 df-frecs 8268 df-wrecs 8299 df-recs 8373 df-rdg 8412 df-1o 8468 df-2o 8469 df-er 8705 df-ec 8707 df-qs 8711 df-map 8824 df-en 8942 df-dom 8943 df-sdom 8944 df-fin 8945 df-sup 9439 df-inf 9440 df-card 9936 df-pnf 11254 df-mnf 11255 df-xr 11256 df-ltxr 11257 df-le 11258 df-sub 11450 df-neg 11451 df-nn 12217 df-2 12279 df-3 12280 df-4 12281 df-5 12282 df-6 12283 df-7 12284 df-8 12285 df-9 12286 df-n0 12477 df-xnn0 12549 df-z 12563 df-dec 12682 df-uz 12827 df-fz 13489 df-fzo 13632 df-hash 14295 df-word 14469 df-lsw 14517 df-concat 14525 df-s1 14550 df-substr 14595 df-pfx 14625 df-splice 14704 df-reverse 14713 df-s2 14803 df-struct 17084 df-slot 17119 df-ndx 17131 df-base 17149 df-plusg 17214 df-mulr 17215 df-sca 17217 df-vsca 17218 df-ip 17219 df-tset 17220 df-ple 17221 df-ds 17223 df-0g 17391 df-imas 17458 df-qus 17459 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-frmd 18766 df-grp 18858 df-efg 19618 df-frgp 19619

This theorem is referenced by: frgpgrp 19671 frgpinv 19673 frgpmhm 19674

W3C validator