| 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 19469 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp) |
| 3 | eqid 2769 | . . . . 5 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 4 | symgtrinv.i | . . . . 5 ⊢ 𝐼 = (invg‘𝐺) | |
| 5 | 3, 4 | invoppggim 19429 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺))) |
| 6 | gimghm 19333 | . . . 4 ⊢ (𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺)) → 𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺))) | |
| 7 | ghmmhm 19295 | . . . 4 ⊢ (𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺)) → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) | |
| 8 | 2, 5, 6, 7 | 4syl 20 | . . 3 ⊢ (𝐷 ∈ 𝑉 → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) |
| 9 | symgtrinv.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 10 | eqid 2769 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 9, 1, 10 | symgtrf 19538 | . . . . 5 ⊢ 𝑇 ⊆ (Base‘𝐺) |
| 12 | sswrd 14558 | . . . . 5 ⊢ (𝑇 ⊆ (Base‘𝐺) → Word 𝑇 ⊆ Word (Base‘𝐺)) | |
| 13 | 11, 12 | ax-mp 5 | . . . 4 ⊢ Word 𝑇 ⊆ Word (Base‘𝐺) |
| 14 | 13 | sseli 3941 | . . 3 ⊢ (𝑊 ∈ Word 𝑇 → 𝑊 ∈ Word (Base‘𝐺)) |
| 15 | 10 | gsumwmhm 18903 | . . 3 ⊢ ((𝐼 ∈ (𝐺 MndHom (oppg‘𝐺)) ∧ 𝑊 ∈ Word (Base‘𝐺)) → (𝐼‘(𝐺 Σg 𝑊)) = ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊))) |
| 16 | 8, 14, 15 | syl2an 607 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼‘(𝐺 Σg 𝑊)) = ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊))) |
| 17 | 10, 4 | grpinvf 19052 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → 𝐼:(Base‘𝐺)⟶(Base‘𝐺)) |
| 18 | 2, 17 | syl 18 | . . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐼:(Base‘𝐺)⟶(Base‘𝐺)) |
| 19 | wrdf 14554 | . . . . . . . 8 ⊢ (𝑊 ∈ Word 𝑇 → 𝑊:(0..^(♯‘𝑊))⟶𝑇) | |
| 20 | 19 | adantl 486 | . . . . . . 7 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊:(0..^(♯‘𝑊))⟶𝑇) |
| 21 | fss 6723 | . . . . . . 7 ⊢ ((𝑊:(0..^(♯‘𝑊))⟶𝑇 ∧ 𝑇 ⊆ (Base‘𝐺)) → 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) | |
| 22 | 20, 11, 21 | sylancl 597 | . . . . . 6 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) |
| 23 | fco 6731 | . . . . . 6 ⊢ ((𝐼:(Base‘𝐺)⟶(Base‘𝐺) ∧ 𝑊:(0..^(♯‘𝑊))⟶(Base‘𝐺)) → (𝐼 ∘ 𝑊):(0..^(♯‘𝑊))⟶(Base‘𝐺)) | |
| 24 | 18, 22, 23 | syl2an2r 697 | . . . . 5 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊):(0..^(♯‘𝑊))⟶(Base‘𝐺)) |
| 25 | 24 | ffnd 6707 | . . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊) Fn (0..^(♯‘𝑊))) |
| 26 | 20 | ffnd 6707 | . . . 4 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → 𝑊 Fn (0..^(♯‘𝑊))) |
| 27 | fvco2 6979 | . . . . . 6 ⊢ ((𝑊 Fn (0..^(♯‘𝑊)) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝐼‘(𝑊‘𝑥))) | |
| 28 | 26, 27 | sylan 591 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝐼‘(𝑊‘𝑥))) |
| 29 | 20 | ffvelcdmda 7080 | . . . . . . 7 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝑊‘𝑥) ∈ 𝑇) |
| 30 | 11, 29 | sselid 3943 | . . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝑊‘𝑥) ∈ (Base‘𝐺)) |
| 31 | 1, 10, 4 | symginv 19471 | . . . . . 6 ⊢ ((𝑊‘𝑥) ∈ (Base‘𝐺) → (𝐼‘(𝑊‘𝑥)) = ◡(𝑊‘𝑥)) |
| 32 | 30, 31 | syl 18 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝐼‘(𝑊‘𝑥)) = ◡(𝑊‘𝑥)) |
| 33 | eqid 2769 | . . . . . . 7 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷) | |
| 34 | 33, 9 | pmtrfcnv 19533 | . . . . . 6 ⊢ ((𝑊‘𝑥) ∈ 𝑇 → ◡(𝑊‘𝑥) = (𝑊‘𝑥)) |
| 35 | 29, 34 | syl 18 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ◡(𝑊‘𝑥) = (𝑊‘𝑥)) |
| 36 | 28, 32, 35 | 3eqtrd 2808 | . . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝑊‘𝑥)) |
| 37 | 25, 26, 36 | eqfnfvd 7029 | . . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊) = 𝑊) |
| 38 | 37 | oveq2d 7427 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊)) = ((oppg‘𝐺) Σg 𝑊)) |
| 39 | 2 | grpmndd 19012 | . . 3 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd) |
| 40 | 10, 3 | gsumwrev 19435 | . . 3 ⊢ ((𝐺 ∈ Mnd ∧ 𝑊 ∈ Word (Base‘𝐺)) → ((oppg‘𝐺) Σg 𝑊) = (𝐺 Σg (reverse‘𝑊))) |
| 41 | 39, 14, 40 | syl2an 607 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → ((oppg‘𝐺) Σg 𝑊) = (𝐺 Σg (reverse‘𝑊))) |
| 42 | 16, 38, 41 | 3eqtrd 2808 | 1 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼‘(𝐺 Σg 𝑊)) = (𝐺 Σg (reverse‘𝑊))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 = wceq 1567 ∈ wcel 2149 ⊆ wss 3913 ◡ccnv 5661 ran crn 5663 ∘ ccom 5666 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 (class class class)co 7411 0cc0 11099 ..^cfzo 13681 ♯chash 14365 Word cword 14549 reversecreverse 14794 Basecbs 17268 Σg cgsu 17492 Mndcmnd 18791 MndHom cmhm 18838 Grpcgrp 18999 invgcminusg 19000 GrpHom cghm 19282 GrpIso cgim 19326 oppgcoppg 19414 SymGrpcsymg 19438 pmTrspcpmtr 19510 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-int 4917 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-tpos 8221 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-map 8825 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-card 9924 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-3 12303 df-4 12304 df-5 12305 df-6 12306 df-7 12307 df-8 12308 df-9 12309 df-n0 12504 df-xnn0 12577 df-z 12591 df-uz 12862 df-fz 13535 df-fzo 13682 df-seq 14037 df-hash 14366 df-word 14550 df-lsw 14599 df-concat 14607 df-s1 14633 df-substr 14678 df-pfx 14708 df-reverse 14795 df-struct 17206 df-sets 17223 df-slot 17241 df-ndx 17253 df-base 17269 df-ress 17290 df-plusg 17322 df-tset 17328 df-0g 17493 df-gsum 17494 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-mhm 18840 df-submnd 18841 df-efmnd 18927 df-grp 19002 df-minusg 19003 df-ghm 19283 df-gim 19328 df-oppg 19415 df-symg 19439 df-pmtr 19511 |
| This theorem is referenced by: psgnuni 19568 |
| Copyright terms: Public domain | W3C validator |