| 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 19516 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp) |
| 3 | eqid 2765 | . . . . 5 ⊢ (oppg‘𝐺) = (oppg‘𝐺) | |
| 4 | symgtrinv.i | . . . . 5 ⊢ 𝐼 = (invg‘𝐺) | |
| 5 | 3, 4 | invoppggim 19476 | . . . 4 ⊢ (𝐺 ∈ Grp → 𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺))) |
| 6 | gimghm 19380 | . . . 4 ⊢ (𝐼 ∈ (𝐺 GrpIso (oppg‘𝐺)) → 𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺))) | |
| 7 | ghmmhm 19342 | . . . 4 ⊢ (𝐼 ∈ (𝐺 GrpHom (oppg‘𝐺)) → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) | |
| 8 | 2, 5, 6, 7 | 4syl 20 | . . 3 ⊢ (𝐷 ∈ 𝑉 → 𝐼 ∈ (𝐺 MndHom (oppg‘𝐺))) |
| 9 | symgtrinv.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 10 | eqid 2765 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 11 | 9, 1, 10 | symgtrf 19585 | . . . . 5 ⊢ 𝑇 ⊆ (Base‘𝐺) |
| 12 | sswrd 14579 | . . . . 5 ⊢ (𝑇 ⊆ (Base‘𝐺) → Word 𝑇 ⊆ Word (Base‘𝐺)) | |
| 13 | 11, 12 | ax-mp 5 | . . . 4 ⊢ Word 𝑇 ⊆ Word (Base‘𝐺) |
| 14 | 13 | sseli 3934 | . . 3 ⊢ (𝑊 ∈ Word 𝑇 → 𝑊 ∈ Word (Base‘𝐺)) |
| 15 | 10 | gsumwmhm 18943 | . . 3 ⊢ ((𝐼 ∈ (𝐺 MndHom (oppg‘𝐺)) ∧ 𝑊 ∈ Word (Base‘𝐺)) → (𝐼‘(𝐺 Σg 𝑊)) = ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊))) |
| 16 | 8, 14, 15 | syl2an 608 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼‘(𝐺 Σg 𝑊)) = ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊))) |
| 17 | 10, 4 | grpinvf 19099 | . . . . . . 7 ⊢ (𝐺 ∈ Grp → 𝐼:(Base‘𝐺)⟶(Base‘𝐺)) |
| 18 | 2, 17 | syl 18 | . . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐼:(Base‘𝐺)⟶(Base‘𝐺)) |
| 19 | wrdf 14575 | . . . . . . . 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 3936 | . . . . . 6 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝑊‘𝑥) ∈ (Base‘𝐺)) |
| 31 | 1, 10, 4 | symginv 19518 | . . . . . 6 ⊢ ((𝑊‘𝑥) ∈ (Base‘𝐺) → (𝐼‘(𝑊‘𝑥)) = ◡(𝑊‘𝑥)) |
| 32 | 30, 31 | syl 18 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → (𝐼‘(𝑊‘𝑥)) = ◡(𝑊‘𝑥)) |
| 33 | eqid 2765 | . . . . . . 7 ⊢ (pmTrsp‘𝐷) = (pmTrsp‘𝐷) | |
| 34 | 33, 9 | pmtrfcnv 19580 | . . . . . 6 ⊢ ((𝑊‘𝑥) ∈ 𝑇 → ◡(𝑊‘𝑥) = (𝑊‘𝑥)) |
| 35 | 29, 34 | syl 18 | . . . . 5 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ◡(𝑊‘𝑥) = (𝑊‘𝑥)) |
| 36 | 28, 32, 35 | 3eqtrd 2804 | . . . 4 ⊢ (((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) ∧ 𝑥 ∈ (0..^(♯‘𝑊))) → ((𝐼 ∘ 𝑊)‘𝑥) = (𝑊‘𝑥)) |
| 37 | 25, 26, 36 | eqfnfvd 7032 | . . 3 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → (𝐼 ∘ 𝑊) = 𝑊) |
| 38 | 37 | oveq2d 7435 | . 2 ⊢ ((𝐷 ∈ 𝑉 ∧ 𝑊 ∈ Word 𝑇) → ((oppg‘𝐺) Σg (𝐼 ∘ 𝑊)) = ((oppg‘𝐺) Σg 𝑊)) |
| 39 | 2 | grpmndd 19059 | . . 3 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd) |
| 40 | 10, 3 | gsumwrev 19482 | . . 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 2804 | 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 3906 ◡ccnv 5662 ran crn 5664 ∘ ccom 5667 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 (class class class)co 7419 0cc0 11117 ..^cfzo 13701 ♯chash 14386 Word cword 14570 reversecreverse 14819 Basecbs 17293 Σg cgsu 17517 Mndcmnd 18826 MndHom cmhm 18878 Grpcgrp 19046 invgcminusg 19047 GrpHom cghm 19329 GrpIso cgim 19373 oppgcoppg 19461 SymGrpcsymg 19485 pmTrspcpmtr 19557 |
| 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 2737 ax-rep 5240 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-resscn 11174 ax-1cn 11175 ax-icn 11176 ax-addcl 11177 ax-addrcl 11178 ax-mulcl 11179 ax-mulrcl 11180 ax-mulcom 11181 ax-addass 11182 ax-mulass 11183 ax-distr 11184 ax-i2m1 11185 ax-1ne0 11186 ax-1rid 11187 ax-rnegex 11188 ax-rrecex 11189 ax-cnre 11190 ax-pre-lttri 11191 ax-pre-lttrn 11192 ax-pre-ltadd 11193 ax-pre-mulgt0 11194 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-tp 4596 df-op 4598 df-uni 4875 df-int 4915 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 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 7376 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-tpos 8228 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-2o 8460 df-er 8700 df-map 8832 df-en 8950 df-dom 8951 df-sdom 8952 df-fin 8953 df-card 9941 df-pnf 11262 df-mnf 11263 df-xr 11264 df-ltxr 11265 df-le 11266 df-sub 11460 df-neg 11461 df-nn 12251 df-2 12320 df-3 12321 df-4 12322 df-5 12323 df-6 12324 df-7 12325 df-8 12326 df-9 12327 df-n0 12522 df-xnn0 12595 df-z 12609 df-uz 12881 df-fz 13554 df-fzo 13702 df-seq 14058 df-hash 14387 df-word 14571 df-lsw 14620 df-concat 14628 df-s1 14655 df-substr 14701 df-pfx 14733 df-reverse 14820 df-struct 17231 df-sets 17248 df-slot 17266 df-ndx 17278 df-base 17294 df-ress 17315 df-plusg 17347 df-tset 17353 df-0g 17518 df-gsum 17519 df-mgm 18722 df-sgrp 18811 df-mnd 18827 df-mhm 18880 df-submnd 18881 df-efmnd 18967 df-grp 19049 df-minusg 19050 df-ghm 19330 df-gim 19375 df-oppg 19462 df-symg 19486 df-pmtr 19558 |
| This theorem is used by: psgnuni 19615 |
| Copyright terms: Public domain | W3C validator |