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 19437

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 19434	. . . . 5 ⊢ 𝑁 Fn {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin}
6	5	fndmi 6597	. . . 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 19403	. . . . 5 ⊢ (𝐷 ∈ 𝑉 → ((mrCls‘(SubMnd‘𝐺))‘𝑇) = {𝑝 ∈ (Base‘𝐺) ∣ dom (𝑝 ∖ I ) ∈ Fin})
10	1	symggrp 19333	. . . . . . 7 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Grp)
11	10	grpmndd 18880	. . . . . 6 ⊢ (𝐷 ∈ 𝑉 → 𝐺 ∈ Mnd)
12	7, 1, 2	symgtrf 19402	. . . . . 6 ⊢ 𝑇 ⊆ (Base‘𝐺)
13	2, 8	gsumwspan 18775	. . . . . 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 7393	. . 3 ⊢ (𝐺 Σ_g 𝑤) ∈ V
20	18, 19	elrnmpti 5912	. 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 3061 {crab 3400 ∖ cdif 3899 ⊆ wss 3902 ↦ cmpt 5180 I cid 5519 dom cdm 5625 ran crn 5626 ‘cfv 6493 (class class class)co 7360 Fincfn 8887 Word cword 14440 Basecbs 17140 Σ_g cgsu 17364 mrClscmrc 17506 Mndcmnd 18663 SubMndcsubmnd 18711 SymGrpcsymg 19302 pmTrspcpmtr 19374 pmSgncpsgn 19422

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 5225 ax-sep 5242 ax-nul 5252 ax-pow 5311 ax-pr 5378 ax-un 7682 ax-cnex 11086 ax-resscn 11087 ax-1cn 11088 ax-icn 11089 ax-addcl 11090 ax-addrcl 11091 ax-mulcl 11092 ax-mulrcl 11093 ax-mulcom 11094 ax-addass 11095 ax-mulass 11096 ax-distr 11097 ax-i2m1 11098 ax-1ne0 11099 ax-1rid 11100 ax-rnegex 11101 ax-rrecex 11102 ax-cnre 11103 ax-pre-lttri 11104 ax-pre-lttrn 11105 ax-pre-ltadd 11106 ax-pre-mulgt0 11107

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 3062 df-rmo 3351 df-reu 3352 df-rab 3401 df-v 3443 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4287 df-if 4481 df-pw 4557 df-sn 4582 df-pr 4584 df-tp 4586 df-op 4588 df-uni 4865 df-int 4904 df-iun 4949 df-iin 4950 df-br 5100 df-opab 5162 df-mpt 5181 df-tr 5207 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-se 5579 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-isom 6502 df-riota 7317 df-ov 7363 df-oprab 7364 df-mpo 7365 df-om 7811 df-1st 7935 df-2nd 7936 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-2o 8400 df-er 8637 df-map 8769 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-card 9855 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12150 df-2 12212 df-3 12213 df-4 12214 df-5 12215 df-6 12216 df-7 12217 df-8 12218 df-9 12219 df-n0 12406 df-z 12493 df-uz 12756 df-fz 13428 df-fzo 13575 df-seq 13929 df-hash 14258 df-word 14441 df-concat 14498 df-s1 14524 df-struct 17078 df-sets 17095 df-slot 17113 df-ndx 17125 df-base 17141 df-ress 17162 df-plusg 17194 df-tset 17200 df-0g 17365 df-gsum 17366 df-mre 17509 df-mrc 17510 df-acs 17512 df-mgm 18569 df-sgrp 18648 df-mnd 18664 df-submnd 18713 df-efmnd 18798 df-grp 18870 df-minusg 18871 df-subg 19057 df-symg 19303 df-pmtr 19375 df-psgn 19424

This theorem is referenced by: psgneldm2i 19438 psgneu 19439

W3C validator