Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > gsmtrcl | Structured version Visualization version GIF version |
Description: The group sum of transpositions of a finite set is a permutation, see also psgneldm2i 18562. (Contributed by AV, 19-Jan-2019.) |
Ref | Expression |
---|---|
gsmtrcl.s | ⊢ 𝑆 = (SymGrp‘𝑁) |
gsmtrcl.b | ⊢ 𝐵 = (Base‘𝑆) |
gsmtrcl.t | ⊢ 𝑇 = ran (pmTrsp‘𝑁) |
Ref | Expression |
---|---|
gsmtrcl | ⊢ ((𝑁 ∈ Fin ∧ 𝑊 ∈ Word 𝑇) → (𝑆 Σg 𝑊) ∈ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | gsmtrcl.s | . . 3 ⊢ 𝑆 = (SymGrp‘𝑁) | |
2 | gsmtrcl.t | . . 3 ⊢ 𝑇 = ran (pmTrsp‘𝑁) | |
3 | eqid 2818 | . . 3 ⊢ (pmSgn‘𝑁) = (pmSgn‘𝑁) | |
4 | 1, 2, 3 | psgneldm2i 18562 | . 2 ⊢ ((𝑁 ∈ Fin ∧ 𝑊 ∈ Word 𝑇) → (𝑆 Σg 𝑊) ∈ dom (pmSgn‘𝑁)) |
5 | gsmtrcl.b | . . . 4 ⊢ 𝐵 = (Base‘𝑆) | |
6 | 1, 3, 5 | psgneldm 18560 | . . 3 ⊢ ((𝑆 Σg 𝑊) ∈ dom (pmSgn‘𝑁) ↔ ((𝑆 Σg 𝑊) ∈ 𝐵 ∧ dom ((𝑆 Σg 𝑊) ∖ I ) ∈ Fin)) |
7 | ax-1 6 | . . . 4 ⊢ ((𝑆 Σg 𝑊) ∈ 𝐵 → ((𝑁 ∈ Fin ∧ 𝑊 ∈ Word 𝑇) → (𝑆 Σg 𝑊) ∈ 𝐵)) | |
8 | 7 | adantr 481 | . . 3 ⊢ (((𝑆 Σg 𝑊) ∈ 𝐵 ∧ dom ((𝑆 Σg 𝑊) ∖ I ) ∈ Fin) → ((𝑁 ∈ Fin ∧ 𝑊 ∈ Word 𝑇) → (𝑆 Σg 𝑊) ∈ 𝐵)) |
9 | 6, 8 | sylbi 218 | . 2 ⊢ ((𝑆 Σg 𝑊) ∈ dom (pmSgn‘𝑁) → ((𝑁 ∈ Fin ∧ 𝑊 ∈ Word 𝑇) → (𝑆 Σg 𝑊) ∈ 𝐵)) |
10 | 4, 9 | mpcom 38 | 1 ⊢ ((𝑁 ∈ Fin ∧ 𝑊 ∈ Word 𝑇) → (𝑆 Σg 𝑊) ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 ∈ wcel 2105 ∖ cdif 3930 I cid 5452 dom cdm 5548 ran crn 5549 ‘cfv 6348 (class class class)co 7145 Fincfn 8497 Word cword 13849 Basecbs 16471 Σg cgsu 16702 SymGrpcsymg 18433 pmTrspcpmtr 18498 pmSgncpsgn 18546 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-iin 4913 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-2o 8092 df-oadd 8095 df-er 8278 df-map 8397 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-card 9356 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-uz 12232 df-fz 12881 df-fzo 13022 df-seq 13358 df-hash 13679 df-word 13850 df-concat 13911 df-s1 13938 df-struct 16473 df-ndx 16474 df-slot 16475 df-base 16477 df-sets 16478 df-ress 16479 df-plusg 16566 df-tset 16572 df-0g 16703 df-gsum 16704 df-mre 16845 df-mrc 16846 df-acs 16848 df-mgm 17840 df-sgrp 17889 df-mnd 17900 df-submnd 17945 df-grp 18044 df-minusg 18045 df-subg 18214 df-symg 18434 df-pmtr 18499 df-psgn 18548 |
This theorem is referenced by: psgndiflemB 20672 |
Copyright terms: Public domain | W3C validator |