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 19531

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 2737	. . 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 19518	. 2 ⊢ 𝑁 = (𝑥 ∈ {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤)))))
7	1, 2	sygbasnfpfi 19530	. . . . . 6 ⊢ ((𝐷 ∈ Fin ∧ 𝑝 ∈ 𝐵) → dom (𝑝 ∖ I ) ∈ Fin)
8	7	ralrimiva 3146	. . . . 5 ⊢ (𝐷 ∈ Fin → ∀𝑝 ∈ 𝐵 dom (𝑝 ∖ I ) ∈ Fin)
9		rabid2 3470	. . . . 5 ⊢ (𝐵 = {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} ↔ ∀𝑝 ∈ 𝐵 dom (𝑝 ∖ I ) ∈ Fin)
10	8, 9	sylibr 234	. . . 4 ⊢ (𝐷 ∈ Fin → 𝐵 = {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin})
11	10	eqcomd 2743	. . 3 ⊢ (𝐷 ∈ Fin → {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} = 𝐵)
12	11	mpteq1d 5237	. 2 ⊢ (𝐷 ∈ Fin → (𝑥 ∈ {𝑝 ∈ 𝐵 ∣ dom (𝑝 ∖ I ) ∈ Fin} ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤))))) = (𝑥 ∈ 𝐵 ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤))))))
13	6, 12	eqtrid 2789	1 ⊢ (𝐷 ∈ Fin → 𝑁 = (𝑥 ∈ 𝐵 ↦ (℩𝑠∃𝑤 ∈ Word 𝑇(𝑥 = (𝐺 Σ_g 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤))))))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ∀wral 3061 ∃wrex 3070 {crab 3436 ∖ cdif 3948 ↦ cmpt 5225 I cid 5577 dom cdm 5685 ran crn 5686 ℩cio 6512 ‘cfv 6561 (class class class)co 7431 Fincfn 8985 1c1 11156 -cneg 11493 ↑cexp 14102 ♯chash 14369 Word cword 14552 Basecbs 17247 Σ_g cgsu 17485 SymGrpcsymg 19386 pmTrspcpmtr 19459 pmSgncpsgn 19507

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-tp 4631 df-op 4633 df-uni 4908 df-int 4947 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-er 8745 df-map 8868 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-card 9979 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-3 12330 df-4 12331 df-5 12332 df-6 12333 df-7 12334 df-8 12335 df-9 12336 df-n0 12527 df-z 12614 df-uz 12879 df-fz 13548 df-fzo 13695 df-hash 14370 df-word 14553 df-struct 17184 df-sets 17201 df-slot 17219 df-ndx 17231 df-base 17248 df-ress 17275 df-plusg 17310 df-tset 17316 df-efmnd 18882 df-symg 19387 df-psgn 19509

This theorem is referenced by: (None)

W3C validator