psgneldm2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > psgneldm2		Structured version Visualization version GIF version

Theorem psgneldm2 19450

Description: The finitary permutations are the span of the transpositions. (Contributed by Stefan O'Rear, 28-Aug-2015.)

**Hypotheses**
Ref	Expression
psgnval.g	⊢ 𝐺 = (SymGrp‘𝐷)
psgnval.t	⊢ 𝑇 = ran (pmTrsp‘𝐷)
psgnval.n	⊢ 𝑁 = (pmSgn‘𝐷)

**Assertion**
Ref	Expression
psgneldm2	⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ ∃𝑤 ∈ Word 𝑇𝑃 = (𝐺 Σ_g 𝑤)))

Distinct variable groups: 𝑤,𝐺 𝑤,𝑁 𝑤,𝑃 𝑤,𝑇 𝑤,𝐷 Allowed substitution hint: 𝑉(𝑤)

Proof of Theorem psgneldm2 Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		psgnval.g	. . . . . 6 ⊢ 𝐺 = (SymGrp‘𝐷)
2		eqid 2737	. . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺)
3		eqid 2737	. . . . . 6 ⊢ {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin}
4		psgnval.n	. . . . . 6 ⊢ 𝑁 = (pmSgn‘𝐷)
5	1, 2, 3, 4	psgnfn 19447	. . . . 5 ⊢ 𝑁 Fn {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin}
6	5	fndmi 6606	. . . 4 ⊢ dom 𝑁 = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin}
7		psgnval.t	. . . . . 6 ⊢ 𝑇 = ran (pmTrsp‘𝐷)
8		eqid 2737	. . . . . 6 ⊢ (mrCls‘(SubMnd‘𝐺)) = (mrCls‘(SubMnd‘𝐺))
9	7, 1, 2, 8	symggen 19416	. . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin})
10	1	symggrp 19346	. . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp)
11	10	grpmndd 18893	. . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd)
12	7, 1, 2	symgtrf 19415	. . . . . 6 ⊢ 𝑇 ⊆ (Base‘𝐺)
13	2, 8	gsumwspan 18785	. . . . . 6 ⊢ ((𝐺 ∈ Mnd ∧ 𝑇 ⊆ (Base‘𝐺)) → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σ_g 𝑤)))
14	11, 12, 13	sylancl 587	. . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σ_g 𝑤)))
15	9, 14	eqtr3d 2774	. . . 4 ⊢ (𝐷 ∈ 𝑉 → {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin} = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σ_g 𝑤)))
16	6, 15	eqtrid 2784	. . 3 ⊢ (𝐷 ∈ 𝑉 → dom 𝑁 = ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σ_g 𝑤)))
17	16	eleq2d 2823	. 2 ⊢ (𝐷 ∈ 𝑉 → (𝑃 ∈ dom 𝑁 ↔ 𝑃 ∈ ran (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σ_g 𝑤))))
18		eqid 2737	. . 3 ⊢ (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σ_g 𝑤)) = (𝑤 ∈ Word 𝑇 ↦ (𝐺 Σ_g 𝑤))
19		ovex 7403	. . 3 ⊢ (𝐺 Σ_g 𝑤) ∈ V
20	18, 19	elrnmpti 5921	. 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 1542 ∈ wcel 2114 ∃wrex 3062 {crab 3401 ∖ cdif 3900 ⊆ wss 3903 ↦ cmpt 5181 I cid 5528 dom cdm 5634 ran crn 5635 ‘cfv 6502 (class class class)co 7370 Fincfn 8897 Word cword 14450 Basecbs 17150 Σ_g cgsu 17374 mrClscmrc 17516 Mndcmnd 18673 SubMndcsubmnd 18721 SymGrpcsymg 19315 pmTrspcpmtr 19387 pmSgncpsgn 19435

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-om 7821 df-1st 7945 df-2nd 7946 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-er 8647 df-map 8779 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-card 9865 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-nn 12160 df-2 12222 df-3 12223 df-4 12224 df-5 12225 df-6 12226 df-7 12227 df-8 12228 df-9 12229 df-n0 12416 df-z 12503 df-uz 12766 df-fz 13438 df-fzo 13585 df-seq 13939 df-hash 14268 df-word 14451 df-concat 14508 df-s1 14534 df-struct 17088 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-ress 17172 df-plusg 17204 df-tset 17210 df-0g 17375 df-gsum 17376 df-mre 17519 df-mrc 17520 df-acs 17522 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-submnd 18723 df-efmnd 18808 df-grp 18883 df-minusg 18884 df-subg 19070 df-symg 19316 df-pmtr 19388 df-psgn 19437

This theorem is referenced by: psgneldm2i 19451 psgneu 19452

W3C validator