![]() |
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 6986 | . . . . . . . . 9 ⊢ ( I ‘Word (𝐼 × 2o)) ⊆ Word (𝐼 × 2o) | |
3 | 1, 2 | eqsstri 4030 | . . . . . . . 8 ⊢ 𝑊 ⊆ Word (𝐼 × 2o) |
4 | 3 | sseli 3991 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑊 → 𝐴 ∈ Word (𝐼 × 2o)) |
5 | revcl 14796 | . . . . . . 7 ⊢ (𝐴 ∈ Word (𝐼 × 2o) → (reverse‘𝐴) ∈ Word (𝐼 × 2o)) | |
6 | 4, 5 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ 𝑊 → (reverse‘𝐴) ∈ Word (𝐼 × 2o)) |
7 | frgpinv.m | . . . . . . 7 ⊢ 𝑀 = (𝑦 ∈ 𝐼, 𝑧 ∈ 2o ↦ 〈𝑦, (1o ∖ 𝑧)〉) | |
8 | 7 | efgmf 19746 | . . . . . 6 ⊢ 𝑀:(𝐼 × 2o)⟶(𝐼 × 2o) |
9 | wrdco 14867 | . . . . . 6 ⊢ (((reverse‘𝐴) ∈ Word (𝐼 × 2o) ∧ 𝑀:(𝐼 × 2o)⟶(𝐼 × 2o)) → (𝑀 ∘ (reverse‘𝐴)) ∈ Word (𝐼 × 2o)) | |
10 | 6, 8, 9 | sylancl 586 | . . . . 5 ⊢ (𝐴 ∈ 𝑊 → (𝑀 ∘ (reverse‘𝐴)) ∈ Word (𝐼 × 2o)) |
11 | 1 | efgrcl 19748 | . . . . . 6 ⊢ (𝐴 ∈ 𝑊 → (𝐼 ∈ V ∧ 𝑊 = Word (𝐼 × 2o))) |
12 | 11 | simprd 495 | . . . . 5 ⊢ (𝐴 ∈ 𝑊 → 𝑊 = Word (𝐼 × 2o)) |
13 | 10, 12 | eleqtrrd 2842 | . . . 4 ⊢ (𝐴 ∈ 𝑊 → (𝑀 ∘ (reverse‘𝐴)) ∈ 𝑊) |
14 | frgpadd.g | . . . . 5 ⊢ 𝐺 = (freeGrp‘𝐼) | |
15 | frgpadd.r | . . . . 5 ⊢ ∼ = ( ~FG ‘𝐼) | |
16 | eqid 2735 | . . . . 5 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
17 | 1, 14, 15, 16 | frgpadd 19796 | . . . 4 ⊢ ((𝐴 ∈ 𝑊 ∧ (𝑀 ∘ (reverse‘𝐴)) ∈ 𝑊) → ([𝐴] ∼ (+g‘𝐺)[(𝑀 ∘ (reverse‘𝐴))] ∼ ) = [(𝐴 ++ (𝑀 ∘ (reverse‘𝐴)))] ∼ ) |
18 | 13, 17 | mpdan 687 | . . 3 ⊢ (𝐴 ∈ 𝑊 → ([𝐴] ∼ (+g‘𝐺)[(𝑀 ∘ (reverse‘𝐴))] ∼ ) = [(𝐴 ++ (𝑀 ∘ (reverse‘𝐴)))] ∼ ) |
19 | 1, 15 | efger 19751 | . . . . 5 ⊢ ∼ Er 𝑊 |
20 | 19 | a1i 11 | . . . 4 ⊢ (𝐴 ∈ 𝑊 → ∼ Er 𝑊) |
21 | eqid 2735 | . . . . 5 ⊢ (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) = (𝑣 ∈ 𝑊 ↦ (𝑛 ∈ (0...(♯‘𝑣)), 𝑤 ∈ (𝐼 × 2o) ↦ (𝑣 splice 〈𝑛, 𝑛, 〈“𝑤(𝑀‘𝑤)”〉〉))) | |
22 | 1, 15, 7, 21 | efginvrel2 19760 | . . . 4 ⊢ (𝐴 ∈ 𝑊 → (𝐴 ++ (𝑀 ∘ (reverse‘𝐴))) ∼ ∅) |
23 | 20, 22 | erthi 8797 | . . 3 ⊢ (𝐴 ∈ 𝑊 → [(𝐴 ++ (𝑀 ∘ (reverse‘𝐴)))] ∼ = [∅] ∼ ) |
24 | 14, 15 | frgp0 19793 | . . . . . 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 2779 | . 2 ⊢ (𝐴 ∈ 𝑊 → ([𝐴] ∼ (+g‘𝐺)[(𝑀 ∘ (reverse‘𝐴))] ∼ ) = (0g‘𝐺)) |
29 | 26 | simpld 494 | . . 3 ⊢ (𝐴 ∈ 𝑊 → 𝐺 ∈ Grp) |
30 | eqid 2735 | . . . 4 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
31 | 14, 15, 1, 30 | frgpeccl 19794 | . . 3 ⊢ (𝐴 ∈ 𝑊 → [𝐴] ∼ ∈ (Base‘𝐺)) |
32 | 14, 15, 1, 30 | frgpeccl 19794 | . . . 4 ⊢ ((𝑀 ∘ (reverse‘𝐴)) ∈ 𝑊 → [(𝑀 ∘ (reverse‘𝐴))] ∼ ∈ (Base‘𝐺)) |
33 | 13, 32 | syl 17 | . . 3 ⊢ (𝐴 ∈ 𝑊 → [(𝑀 ∘ (reverse‘𝐴))] ∼ ∈ (Base‘𝐺)) |
34 | eqid 2735 | . . . 4 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
35 | frgpinv.n | . . . 4 ⊢ 𝑁 = (invg‘𝐺) | |
36 | 30, 16, 34, 35 | grpinvid1 19022 | . . 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 206 ∧ wa 395 = wceq 1537 ∈ wcel 2106 Vcvv 3478 ∖ cdif 3960 ∅c0 4339 〈cop 4637 〈cotp 4639 ↦ cmpt 5231 I cid 5582 × cxp 5687 ∘ ccom 5693 ⟶wf 6559 ‘cfv 6563 (class class class)co 7431 ∈ cmpo 7433 1oc1o 8498 2oc2o 8499 Er wer 8741 [cec 8742 0cc0 11153 ...cfz 13544 ♯chash 14366 Word cword 14549 ++ cconcat 14605 splice csplice 14784 reversecreverse 14793 〈“cs2 14877 Basecbs 17245 +gcplusg 17298 0gc0g 17486 Grpcgrp 18964 invgcminusg 18965 ~FG cefg 19739 freeGrpcfrgp 19740 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-tp 4636 df-op 4638 df-ot 4640 df-uni 4913 df-int 4952 df-iun 4998 df-iin 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-2o 8506 df-er 8744 df-ec 8746 df-qs 8750 df-map 8867 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-sup 9480 df-inf 9481 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-9 12334 df-n0 12525 df-xnn0 12598 df-z 12612 df-dec 12732 df-uz 12877 df-fz 13545 df-fzo 13692 df-hash 14367 df-word 14550 df-lsw 14598 df-concat 14606 df-s1 14631 df-substr 14676 df-pfx 14706 df-splice 14785 df-reverse 14794 df-s2 14884 df-struct 17181 df-slot 17216 df-ndx 17228 df-base 17246 df-plusg 17311 df-mulr 17312 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-0g 17488 df-imas 17555 df-qus 17556 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-frmd 18875 df-grp 18967 df-minusg 18968 df-efg 19742 df-frgp 19743 |
This theorem is referenced by: vrgpinv 19802 |
Copyright terms: Public domain | W3C validator |