| 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 2762 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 3 | eqid 2762 | . . . . . 6 ⊢ {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} | |
| 4 | psgnval.n | . . . . . 6 ⊢ 𝑁 = (pmSgn‘𝐷) | |
| 5 | 1, 2, 3, 4 | psgnfn 19629 | . . . . 5 ⊢ 𝑁 Fn {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} |
| 6 | 5 | fndmi 6640 | . . . 4 ⊢ dom 𝑁 = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} |
| 7 | psgnval.t | . . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 8 | eqid 2762 | . . . . . 6 ⊢ (mrCls‘(SubMnd‘𝐺)) = (mrCls‘(SubMnd‘𝐺)) | |
| 9 | 7, 1, 2, 8 | symggen 19598 | . . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin}) |
| 10 | 1 | symggrp 19528 | . . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp) |
| 11 | 10 | grpmndd 19071 | . . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd) |
| 12 | 7, 1, 2 | symgtrf 19597 | . . . . . 6 ⊢ 𝑇 ⊆ (Base‘𝐺) |
| 13 | 2, 8 | gsumwspan 18956 | . . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺)) → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 14 | 11, 12, 13 | sylancl 598 | . . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 15 | 9, 14 | eqtr3d 2799 | . . . 4 ⊢ (𝐷 ∈ 𝑉 → {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 16 | 6, 15 | eqtrid 2809 | . . 3 ⊢ (𝐷 ∈ 𝑉 → dom 𝑁 = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤))) |
| 17 | 16 | eleq2d 2848 | . 2 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ 𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)))) |
| 18 | eqid 2762 | . . 3 ⊢ (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) = (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) | |
| 19 | ovex 7449 | . . 3 ⊢ (𝐺 Σg 𝑤) ∈ V | |
| 20 | 18, 19 | elrnmpti 5950 | . 2 ⊢ (𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σg 𝑤)) ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤)) |
| 21 | 17, 20 | bitrdi 290 | 1 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σg 𝑤))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 ∃wrex 3088 {crab 3414 ∖ cdif 3899 ⊆ wss 3902 ↦ cmpt 5190 I cid 5553 dom cdm 5659 ran crn 5660 ‘cfv 6537 (class class class)co 7416 Fincfn 8955 Word cword 14580 Basecbs 17305 Σg cgsu 17529 mrClscmrc 17671 Mndcmnd 18838 SubMndcsubmnd 18891 SymGrpcsymg 19497 pmTrspcpmtr 19569 pmSgncpsgn 19617 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7739 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| 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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-se 5613 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 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 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7866 df-1st 7989 df-2nd 7990 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8458 df-2o 8459 df-er 8699 df-map 8831 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-card 9947 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-nn 12261 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-9 12337 df-n0 12532 df-z 12619 df-uz 12891 df-fz 13564 df-fzo 13712 df-seq 14068 df-hash 14397 df-word 14581 df-concat 14638 df-s1 14665 df-struct 17243 df-sets 17260 df-slot 17278 df-ndx 17290 df-base 17306 df-ress 17327 df-plusg 17359 df-tset 17365 df-0g 17530 df-gsum 17531 df-mre 17674 df-mrc 17675 df-acs 17677 df-mgm 18734 df-sgrp 18823 df-mnd 18839 df-submnd 18893 df-efmnd 18979 df-grp 19061 df-minusg 19062 df-subg 19247 df-symg 19498 df-pmtr 19570 df-psgn 19619 |
| This theorem is used by: psgneldm2i 19633 psgneu 19634 |
| Copyright terms: Public domain | W3C validator |