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 21573

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 2739	. . . . 5 ⊢ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} = {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}
3		psgnfix.s	. . . . . 6 ⊢ 𝑆 = (SymGrp‘(𝑁 ∖ {𝐾}))
4	3	fveq2i 6830	. . . . 5 ⊢ (Base‘𝑆) = (Base‘(SymGrp‘(𝑁 ∖ {𝐾})))
5		eqid 2739	. . . . 5 ⊢ (𝑁 ∖ {𝐾}) = (𝑁 ∖ {𝐾})
6	1, 2, 4, 5	symgfixelsi 19401	. . . 4 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (𝑄 ↾ (𝑁 ∖ {𝐾})) ∈ (Base‘𝑆))
7	6	adantll 720	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (𝑄 ↾ (𝑁 ∖ {𝐾})) ∈ (Base‘𝑆))
8		diffi 9099	. . . . 5 ⊢ (𝑁 ∈ Fin → (𝑁 ∖ {𝐾}) ∈ Fin)
9	8	ad2antrr 732	. . . 4 ⊢ (((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → (𝑁 ∖ {𝐾}) ∈ Fin)
10		eqid 2739	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
11		psgnfix.t	. . . . 5 ⊢ 𝑇 = ran (pmTrsp‘(𝑁 ∖ {𝐾}))
12	3, 10, 11	psgnfitr 19483	. . . 4 ⊢ ((𝑁 ∖ {𝐾}) ∈ Fin → ((𝑄 ↾ (𝑁 ∖ {𝐾})) ∈ (Base‘𝑆) ↔ ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤)))
13	9, 12	syl 17	. . 3 ⊢ (((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → ((𝑄 ↾ (𝑁 ∖ {𝐾})) ∈ (Base‘𝑆) ↔ ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤)))
14	7, 13	mpbid 233	. 2 ⊢ (((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) ∧ 𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾}) → ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤))
15	14	ex 413	1 ⊢ ((𝑁 ∈ Fin ∧ 𝐾 ∈ 𝑁) → (𝑄 ∈ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐾} → ∃𝑤 ∈ Word 𝑇(𝑄 ↾ (𝑁 ∖ {𝐾})) = (𝑆 Σ_g 𝑤)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1547 ∈ wcel 2119 ∃wrex 3063 {crab 3391 ∖ cdif 3880 {csn 4555 ran crn 5619 ↾ cres 5620 ‘cfv 6485 (class class class)co 7356 Fincfn 8883 Word cword 14466 Basecbs 17170 Σ_g cgsu 17394 SymGrpcsymg 19335 pmTrspcpmtr 19407

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5199 ax-sep 5218 ax-nul 5228 ax-pow 5294 ax-pr 5362 ax-un 7678 ax-cnex 11085 ax-resscn 11086 ax-1cn 11087 ax-icn 11088 ax-addcl 11089 ax-addrcl 11090 ax-mulcl 11091 ax-mulrcl 11092 ax-mulcom 11093 ax-addass 11094 ax-mulass 11095 ax-distr 11096 ax-i2m1 11097 ax-1ne0 11098 ax-1rid 11099 ax-rnegex 11100 ax-rrecex 11101 ax-cnre 11102 ax-pre-lttri 11103 ax-pre-lttrn 11104 ax-pre-ltadd 11105 ax-pre-mulgt0 11106

This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3or 1093 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-nel 3039 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3903 df-nul 4262 df-if 4455 df-pw 4531 df-sn 4556 df-pr 4558 df-tp 4560 df-op 4562 df-uni 4839 df-int 4878 df-iun 4923 df-iin 4924 df-br 5073 df-opab 5135 df-mpt 5154 df-tr 5180 df-id 5513 df-eprel 5518 df-po 5526 df-so 5527 df-fr 5571 df-se 5572 df-we 5573 df-xp 5624 df-rel 5625 df-cnv 5626 df-co 5627 df-dm 5628 df-rn 5629 df-res 5630 df-ima 5631 df-pred 6252 df-ord 6313 df-on 6314 df-lim 6315 df-suc 6316 df-iota 6441 df-fun 6487 df-fn 6488 df-f 6489 df-f1 6490 df-fo 6491 df-f1o 6492 df-fv 6493 df-isom 6494 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-1o 8395 df-2o 8396 df-er 8633 df-map 8765 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-card 9854 df-pnf 11172 df-mnf 11173 df-xr 11174 df-ltxr 11175 df-le 11176 df-sub 11370 df-neg 11371 df-nn 12166 df-2 12235 df-3 12236 df-4 12237 df-5 12238 df-6 12239 df-7 12240 df-8 12241 df-9 12242 df-n0 12429 df-z 12516 df-uz 12780 df-fz 13453 df-fzo 13600 df-seq 13955 df-hash 14284 df-word 14467 df-concat 14524 df-s1 14550 df-struct 17108 df-sets 17125 df-slot 17143 df-ndx 17155 df-base 17171 df-ress 17192 df-plusg 17224 df-tset 17230 df-0g 17395 df-gsum 17396 df-mre 17539 df-mrc 17540 df-acs 17542 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-submnd 18743 df-efmnd 18828 df-grp 18903 df-minusg 18904 df-subg 19090 df-symg 19336 df-pmtr 19408

This theorem is referenced by: psgndif 21577

W3C validator