| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > psgneldm2 | Structured version Visualization version GIF version | ||
| Description: The finitary permutations are the span of the transpositions. (Contributed by Stefan O'Rear, 28-Aug-2015.) |
| Ref | Expression |
|---|---|
| psgnval.g | ⊢ 𝐺 = (SymGrp‘𝐷) |
| psgnval.t | ⊢ 𝑇 = ran (pmTrsp‘𝐷) |
| psgnval.n | ⊢ 𝑁 = (pmSgn‘𝐷) |
| Ref | Expression |
|---|---|
| psgneldm2 | ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | psgnval.g | . . . . . 6 ⊢ 𝐺 = (SymGrp‘𝐷) | |
| 2 | eqid 2741 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 3 | eqid 2741 | . . . . . 6 ⊢ {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} | |
| 4 | psgnval.n | . . . . . 6 ⊢ 𝑁 = (pmSgn‘𝐷) | |
| 5 | 1, 2, 3, 4 | psgnfn 19471 | . . . . 5 ⊢ 𝑁 Fn {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} |
| 6 | 5 | fndmi 6593 | . . . 4 ⊢ dom 𝑁 = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} |
| 7 | psgnval.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 8 | eqid 2741 | . . . . . 6 ⊢ (mrCls‘(SubMnd‘𝐺)) = (mrCls‘(SubMnd‘𝐺)) | |
| 9 | 7, 1, 2, 8 | symggen 19440 | . . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin}) |
| 10 | 1 | symggrp 19370 | . . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp) |
| 11 | 10 | grpmndd 18917 | . . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd) |
| 12 | 7, 1, 2 | symgtrf 19439 | . . . . . 6 ⊢ 𝑇 ⊆ (Base‘𝐺) |
| 13 | 2, 8 | gsumwspan 18809 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺)) → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 14 | 11, 12, 13 | sylancl 593 | . . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 15 | 9, 14 | eqtr3d 2778 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 16 | 6, 15 | eqtrid 2788 | . . 3 ⊢ (𝐷 ∈ 𝑉 → dom 𝑁 = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 17 | 16 | eleq2d 2827 | . 2 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ 𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)))) |
| 18 | eqid 2741 | . . 3 ⊢ (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) = (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) | |
| 19 | ovex 7393 | . . 3 ⊢ (𝐺 Σg 𝑤) ∈ V | |
| 20 | 18, 19 | elrnmpti 5911 | . 2 ⊢ (𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤)) |
| 21 | 17, 20 | bitrdi 289 | 1 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 = wceq 1548 ∈ wcel 2121 ∃wrex 3065 {crab 3393 ∖ cdif 3882 ⊆ wss 3885 ↦ cmpt 5156 I cid 5515 dom cdm 5621 ran crn 5622 ‘cfv 6489 (class class class)co 7360 Fincfn 8887 Word cword 14470 Basecbs 17174 Σg cgsu 17398 mrClscmrc 17540 Mndcmnd 18697 SubMndcsubmnd 18745 SymGrpcsymg 19339 pmTrspcpmtr 19411 pmSgncpsgn 19459 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5202 ax-sep 5221 ax-nul 5231 ax-pow 5297 ax-pr 5365 ax-un 7682 ax-cnex 11089 ax-resscn 11090 ax-1cn 11091 ax-icn 11092 ax-addcl 11093 ax-addrcl 11094 ax-mulcl 11095 ax-mulrcl 11096 ax-mulcom 11097 ax-addass 11098 ax-mulass 11099 ax-distr 11100 ax-i2m1 11101 ax-1ne0 11102 ax-1rid 11103 ax-rnegex 11104 ax-rrecex 11105 ax-cnre 11106 ax-pre-lttri 11107 ax-pre-lttrn 11108 ax-pre-ltadd 11109 ax-pre-mulgt0 11110 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4265 df-if 4458 df-pw 4534 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4842 df-int 4881 df-iun 4926 df-iin 4927 df-br 5076 df-opab 5138 df-mpt 5157 df-tr 5183 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-se 5575 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-isom 6498 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-card 9858 df-pnf 11176 df-mnf 11177 df-xr 11178 df-ltxr 11179 df-le 11180 df-sub 11374 df-neg 11375 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-5 12242 df-6 12243 df-7 12244 df-8 12245 df-9 12246 df-n0 12433 df-z 12520 df-uz 12784 df-fz 13457 df-fzo 13604 df-seq 13959 df-hash 14288 df-word 14471 df-concat 14528 df-s1 14554 df-struct 17112 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-ress 17196 df-plusg 17228 df-tset 17234 df-0g 17399 df-gsum 17400 df-mre 17543 df-mrc 17544 df-acs 17546 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-submnd 18747 df-efmnd 18832 df-grp 18907 df-minusg 18908 df-subg 19094 df-symg 19340 df-pmtr 19412 df-psgn 19461 |
| This theorem is referenced by: psgneldm2i 19475 psgneu 19476 |
| Copyright terms: Public domain | W3C validator |