| 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 2729 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 3 | eqid 2729 | . . . . . 6 ⊢ {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} | |
| 4 | psgnval.n | . . . . . 6 ⊢ 𝑁 = (pmSgn‘𝐷) | |
| 5 | 1, 2, 3, 4 | psgnfn 19367 | . . . . 5 ⊢ 𝑁 Fn {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} |
| 6 | 5 | fndmi 6580 | . . . 4 ⊢ dom 𝑁 = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} |
| 7 | psgnval.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 8 | eqid 2729 | . . . . . 6 ⊢ (mrCls‘(SubMnd‘𝐺)) = (mrCls‘(SubMnd‘𝐺)) | |
| 9 | 7, 1, 2, 8 | symggen 19336 | . . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin}) |
| 10 | 1 | symggrp 19266 | . . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp) |
| 11 | 10 | grpmndd 18812 | . . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd) |
| 12 | 7, 1, 2 | symgtrf 19335 | . . . . . 6 ⊢ 𝑇 ⊆ (Base‘𝐺) |
| 13 | 2, 8 | gsumwspan 18707 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺)) → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 14 | 11, 12, 13 | sylancl 586 | . . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 15 | 9, 14 | eqtr3d 2766 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 16 | 6, 15 | eqtrid 2776 | . . 3 ⊢ (𝐷 ∈ 𝑉 → dom 𝑁 = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 17 | 16 | eleq2d 2814 | . 2 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ 𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)))) |
| 18 | eqid 2729 | . . 3 ⊢ (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) = (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) | |
| 19 | ovex 7373 | . . 3 ⊢ (𝐺 Σg 𝑤) ∈ V | |
| 20 | 18, 19 | elrnmpti 5898 | . 2 ⊢ (𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤)) |
| 21 | 17, 20 | bitrdi 287 | 1 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2109 ∃wrex 3053 {crab 3392 ∖ cdif 3896 ⊆ wss 3899 ↦ cmpt 5169 I cid 5507 dom cdm 5613 ran crn 5614 ‘cfv 6476 (class class class)co 7340 Fincfn 8863 Word cword 14408 Basecbs 17107 Σg cgsu 17331 mrClscmrc 17472 Mndcmnd 18595 SubMndcsubmnd 18643 SymGrpcsymg 19235 pmTrspcpmtr 19307 pmSgncpsgn 19355 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5214 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5367 ax-un 7662 ax-cnex 11053 ax-resscn 11054 ax-1cn 11055 ax-icn 11056 ax-addcl 11057 ax-addrcl 11058 ax-mulcl 11059 ax-mulrcl 11060 ax-mulcom 11061 ax-addass 11062 ax-mulass 11063 ax-distr 11064 ax-i2m1 11065 ax-1ne0 11066 ax-1rid 11067 ax-rnegex 11068 ax-rrecex 11069 ax-cnre 11070 ax-pre-lttri 11071 ax-pre-lttrn 11072 ax-pre-ltadd 11073 ax-pre-mulgt0 11074 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3343 df-reu 3344 df-rab 3393 df-v 3435 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-tp 4578 df-op 4580 df-uni 4857 df-int 4895 df-iun 4940 df-iin 4941 df-br 5089 df-opab 5151 df-mpt 5170 df-tr 5196 df-id 5508 df-eprel 5513 df-po 5521 df-so 5522 df-fr 5566 df-se 5567 df-we 5568 df-xp 5619 df-rel 5620 df-cnv 5621 df-co 5622 df-dm 5623 df-rn 5624 df-res 5625 df-ima 5626 df-pred 6243 df-ord 6304 df-on 6305 df-lim 6306 df-suc 6307 df-iota 6432 df-fun 6478 df-fn 6479 df-f 6480 df-f1 6481 df-fo 6482 df-f1o 6483 df-fv 6484 df-isom 6485 df-riota 7297 df-ov 7343 df-oprab 7344 df-mpo 7345 df-om 7791 df-1st 7915 df-2nd 7916 df-frecs 8205 df-wrecs 8236 df-recs 8285 df-rdg 8323 df-1o 8379 df-2o 8380 df-er 8616 df-map 8746 df-en 8864 df-dom 8865 df-sdom 8866 df-fin 8867 df-card 9823 df-pnf 11139 df-mnf 11140 df-xr 11141 df-ltxr 11142 df-le 11143 df-sub 11337 df-neg 11338 df-nn 12117 df-2 12179 df-3 12180 df-4 12181 df-5 12182 df-6 12183 df-7 12184 df-8 12185 df-9 12186 df-n0 12373 df-z 12460 df-uz 12724 df-fz 13399 df-fzo 13546 df-seq 13897 df-hash 14226 df-word 14409 df-concat 14466 df-s1 14491 df-struct 17045 df-sets 17062 df-slot 17080 df-ndx 17092 df-base 17108 df-ress 17129 df-plusg 17161 df-tset 17167 df-0g 17332 df-gsum 17333 df-mre 17475 df-mrc 17476 df-acs 17478 df-mgm 18501 df-sgrp 18580 df-mnd 18596 df-submnd 18645 df-efmnd 18730 df-grp 18802 df-minusg 18803 df-subg 18989 df-symg 19236 df-pmtr 19308 df-psgn 19357 |
| This theorem is referenced by: psgneldm2i 19371 psgneu 19372 |
| Copyright terms: Public domain | W3C validator |