| 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 19480 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp) |
| 3 | eqid 2766 | . . . . 5 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 4 | symgtrinv.i | . . . . 5 ⊢ 𝐼 = (invg‘𝐺) | |
| 5 | 3, 4 | invoppggim 19440 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺))) |
| 6 | gimghm 19344 | . . . 4 ⊢ (𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺)) → 𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺))) | |
| 7 | ghmmhm 19306 | . . . 4 ⊢ (𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺)) → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) | |
| 8 | 2, 5, 6, 7 | 4syl 20 | . . 3 ⊢ (𝐷 ∈ 𝑉 → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) |
| 9 | symgtrinv.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 10 | eqid 2766 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 9, 1, 10 | symgtrf 19549 | . . . . 5 ⊢ 𝑇 ⊆ (Base‘𝐺) |
| 12 | sswrd 14570 | . . . . 5 ⊢ (𝑇 ⊆ (Base‘𝐺) → Word 𝑇 ⊆ Word (Base‘𝐺)) | |
| 13 | 11, 12 | ax-mp 5 | . . . 4 ⊢ Word 𝑇 ⊆ Word (Base‘𝐺) |
| 14 | 13 | sseli 3936 | . . 3 ⊢ (𝑊 ∈ Word 𝑇 → 𝑊 ∈ Word (Base‘𝐺)) |
| 15 | 10 | gsumwmhm 18914 | . . 3 ⊢ ((𝐼 ∈ (𝐺 MndHom (oppg‘𝐺)) ∧ 𝑊 ∈ Word (Base‘𝐺)) → (𝐼‘(𝐺 Σg 𝑊)) = ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊))) |
| 16 | 8, 14, 15 | syl2an 608 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼‘(𝐺 Σg 𝑊)) = ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊))) |
| 17 | 10, 4 | grpinvf 19063 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → 𝐼:(Base‘𝐺)⟶(Base‘𝐺)) |
| 18 | 2, 17 | syl 18 | . . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐼:(Base‘𝐺)⟶(Base‘𝐺)) |
| 19 | wrdf 14566 | . . . . . . . 8 ⊢ (𝑊 ∈ Word 𝑇 → 𝑊:(0..^(♯‘𝑊))⟶𝑇) | |
| 20 | 19 | adantl 487 | . . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊:(0..^(♯‘𝑊))⟶𝑇) |
| 21 | fss 6726 | . . . . . . 7 ⊢ ((𝑊:(0..^(♯‘𝑊))⟶𝑇 ∧ 𝑇 ⊆ (Base‘𝐺)) → 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) | |
| 22 | 20, 11, 21 | sylancl 598 | . . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) |
| 23 | fco 6734 | . . . . . 6 ⊢ ((𝐼:(Base‘𝐺)⟶(Base‘𝐺) ∧ 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) → (𝐼 ∘ 𝑊):(0..^(♯‘𝑊))⟶(Base‘𝐺)) | |
| 24 | 18, 22, 23 | syl2an2r 698 | . . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊):(0..^(♯‘𝑊))⟶(Base‘𝐺)) |
| 25 | 24 | ffnd 6710 | . . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊) Fn (0..^(♯‘𝑊))) |
| 26 | 20 | ffnd 6710 | . . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊 Fn (0..^(♯‘𝑊))) |
| 27 | fvco2 6982 | . . . . . 6 ⊢ ((𝑊 Fn (0..^(♯‘𝑊)) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝐼‘(𝑊‘𝑥))) | |
| 28 | 26, 27 | sylan 592 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝐼‘(𝑊‘𝑥))) |
| 29 | 20 | ffvelcdmda 7083 | . . . . . . 7 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝑊‘𝑥) ∈ 𝑇) |
| 30 | 11, 29 | sselid 3938 | . . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝑊‘𝑥) ∈ (Base‘𝐺)) |
| 31 | 1, 10, 4 | symginv 19482 | . . . . . 6 ⊢ ((𝑊‘𝑥) ∈ (Base‘𝐺) → (𝐼‘(𝑊‘𝑥)) = ◡(𝑊‘𝑥)) |
| 32 | 30, 31 | syl 18 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝐼‘(𝑊‘𝑥)) = ◡(𝑊‘𝑥)) |
| 33 | eqid 2766 | . . . . . . 7 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷) | |
| 34 | 33, 9 | pmtrfcnv 19544 | . . . . . 6 ⊢ ((𝑊‘𝑥) ∈ 𝑇 → ◡(𝑊‘𝑥) = (𝑊‘𝑥)) |
| 35 | 29, 34 | syl 18 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ◡(𝑊‘𝑥) = (𝑊‘𝑥)) |
| 36 | 28, 32, 35 | 3eqtrd 2805 | . . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝑊‘𝑥)) |
| 37 | 25, 26, 36 | eqfnfvd 7032 | . . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊) = 𝑊) |
| 38 | 37 | oveq2d 7432 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊)) = ((oppg‘𝐺) Σg 𝑊)) |
| 39 | 2 | grpmndd 19023 | . . 3 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd) |
| 40 | 10, 3 | gsumwrev 19446 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑊 ∈ Word (Base‘𝐺)) → ((oppg‘𝐺) Σg 𝑊) = (𝐺 Σg (reverse‘𝑊))) |
| 41 | 39, 14, 40 | syl2an 608 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → ((oppg‘𝐺) Σg 𝑊) = (𝐺 Σg (reverse‘𝑊))) |
| 42 | 16, 38, 41 | 3eqtrd 2805 | 1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼‘(𝐺 Σg 𝑊)) = (𝐺 Σg (reverse‘𝑊))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ⊆ wss 3908 ◡ccnv 5663 ran crn 5665 ∘ ccom 5668 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 0cc0 11110 ..^cfzo 13693 ♯chash 14377 Word cword 14561 reversecreverse 14806 Basecbs 17279 Σg cgsu 17503 Mndcmnd 18802 MndHom cmhm 18849 Grpcgrp 19010 invgcminusg 19011 GrpHom cghm 19293 GrpIso cgim 19337 oppgcoppg 19425 SymGrpcsymg 19449 pmTrspcpmtr 19521 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2738 ax-rep 5241 ax-sep 5260 ax-nul 5272 ax-pow 5339 ax-pr 5407 ax-un 7738 ax-cnex 11166 ax-resscn 11167 ax-1cn 11168 ax-icn 11169 ax-addcl 11170 ax-addrcl 11171 ax-mulcl 11172 ax-mulrcl 11173 ax-mulcom 11174 ax-addass 11175 ax-mulass 11176 ax-distr 11177 ax-i2m1 11178 ax-1ne0 11179 ax-1rid 11180 ax-rnegex 11181 ax-rrecex 11182 ax-cnre 11183 ax-pre-lttri 11184 ax-pre-lttrn 11185 ax-pre-ltadd 11186 ax-pre-mulgt0 11187 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2841 df-nfc 2915 df-ne 2962 df-nel 3068 df-ral 3083 df-rex 3093 df-rmo 3372 df-reu 3373 df-rab 3420 df-v 3460 df-sbc 3748 df-csb 3857 df-dif 3911 df-un 3913 df-in 3915 df-ss 3925 df-pss 3928 df-nul 4290 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-tp 4597 df-op 4599 df-uni 4876 df-int 4916 df-iun 4961 df-br 5113 df-opab 5177 df-mpt 5196 df-tr 5222 df-id 5559 df-eprel 5564 df-po 5572 df-so 5573 df-fr 5617 df-we 5619 df-xp 5670 df-rel 5671 df-cnv 5672 df-co 5673 df-dm 5674 df-rn 5675 df-res 5676 df-ima 5677 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-tpos 8224 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-1o 8455 df-2o 8456 df-er 8696 df-map 8828 df-en 8946 df-dom 8947 df-sdom 8948 df-fin 8949 df-card 9936 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-sub 11453 df-neg 11454 df-nn 12244 df-2 12313 df-3 12314 df-4 12315 df-5 12316 df-6 12317 df-7 12318 df-8 12319 df-9 12320 df-n0 12515 df-xnn0 12588 df-z 12602 df-uz 12873 df-fz 13546 df-fzo 13694 df-seq 14049 df-hash 14378 df-word 14562 df-lsw 14611 df-concat 14619 df-s1 14645 df-substr 14690 df-pfx 14720 df-reverse 14807 df-struct 17217 df-sets 17234 df-slot 17252 df-ndx 17264 df-base 17280 df-ress 17301 df-plusg 17333 df-tset 17339 df-0g 17504 df-gsum 17505 df-mgm 18708 df-sgrp 18787 df-mnd 18803 df-mhm 18851 df-submnd 18852 df-efmnd 18938 df-grp 19013 df-minusg 19014 df-ghm 19294 df-gim 19339 df-oppg 19426 df-symg 19450 df-pmtr 19522 |
| This theorem is used by: psgnuni 19579 |
| Copyright terms: Public domain | W3C validator |