psgnfvalfi - Metamath Proof Explorer

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

Theorem psgnfvalfi 17979

Description: Function definition of the permutation sign function for permutations of finite sets. (Contributed by AV, 13-Jan-2019.)

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

**Assertion**
Ref	Expression
psgnfvalfi	⊢ (𝐷 ∈ Fin → 𝑁 = (𝑥 ∈ 𝐵 ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(#‘𝑤))))))

Distinct variable groups: 𝑥,𝐷,𝑠,𝑤 𝑥,𝐵 𝐷,𝑠,𝑤 𝑤,𝑇 Allowed substitution hints: 𝐵(𝑤,𝑠) 𝑇(𝑥,𝑠) 𝐺(𝑥,𝑤,𝑠) 𝑁(𝑥,𝑤,𝑠)

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

Step	Hyp	Ref	Expression
1		psgnfvalfi.g	. . 3 ⊢ 𝐺 = (SymGrp‘𝐷)
2		psgnfvalfi.b	. . 3 ⊢ 𝐵 = (Base‘𝐺)
3		eqid 2651	. . 3 ⊢ {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} = {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin}
4		psgnfvalfi.t	. . 3 ⊢ 𝑇 = ran (pmTrsp‘𝐷)
5		psgnfvalfi.n	. . 3 ⊢ 𝑁 = (pmSgn‘𝐷)
6	1, 2, 3, 4, 5	psgnfval 17966	. 2 ⊢ 𝑁 = (𝑥 ∈ {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(#‘𝑤)))))
7	1, 2	sygbasnfpfi 17978	. . . . . 6 ⊢ ((𝐷 ∈ Fin ∧ 𝑝 ∈ 𝐵) → dom (𝑝 ∖ I ) ∈ Fin)
8	7	ralrimiva 2995	. . . . 5 ⊢ (𝐷 ∈ Fin → ∀𝑝 ∈ 𝐵 dom (𝑝 ∖ I ) ∈ Fin)
9		rabid2 3148	. . . . 5 ⊢ (𝐵 = {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} ↔ ∀𝑝 ∈ 𝐵 dom (𝑝 ∖ I ) ∈ Fin)
10	8, 9	sylibr 224	. . . 4 ⊢ (𝐷 ∈ Fin → 𝐵 = {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin})
11	10	eqcomd 2657	. . 3 ⊢ (𝐷 ∈ Fin → {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} = 𝐵)
12	11	mpteq1d 4771	. 2 ⊢ (𝐷 ∈ Fin → (𝑥 ∈ {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(#‘𝑤))))) = (𝑥 ∈ 𝐵 ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(#‘𝑤))))))
13	6, 12	syl5eq 2697	1 ⊢ (𝐷 ∈ Fin → 𝑁 = (𝑥 ∈ 𝐵 ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(#‘𝑤))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 383 = wceq 1523 ∈ wcel 2030 ∀wral 2941 ∃wrex 2942 {crab 2945 ∖ cdif 3604 ↦ cmpt 4762 I cid 5052 dom cdm 5143 ran crn 5144 ℩cio 5887 ‘cfv 5926 (class class class)co 6690 Fincfn 7997 1c1 9975 -cneg 10305 ↑cexp 12900 #chash 13157 Word cword 13323 Basecbs 15904 Σ_g cgsu 16148 SymGrpcsymg 17843 pmTrspcpmtr 17907 pmSgncpsgn 17955

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-rep 4804 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-cnex 10030 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 ax-pre-mulgt0 10051

This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-pss 3623 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-tp 4215 df-op 4217 df-uni 4469 df-int 4508 df-iun 4554 df-br 4686 df-opab 4746 df-mpt 4763 df-tr 4786 df-id 5053 df-eprel 5058 df-po 5064 df-so 5065 df-fr 5102 df-we 5104 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-pred 5718 df-ord 5764 df-on 5765 df-lim 5766 df-suc 5767 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-riota 6651 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-om 7108 df-1st 7210 df-2nd 7211 df-wrecs 7452 df-recs 7513 df-rdg 7551 df-1o 7605 df-oadd 7609 df-er 7787 df-map 7901 df-en 7998 df-dom 7999 df-sdom 8000 df-fin 8001 df-card 8803 df-pnf 10114 df-mnf 10115 df-xr 10116 df-ltxr 10117 df-le 10118 df-sub 10306 df-neg 10307 df-nn 11059 df-2 11117 df-3 11118 df-4 11119 df-5 11120 df-6 11121 df-7 11122 df-8 11123 df-9 11124 df-n0 11331 df-z 11416 df-uz 11726 df-fz 12365 df-fzo 12505 df-hash 13158 df-word 13331 df-struct 15906 df-ndx 15907 df-slot 15908 df-base 15910 df-plusg 16001 df-tset 16007 df-symg 17844 df-psgn 17957

This theorem is referenced by: (None)

W3C validator