| 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 2769 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 3 | eqid 2769 | . . . . . 6 ⊢ {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} | |
| 4 | psgnval.n | . . . . . 6 ⊢ 𝑁 = (pmSgn‘𝐷) | |
| 5 | 1, 2, 3, 4 | psgnfn 19571 | . . . . 5 ⊢ 𝑁 Fn {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} |
| 6 | 5 | fndmi 6640 | . . . 4 ⊢ dom 𝑁 = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} |
| 7 | psgnval.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 8 | eqid 2769 | . . . . . 6 ⊢ (mrCls‘(SubMnd‘𝐺)) = (mrCls‘(SubMnd‘𝐺)) | |
| 9 | 7, 1, 2, 8 | symggen 19540 | . . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin}) |
| 10 | 1 | symggrp 19470 | . . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp) |
| 11 | 10 | grpmndd 19013 | . . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd) |
| 12 | 7, 1, 2 | symgtrf 19539 | . . . . . 6 ⊢ 𝑇 ⊆ (Base‘𝐺) |
| 13 | 2, 8 | gsumwspan 18905 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺)) → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 14 | 11, 12, 13 | sylancl 597 | . . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 15 | 9, 14 | eqtr3d 2806 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 16 | 6, 15 | eqtrid 2816 | . . 3 ⊢ (𝐷 ∈ 𝑉 → dom 𝑁 = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 17 | 16 | eleq2d 2855 | . 2 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ 𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)))) |
| 18 | eqid 2769 | . . 3 ⊢ (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) = (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) | |
| 19 | ovex 7444 | . . 3 ⊢ (𝐺 Σg 𝑤) ∈ V | |
| 20 | 18, 19 | elrnmpti 5953 | . 2 ⊢ (𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤)) |
| 21 | 17, 20 | bitrdi 290 | 1 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1567 ∈ wcel 2149 ∃wrex 3095 {crab 3422 ∖ cdif 3908 ⊆ wss 3911 ↦ cmpt 5194 I cid 5556 dom cdm 5662 ran crn 5663 ‘cfv 6537 (class class class)co 7411 Fincfn 8943 Word cword 14550 Basecbs 17269 Σg cgsu 17493 mrClscmrc 17635 Mndcmnd 18792 SubMndcsubmnd 18840 SymGrpcsymg 19439 pmTrspcpmtr 19511 pmSgncpsgn 19559 |
| 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 5240 ax-sep 5259 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11156 ax-resscn 11157 ax-1cn 11158 ax-icn 11159 ax-addcl 11160 ax-addrcl 11161 ax-mulcl 11162 ax-mulrcl 11163 ax-mulcom 11164 ax-addass 11165 ax-mulass 11166 ax-distr 11167 ax-i2m1 11168 ax-1ne0 11169 ax-1rid 11170 ax-rnegex 11171 ax-rrecex 11172 ax-cnre 11173 ax-pre-lttri 11174 ax-pre-lttrn 11175 ax-pre-ltadd 11176 ax-pre-mulgt0 11177 |
| 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 3375 df-reu 3376 df-rab 3423 df-v 3463 df-sbc 3752 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4491 df-pw 4567 df-sn 4593 df-pr 4595 df-tp 4597 df-op 4599 df-uni 4875 df-int 4915 df-iun 4960 df-iin 4961 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-se 5616 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-isom 6546 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8278 df-wrecs 8309 df-recs 8358 df-rdg 8397 df-1o 8453 df-2o 8454 df-er 8694 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-fin 8947 df-card 9925 df-pnf 11245 df-mnf 11246 df-xr 11247 df-ltxr 11248 df-le 11249 df-sub 11443 df-neg 11444 df-nn 12234 df-2 12303 df-3 12304 df-4 12305 df-5 12306 df-6 12307 df-7 12308 df-8 12309 df-9 12310 df-n0 12505 df-z 12592 df-uz 12863 df-fz 13536 df-fzo 13683 df-seq 14038 df-hash 14367 df-word 14551 df-concat 14608 df-s1 14634 df-struct 17207 df-sets 17224 df-slot 17242 df-ndx 17254 df-base 17270 df-ress 17291 df-plusg 17323 df-tset 17329 df-0g 17494 df-gsum 17495 df-mre 17638 df-mrc 17639 df-acs 17641 df-mgm 18698 df-sgrp 18777 df-mnd 18793 df-submnd 18842 df-efmnd 18928 df-grp 19003 df-minusg 19004 df-subg 19189 df-symg 19440 df-pmtr 19512 df-psgn 19561 |
| This theorem is referenced by: psgneldm2i 19575 psgneu 19576 |
| Copyright terms: Public domain | W3C validator |