| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > symgtrinv | Structured version Visualization version GIF version | ||
| Description: To invert a permutation represented as a sequence of transpositions, reverse the sequence. (Contributed by Stefan O'Rear, 27-Aug-2015.) |
| Ref | Expression |
|---|---|
| symgtrinv.t | ⊢ 𝑇 = ran (pmTrsp‘𝐷) |
| symgtrinv.g | ⊢ 𝐺 = (SymGrp‘𝐷) |
| symgtrinv.i | ⊢ 𝐼 = (invg‘𝐺) |
| Ref | Expression |
|---|---|
| symgtrinv | ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼‘(𝐺 Σg 𝑊)) = (𝐺 Σg (reverse‘𝑊))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | symgtrinv.g | . . . . 5 ⊢ 𝐺 = (SymGrp‘𝐷) | |
| 2 | 1 | symggrp 19366 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp) |
| 3 | eqid 2739 | . . . . 5 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 4 | symgtrinv.i | . . . . 5 ⊢ 𝐼 = (invg‘𝐺) | |
| 5 | 3, 4 | invoppggim 19326 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺))) |
| 6 | gimghm 19230 | . . . 4 ⊢ (𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺)) → 𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺))) | |
| 7 | ghmmhm 19192 | . . . 4 ⊢ (𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺)) → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) | |
| 8 | 2, 5, 6, 7 | 4syl 19 | . . 3 ⊢ (𝐷 ∈ 𝑉 → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) |
| 9 | symgtrinv.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 10 | eqid 2739 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 9, 1, 10 | symgtrf 19435 | . . . . 5 ⊢ 𝑇 ⊆ (Base‘𝐺) |
| 12 | sswrd 14475 | . . . . 5 ⊢ (𝑇 ⊆ (Base‘𝐺) → Word 𝑇 ⊆ Word (Base‘𝐺)) | |
| 13 | 11, 12 | ax-mp 5 | . . . 4 ⊢ Word 𝑇 ⊆ Word (Base‘𝐺) |
| 14 | 13 | sseli 3911 | . . 3 ⊢ (𝑊 ∈ Word 𝑇 → 𝑊 ∈ Word (Base‘𝐺)) |
| 15 | 10 | gsumwmhm 18804 | . . 3 ⊢ ((𝐼 ∈ (𝐺 MndHom (oppg‘𝐺)) ∧ 𝑊 ∈ Word (Base‘𝐺)) → (𝐼‘(𝐺 Σg 𝑊)) = ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊))) |
| 16 | 8, 14, 15 | syl2an 602 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼‘(𝐺 Σg 𝑊)) = ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊))) |
| 17 | 10, 4 | grpinvf 18953 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → 𝐼:(Base‘𝐺)⟶(Base‘𝐺)) |
| 18 | 2, 17 | syl 17 | . . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐼:(Base‘𝐺)⟶(Base‘𝐺)) |
| 19 | wrdf 14471 | . . . . . . . 8 ⊢ (𝑊 ∈ Word 𝑇 → 𝑊:(0..^(♯‘𝑊))⟶𝑇) | |
| 20 | 19 | adantl 482 | . . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊:(0..^(♯‘𝑊))⟶𝑇) |
| 21 | fss 6671 | . . . . . . 7 ⊢ ((𝑊:(0..^(♯‘𝑊))⟶𝑇 ∧ 𝑇 ⊆ (Base‘𝐺)) → 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) | |
| 22 | 20, 11, 21 | sylancl 592 | . . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) |
| 23 | fco 6679 | . . . . . 6 ⊢ ((𝐼:(Base‘𝐺)⟶(Base‘𝐺) ∧ 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) → (𝐼 ∘ 𝑊):(0..^(♯‘𝑊))⟶(Base‘𝐺)) | |
| 24 | 18, 22, 23 | syl2an2r 691 | . . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊):(0..^(♯‘𝑊))⟶(Base‘𝐺)) |
| 25 | 24 | ffnd 6656 | . . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊) Fn (0..^(♯‘𝑊))) |
| 26 | 20 | ffnd 6656 | . . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊 Fn (0..^(♯‘𝑊))) |
| 27 | fvco2 6924 | . . . . . 6 ⊢ ((𝑊 Fn (0..^(♯‘𝑊)) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝐼‘(𝑊‘𝑥))) | |
| 28 | 26, 27 | sylan 586 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝐼‘(𝑊‘𝑥))) |
| 29 | 20 | ffvelcdmda 7025 | . . . . . . 7 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝑊‘𝑥) ∈ 𝑇) |
| 30 | 11, 29 | sselid 3913 | . . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝑊‘𝑥) ∈ (Base‘𝐺)) |
| 31 | 1, 10, 4 | symginv 19368 | . . . . . 6 ⊢ ((𝑊‘𝑥) ∈ (Base‘𝐺) → (𝐼‘(𝑊‘𝑥)) = ◡(𝑊‘𝑥)) |
| 32 | 30, 31 | syl 17 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝐼‘(𝑊‘𝑥)) = ◡(𝑊‘𝑥)) |
| 33 | eqid 2739 | . . . . . . 7 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷) | |
| 34 | 33, 9 | pmtrfcnv 19430 | . . . . . 6 ⊢ ((𝑊‘𝑥) ∈ 𝑇 → ◡(𝑊‘𝑥) = (𝑊‘𝑥)) |
| 35 | 29, 34 | syl 17 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ◡(𝑊‘𝑥) = (𝑊‘𝑥)) |
| 36 | 28, 32, 35 | 3eqtrd 2778 | . . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝑊‘𝑥)) |
| 37 | 25, 26, 36 | eqfnfvd 6974 | . . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊) = 𝑊) |
| 38 | 37 | oveq2d 7372 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊)) = ((oppg‘𝐺) Σg 𝑊)) |
| 39 | 2 | grpmndd 18913 | . . 3 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd) |
| 40 | 10, 3 | gsumwrev 19332 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑊 ∈ Word (Base‘𝐺)) → ((oppg‘𝐺) Σg 𝑊) = (𝐺 Σg (reverse‘𝑊))) |
| 41 | 39, 14, 40 | syl2an 602 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → ((oppg‘𝐺) Σg 𝑊) = (𝐺 Σg (reverse‘𝑊))) |
| 42 | 16, 38, 41 | 3eqtrd 2778 | 1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼‘(𝐺 Σg 𝑊)) = (𝐺 Σg (reverse‘𝑊))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ⊆ wss 3883 ◡ccnv 5617 ran crn 5619 ∘ ccom 5622 Fn wfn 6480 ⟶wf 6481 ‘cfv 6485 (class class class)co 7356 0cc0 11029 ..^cfzo 13599 ♯chash 14283 Word cword 14466 reversecreverse 14711 Basecbs 17170 Σg cgsu 17394 Mndcmnd 18693 MndHom cmhm 18740 Grpcgrp 18900 invgcminusg 18901 GrpHom cghm 19178 GrpIso cgim 19223 oppgcoppg 19311 SymGrpcsymg 19335 pmTrspcpmtr 19407 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-tpos 8166 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8633 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-xnn0 12502 df-z 12516 df-uz 12780 df-fz 13453 df-fzo 13600 df-seq 13955 df-hash 14284 df-word 14467 df-lsw 14516 df-concat 14524 df-s1 14550 df-substr 14595 df-pfx 14625 df-reverse 14712 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-tset 17230 df-0g 17395 df-gsum 17396 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-mhm 18742 df-submnd 18743 df-efmnd 18828 df-grp 18903 df-minusg 18904 df-ghm 19179 df-gim 19225 df-oppg 19312 df-symg 19336 df-pmtr 19408 |
| This theorem is referenced by: psgnuni 19465 |
| Copyright terms: Public domain | W3C validator |