![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > frgpinv | Structured version Visualization version GIF version |
Description: The inverse of an element of the free group. (Contributed by Mario Carneiro, 2-Oct-2015.) |
Ref | Expression |
---|---|
frgpadd.w | ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) |
frgpadd.g | ⊢ 𝐺 = (freeGrp‘𝐼) |
frgpadd.r | ⊢ ∼ = ( ~FG ‘𝐼) |
frgpinv.n | ⊢ 𝑁 = (invg‘𝐺) |
frgpinv.m | ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) |
Ref | Expression |
---|---|
frgpinv | ⊢ (𝐴 ∈ 𝑊 → (𝑁‘[𝐴] ∼ ) = [(𝑀 ∘ (reverse‘𝐴))] ∼ ) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | frgpadd.w | . . . . . . . . 9 ⊢ 𝑊 = ( I ‘Word (𝐼 × 2o)) | |
2 | fviss 6968 | . . . . . . . . 9 ⊢ ( I ‘Word (𝐼 × 2o)) ⊆ Word (𝐼 × 2o) | |
3 | 1, 2 | eqsstri 4016 | . . . . . . . 8 ⊢ 𝑊 ⊆ Word (𝐼 × 2o) |
4 | 3 | sseli 3978 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ Word (𝐼 × 2o)) |
5 | revcl 14718 | . . . . . . 7 ⊢ (𝐴 ∈ Word (𝐼 × 2o) → (reverse‘𝐴) ∈ Word (𝐼 × 2o)) | |
6 | 4, 5 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ 𝑊 → (reverse‘𝐴) ∈ Word (𝐼 × 2o)) |
7 | frgpinv.m | . . . . . . 7 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) | |
8 | 7 | efgmf 19629 | . . . . . 6 ⊢ 𝑀:(𝐼 × 2o)⟶(𝐼 × 2o) |
9 | wrdco 14789 | . . . . . 6 ⊢ (((reverse‘𝐴) ∈ Word (𝐼 × 2o) ∧ 𝑀:(𝐼 × 2o)⟶(𝐼 × 2o)) → (𝑀 ∘ (reverse‘𝐴)) ∈ Word (𝐼 × 2o)) | |
10 | 6, 8, 9 | sylancl 585 | . . . . 5 ⊢ (𝐴 ∈ 𝑊 → (𝑀 ∘ (reverse‘𝐴)) ∈ Word (𝐼 × 2o)) |
11 | 1 | efgrcl 19631 | . . . . . 6 ⊢ (𝐴 ∈ 𝑊 → (𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2o))) |
12 | 11 | simprd 495 | . . . . 5 ⊢ (𝐴 ∈ 𝑊 → 𝑊 = Word (𝐼 × 2o)) |
13 | 10, 12 | eleqtrrd 2835 | . . . 4 ⊢ (𝐴 ∈ 𝑊 → (𝑀 ∘ (reverse‘𝐴)) ∈ 𝑊) |
14 | frgpadd.g | . . . . 5 ⊢ 𝐺 = (freeGrp‘𝐼) | |
15 | frgpadd.r | . . . . 5 ⊢ ∼ = ( ~FG ‘𝐼) | |
16 | eqid 2731 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
17 | 1, 14, 15, 16 | frgpadd 19679 | . . . 4 ⊢ ((𝐴 ∈ 𝑊 ∧ (𝑀 ∘ (reverse‘𝐴)) ∈ 𝑊) → ([𝐴] ∼ (+g‘𝐺)[(𝑀 ∘ (reverse‘𝐴))] ∼ ) = [(𝐴 ++ (𝑀 ∘ (reverse‘𝐴)))] ∼ ) |
18 | 13, 17 | mpdan 684 | . . 3 ⊢ (𝐴 ∈ 𝑊 → ([𝐴] ∼ (+g‘𝐺)[(𝑀 ∘ (reverse‘𝐴))] ∼ ) = [(𝐴 ++ (𝑀 ∘ (reverse‘𝐴)))] ∼ ) |
19 | 1, 15 | efger 19634 | . . . . 5 ⊢ ∼ Er 𝑊 |
20 | 19 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ 𝑊 → ∼ Er 𝑊) |
21 | eqid 2731 | . . . . 5 ⊢ (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) | |
22 | 1, 15, 7, 21 | efginvrel2 19643 | . . . 4 ⊢ (𝐴 ∈ 𝑊 → (𝐴 ++ (𝑀 ∘ (reverse‘𝐴))) ∼ ∅) |
23 | 20, 22 | erthi 8760 | . . 3 ⊢ (𝐴 ∈ 𝑊 → [(𝐴 ++ (𝑀 ∘ (reverse‘𝐴)))] ∼ = [∅] ∼ ) |
24 | 14, 15 | frgp0 19676 | . . . . . 6 ⊢ (𝐼 ∈ V → (𝐺 ∈ Grp ∧ [∅] ∼ = (0g‘𝐺))) |
25 | 24 | adantr 480 | . . . . 5 ⊢ ((𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2o)) → (𝐺 ∈ Grp ∧ [∅] ∼ = (0g‘𝐺))) |
26 | 11, 25 | syl 17 | . . . 4 ⊢ (𝐴 ∈ 𝑊 → (𝐺 ∈ Grp ∧ [∅] ∼ = (0g‘𝐺))) |
27 | 26 | simprd 495 | . . 3 ⊢ (𝐴 ∈ 𝑊 → [∅] ∼ = (0g‘𝐺)) |
28 | 18, 23, 27 | 3eqtrd 2775 | . 2 ⊢ (𝐴 ∈ 𝑊 → ([𝐴] ∼ (+g‘𝐺)[(𝑀 ∘ (reverse‘𝐴))] ∼ ) = (0g‘𝐺)) |
29 | 26 | simpld 494 | . . 3 ⊢ (𝐴 ∈ 𝑊 → 𝐺 ∈ Grp) |
30 | eqid 2731 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
31 | 14, 15, 1, 30 | frgpeccl 19677 | . . 3 ⊢ (𝐴 ∈ 𝑊 → [𝐴] ∼ ∈ (Base‘𝐺)) |
32 | 14, 15, 1, 30 | frgpeccl 19677 | . . . 4 ⊢ ((𝑀 ∘ (reverse‘𝐴)) ∈ 𝑊 → [(𝑀 ∘ (reverse‘𝐴))] ∼ ∈ (Base‘𝐺)) |
33 | 13, 32 | syl 17 | . . 3 ⊢ (𝐴 ∈ 𝑊 → [(𝑀 ∘ (reverse‘𝐴))] ∼ ∈ (Base‘𝐺)) |
34 | eqid 2731 | . . . 4 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
35 | frgpinv.n | . . . 4 ⊢ 𝑁 = (invg‘𝐺) | |
36 | 30, 16, 34, 35 | grpinvid1 18919 | . . 3 ⊢ ((𝐺 ∈ Grp ∧ [𝐴] ∼ ∈ (Base‘𝐺) ∧ [(𝑀 ∘ (reverse‘𝐴))] ∼ ∈ (Base‘𝐺)) → ((𝑁‘[𝐴] ∼ ) = [(𝑀 ∘ (reverse‘𝐴))] ∼ ↔ ([𝐴] ∼ (+g‘𝐺)[(𝑀 ∘ (reverse‘𝐴))] ∼ ) = (0g‘𝐺))) |
37 | 29, 31, 33, 36 | syl3anc 1370 | . 2 ⊢ (𝐴 ∈ 𝑊 → ((𝑁‘[𝐴] ∼ ) = [(𝑀 ∘ (reverse‘𝐴))] ∼ ↔ ([𝐴] ∼ (+g‘𝐺)[(𝑀 ∘ (reverse‘𝐴))] ∼ ) = (0g‘𝐺))) |
38 | 28, 37 | mpbird 257 | 1 ⊢ (𝐴 ∈ 𝑊 → (𝑁‘[𝐴] ∼ ) = [(𝑀 ∘ (reverse‘𝐴))] ∼ ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1540 ∈ wcel 2105 Vcvv 3473 ∖ cdif 3945 ∅c0 4322 〈cop 4634 〈cotp 4636 ↦ cmpt 5231 I cid 5573 × cxp 5674 ∘ ccom 5680 ⟶wf 6539 ‘cfv 6543 (class class class)co 7412 ∈ cmpo 7414 1oc1o 8465 2oc2o 8466 Er wer 8706 [cec 8707 0cc0 11116 ...cfz 13491 ♯chash 14297 Word cword 14471 ++ cconcat 14527 splice csplice 14706 reversecreverse 14715 〈“cs2 14799 Basecbs 17151 +gcplusg 17204 0gc0g 17392 Grpcgrp 18861 invgcminusg 18862 ~FG cefg 19622 freeGrpcfrgp 19623 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-cnex 11172 ax-resscn 11173 ax-1cn 11174 ax-icn 11175 ax-addcl 11176 ax-addrcl 11177 ax-mulcl 11178 ax-mulrcl 11179 ax-mulcom 11180 ax-addass 11181 ax-mulass 11182 ax-distr 11183 ax-i2m1 11184 ax-1ne0 11185 ax-1rid 11186 ax-rnegex 11187 ax-rrecex 11188 ax-cnre 11189 ax-pre-lttri 11190 ax-pre-lttrn 11191 ax-pre-ltadd 11192 ax-pre-mulgt0 11193 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3375 df-reu 3376 df-rab 3432 df-v 3475 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 7368 df-ov 7415 df-oprab 7416 df-mpo 7417 df-om 7860 df-1st 7979 df-2nd 7980 df-frecs 8272 df-wrecs 8303 df-recs 8377 df-rdg 8416 df-1o 8472 df-2o 8473 df-er 8709 df-ec 8711 df-qs 8715 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-sup 9443 df-inf 9444 df-card 9940 df-pnf 11257 df-mnf 11258 df-xr 11259 df-ltxr 11260 df-le 11261 df-sub 11453 df-neg 11454 df-nn 12220 df-2 12282 df-3 12283 df-4 12284 df-5 12285 df-6 12286 df-7 12287 df-8 12288 df-9 12289 df-n0 12480 df-xnn0 12552 df-z 12566 df-dec 12685 df-uz 12830 df-fz 13492 df-fzo 13635 df-hash 14298 df-word 14472 df-lsw 14520 df-concat 14528 df-s1 14553 df-substr 14598 df-pfx 14628 df-splice 14707 df-reverse 14716 df-s2 14806 df-struct 17087 df-slot 17122 df-ndx 17134 df-base 17152 df-plusg 17217 df-mulr 17218 df-sca 17220 df-vsca 17221 df-ip 17222 df-tset 17223 df-ple 17224 df-ds 17226 df-0g 17394 df-imas 17461 df-qus 17462 df-mgm 18571 df-sgrp 18650 df-mnd 18666 df-frmd 18772 df-grp 18864 df-minusg 18865 df-efg 19625 df-frgp 19626 |
This theorem is referenced by: vrgpinv 19685 |
Copyright terms: Public domain | W3C validator |