psgnfix1 - Metamath Proof Explorer

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

Theorem psgnfix1 21544

Description: A permutation of a finite set fixing one element is generated by transpositions not involving the fixed element. (Contributed by AV, 13-Jan-2019.)

**Hypotheses**
Ref	Expression
psgnfix.p	⊢ 𝑃 = (Base‘(SymGrp‘𝑁))
psgnfix.t	⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾}))
psgnfix.s	⊢ 𝑆 = (SymGrp‘(𝑁 ∖ {𝐾}))

**Assertion**
Ref	Expression
psgnfix1	⊢ ((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) → (𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} → ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤)))

Distinct variable groups: 𝐾,𝑞 𝑤,𝐾 𝑤,𝑁 𝑃,𝑞 𝑤,𝑄 𝑤,𝑆 𝑤,𝑇 Allowed substitution hints: 𝑃(𝑤) 𝑄(𝑞) 𝑆(𝑞) 𝑇(𝑞) 𝑁(𝑞)

**Proof of Theorem psgnfix1**
Step	Hyp	Ref	Expression
1		psgnfix.p	. . . . 5 ⊢ 𝑃 = (Base‘(SymGrp‘𝑁))
2		eqid 2733	. . . . 5 ⊢ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} = {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}
3		psgnfix.s	. . . . . 6 ⊢ 𝑆 = (SymGrp‘(𝑁 ∖ {𝐾}))
4	3	fveq2i 6834	. . . . 5 ⊢ (Base‘𝑆) = (Base‘(SymGrp‘(𝑁 ∖ {𝐾})))
5		eqid 2733	. . . . 5 ⊢ (𝑁 ∖ {𝐾}) = (𝑁 ∖ {𝐾})
6	1, 2, 4, 5	symgfixelsi 19355	. . . 4 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (𝑄 ↾ (𝑁 ∖ {𝐾})) ∈ (Base‘𝑆))
7	6	adantll 714	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (𝑄 ↾ (𝑁 ∖ {𝐾})) ∈ (Base‘𝑆))
8		diffi 9095	. . . . 5 ⊢ (𝑁 ∈ Fin → (𝑁 ∖ {𝐾}) ∈ Fin)
9	8	ad2antrr 726	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (𝑁 ∖ {𝐾}) ∈ Fin)
10		eqid 2733	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
11		psgnfix.t	. . . . 5 ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾}))
12	3, 10, 11	psgnfitr 19437	. . . 4 ⊢ ((𝑁 ∖ {𝐾}) ∈ Fin → ((𝑄 ↾ (𝑁 ∖ {𝐾})) ∈ (Base‘𝑆) ↔ ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤)))
13	9, 12	syl 17	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → ((𝑄 ↾ (𝑁 ∖ {𝐾})) ∈ (Base‘𝑆) ↔ ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤)))
14	7, 13	mpbid 232	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤))
15	14	ex 412	1 ⊢ ((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) → (𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} → ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∃wrex 3057 {crab 3396 ∖ cdif 3895 {csn 4577 ran crn 5622 ↾ cres 5623 ‘cfv 6489 (class class class)co 7355 Fincfn 8879 Word cword 14427 Basecbs 17127 Σ_g cgsu 17351 SymGrpcsymg 19289 pmTrspcpmtr 19361

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 ax-cnex 11073 ax-resscn 11074 ax-1cn 11075 ax-icn 11076 ax-addcl 11077 ax-addrcl 11078 ax-mulcl 11079 ax-mulrcl 11080 ax-mulcom 11081 ax-addass 11082 ax-mulass 11083 ax-distr 11084 ax-i2m1 11085 ax-1ne0 11086 ax-1rid 11087 ax-rnegex 11088 ax-rrecex 11089 ax-cnre 11090 ax-pre-lttri 11091 ax-pre-lttrn 11092 ax-pre-ltadd 11093 ax-pre-mulgt0 11094

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2882 df-ne 2930 df-nel 3034 df-ral 3049 df-rex 3058 df-rmo 3347 df-reu 3348 df-rab 3397 df-v 3439 df-sbc 3738 df-csb 3847 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-pss 3918 df-nul 4283 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-tp 4582 df-op 4584 df-uni 4861 df-int 4900 df-iun 4945 df-iin 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-tr 5203 df-id 5516 df-eprel 5521 df-po 5529 df-so 5530 df-fr 5574 df-se 5575 df-we 5576 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-pred 6256 df-ord 6317 df-on 6318 df-lim 6319 df-suc 6320 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-isom 6498 df-riota 7312 df-ov 7358 df-oprab 7359 df-mpo 7360 df-om 7806 df-1st 7930 df-2nd 7931 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-2o 8395 df-er 8631 df-map 8761 df-en 8880 df-dom 8881 df-sdom 8882 df-fin 8883 df-card 9843 df-pnf 11159 df-mnf 11160 df-xr 11161 df-ltxr 11162 df-le 11163 df-sub 11357 df-neg 11358 df-nn 12137 df-2 12199 df-3 12200 df-4 12201 df-5 12202 df-6 12203 df-7 12204 df-8 12205 df-9 12206 df-n0 12393 df-z 12480 df-uz 12743 df-fz 13415 df-fzo 13562 df-seq 13916 df-hash 14245 df-word 14428 df-concat 14485 df-s1 14511 df-struct 17065 df-sets 17082 df-slot 17100 df-ndx 17112 df-base 17128 df-ress 17149 df-plusg 17181 df-tset 17187 df-0g 17352 df-gsum 17353 df-mre 17496 df-mrc 17497 df-acs 17499 df-mgm 18556 df-sgrp 18635 df-mnd 18651 df-submnd 18700 df-efmnd 18785 df-grp 18857 df-minusg 18858 df-subg 19044 df-symg 19290 df-pmtr 19362

This theorem is referenced by: psgndif 21548

W3C validator