psgnghm2 - Metamath Proof Explorer

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

Theorem psgnghm2 21574

Description: The sign is a homomorphism from the finite symmetric group to the numeric signs. (Contributed by Stefan O'Rear, 28-Aug-2015.)

**Hypotheses**
Ref	Expression
psgnghm2.s	⊢ 𝑆 = (SymGrp‘𝐷)
psgnghm2.n	⊢ 𝑁 = (pmSgn‘𝐷)
psgnghm2.u	⊢ 𝑈 = ((mulGrp‘ℂ_fld) ↾_s {1, -1})

**Assertion**
Ref	Expression
psgnghm2	⊢ (𝐷 ∈ Fin → 𝑁 ∈ (𝑆 GrpHom 𝑈))

Proof of Theorem psgnghm2 Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		psgnghm2.s	. . 3 ⊢ 𝑆 = (SymGrp‘𝐷)
2		psgnghm2.n	. . 3 ⊢ 𝑁 = (pmSgn‘𝐷)
3		eqid 2737	. . 3 ⊢ (𝑆 ↾_s dom 𝑁) = (𝑆 ↾_s dom 𝑁)
4		psgnghm2.u	. . 3 ⊢ 𝑈 = ((mulGrp‘ℂ_fld) ↾_s {1, -1})
5	1, 2, 3, 4	psgnghm 21573	. 2 ⊢ (𝐷 ∈ Fin → 𝑁 ∈ ((𝑆 ↾_s dom 𝑁) GrpHom 𝑈))
6		eqid 2737	. . . . . . . 8 ⊢ (Base‘𝑆) = (Base‘𝑆)
7	1, 6	sygbasnfpfi 19481	. . . . . . 7 ⊢ ((𝐷 ∈ Fin ∧ 𝑥 ∈ (Base‘𝑆)) → dom (𝑥 ∖ I ) ∈ Fin)
8	7	ralrimiva 3130	. . . . . 6 ⊢ (𝐷 ∈ Fin → ∀𝑥 ∈ (Base‘𝑆)dom (𝑥 ∖ I ) ∈ Fin)
9		rabid2 3423	. . . . . 6 ⊢ ((Base‘𝑆) = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} ↔ ∀𝑥 ∈ (Base‘𝑆)dom (𝑥 ∖ I ) ∈ Fin)
10	8, 9	sylibr 234	. . . . 5 ⊢ (𝐷 ∈ Fin → (Base‘𝑆) = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin})
11		eqid 2737	. . . . . . 7 ⊢ {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin} = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
12	1, 6, 11, 2	psgnfn 19470	. . . . . 6 ⊢ 𝑁 Fn {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
13	12	fndmi 6597	. . . . 5 ⊢ dom 𝑁 = {𝑥 ∈ (Base‘𝑆) ∣ dom (𝑥 ∖ I ) ∈ Fin}
14	10, 13	eqtr4di 2790	. . . 4 ⊢ (𝐷 ∈ Fin → (Base‘𝑆) = dom 𝑁)
15		eqimss 3981	. . . 4 ⊢ ((Base‘𝑆) = dom 𝑁 → (Base‘𝑆) ⊆ dom 𝑁)
16	1	fvexi 6849	. . . . 5 ⊢ 𝑆 ∈ V
17	2	fvexi 6849	. . . . . 6 ⊢ 𝑁 ∈ V
18	17	dmex 7854	. . . . 5 ⊢ dom 𝑁 ∈ V
19	3, 6	ressid2 17198	. . . . 5 ⊢ (((Base‘𝑆) ⊆ dom 𝑁 ∧ 𝑆 ∈ V ∧ dom 𝑁 ∈ V) → (𝑆 ↾_s dom 𝑁) = 𝑆)
20	16, 18, 19	mp3an23 1456	. . . 4 ⊢ ((Base‘𝑆) ⊆ dom 𝑁 → (𝑆 ↾_s dom 𝑁) = 𝑆)
21	14, 15, 20	3syl 18	. . 3 ⊢ (𝐷 ∈ Fin → (𝑆 ↾_s dom 𝑁) = 𝑆)
22	21	oveq1d 7376	. 2 ⊢ (𝐷 ∈ Fin → ((𝑆 ↾_s dom 𝑁) GrpHom 𝑈) = (𝑆 GrpHom 𝑈))
23	5, 22	eleqtrd 2839	1 ⊢ (𝐷 ∈ Fin → 𝑁 ∈ (𝑆 GrpHom 𝑈))

Colors of variables: wff setvar class

Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ∀wral 3052 {crab 3390 Vcvv 3430 ∖ cdif 3887 ⊆ wss 3890 {cpr 4570 I cid 5519 dom cdm 5625 ‘cfv 6493 (class class class)co 7361 Fincfn 8887 1c1 11033 -cneg 11372 Basecbs 17173 ↾_s cress 17194 GrpHom cghm 19181 SymGrpcsymg 19338 pmSgncpsgn 19458 mulGrpcmgp 20115 ℂ_fldccnfld 21347

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 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 ax-addf 11111 ax-mulf 11112

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-xor 1514 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 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-ot 4577 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 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 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-tpos 8170 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 9857 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-div 11802 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 df-n0 12432 df-xnn0 12505 df-z 12519 df-dec 12639 df-uz 12783 df-rp 12937 df-fz 13456 df-fzo 13603 df-seq 13958 df-exp 14018 df-hash 14287 df-word 14470 df-lsw 14519 df-concat 14527 df-s1 14553 df-substr 14598 df-pfx 14628 df-splice 14706 df-reverse 14715 df-s2 14804 df-struct 17111 df-sets 17128 df-slot 17146 df-ndx 17158 df-base 17174 df-ress 17195 df-plusg 17227 df-mulr 17228 df-starv 17229 df-tset 17233 df-ple 17234 df-ds 17236 df-unif 17237 df-0g 17398 df-gsum 17399 df-mre 17542 df-mrc 17543 df-acs 17545 df-mgm 18602 df-sgrp 18681 df-mnd 18697 df-mhm 18745 df-submnd 18746 df-efmnd 18831 df-grp 18906 df-minusg 18907 df-subg 19093 df-ghm 19182 df-gim 19228 df-oppg 19315 df-symg 19339 df-pmtr 19411 df-psgn 19460 df-cmn 19751 df-abl 19752 df-mgp 20116 df-rng 20128 df-ur 20157 df-ring 20210 df-cring 20211 df-oppr 20311 df-dvdsr 20331 df-unit 20332 df-invr 20362 df-dvr 20375 df-drng 20702 df-cnfld 21348

This theorem is referenced by: psgninv 21575 psgnco 21576 zrhpsgnmhm 21577 zrhpsgninv 21578 psgnevpmb 21580 psgnodpm 21581 zrhpsgnevpm 21584 zrhpsgnodpm 21585 evpmodpmf1o 21589 mdetralt 22586 psgnid 33176 evpmsubg 33226 altgnsg 33228

W3C validator