| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > psgnevpmb | Structured version Visualization version GIF version | ||
| Description: A class is an even permutation if it is a permutation with sign 1. (Contributed by SO, 9-Jul-2018.) |
| Ref | Expression |
|---|---|
| evpmss.s | ⊢ 𝑆 = (SymGrp‘𝐷) |
| evpmss.p | ⊢ 𝑃 = (Base‘𝑆) |
| psgnevpmb.n | ⊢ 𝑁 = (pmSgn‘𝐷) |
| Ref | Expression |
|---|---|
| psgnevpmb | ⊢ (𝐷 ∈ Fin → (𝐹 ∈ (pmEven‘𝐷) ↔ (𝐹 ∈ 𝑃 ∧ (𝑁‘𝐹) = 1))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 3460 | . . . 4 ⊢ (𝐷 ∈ Fin → 𝐷 ∈ V) | |
| 2 | fveq2 6833 | . . . . . . . 8 ⊢ (𝑑 = 𝐷 → (pmSgn‘𝑑) = (pmSgn‘𝐷)) | |
| 3 | psgnevpmb.n | . . . . . . . 8 ⊢ 𝑁 = (pmSgn‘𝐷) | |
| 4 | 2, 3 | eqtr4di 2788 | . . . . . . 7 ⊢ (𝑑 = 𝐷 → (pmSgn‘𝑑) = 𝑁) |
| 5 | 4 | cnveqd 5823 | . . . . . 6 ⊢ (𝑑 = 𝐷 → ◡(pmSgn‘𝑑) = ◡𝑁) |
| 6 | 5 | imaeq1d 6017 | . . . . 5 ⊢ (𝑑 = 𝐷 → (◡(pmSgn‘𝑑) “ {1}) = (◡𝑁 “ {1})) |
| 7 | df-evpm 19423 | . . . . 5 ⊢ pmEven = (𝑑 ∈ V ↦ (◡(pmSgn‘𝑑) “ {1})) | |
| 8 | 3 | fvexi 6847 | . . . . . . 7 ⊢ 𝑁 ∈ V |
| 9 | 8 | cnvex 7867 | . . . . . 6 ⊢ ◡𝑁 ∈ V |
| 10 | 9 | imaex 7856 | . . . . 5 ⊢ (◡𝑁 “ {1}) ∈ V |
| 11 | 6, 7, 10 | fvmpt 6940 | . . . 4 ⊢ (𝐷 ∈ V → (pmEven‘𝐷) = (◡𝑁 “ {1})) |
| 12 | 1, 11 | syl 17 | . . 3 ⊢ (𝐷 ∈ Fin → (pmEven‘𝐷) = (◡𝑁 “ {1})) |
| 13 | 12 | eleq2d 2821 | . 2 ⊢ (𝐷 ∈ Fin → (𝐹 ∈ (pmEven‘𝐷) ↔ 𝐹 ∈ (◡𝑁 “ {1}))) |
| 14 | evpmss.s | . . . 4 ⊢ 𝑆 = (SymGrp‘𝐷) | |
| 15 | eqid 2735 | . . . 4 ⊢ ((mulGrp‘ℂfld) ↾s {1, -1}) = ((mulGrp‘ℂfld) ↾s {1, -1}) | |
| 16 | 14, 3, 15 | psgnghm2 21538 | . . 3 ⊢ (𝐷 ∈ Fin → 𝑁 ∈ (𝑆 GrpHom ((mulGrp‘ℂfld) ↾s {1, -1}))) |
| 17 | evpmss.p | . . . 4 ⊢ 𝑃 = (Base‘𝑆) | |
| 18 | eqid 2735 | . . . 4 ⊢ (Base‘((mulGrp‘ℂfld) ↾s {1, -1})) = (Base‘((mulGrp‘ℂfld) ↾s {1, -1})) | |
| 19 | 17, 18 | ghmf 19151 | . . 3 ⊢ (𝑁 ∈ (𝑆 GrpHom ((mulGrp‘ℂfld) ↾s {1, -1})) → 𝑁:𝑃⟶(Base‘((mulGrp‘ℂfld) ↾s {1, -1}))) |
| 20 | ffn 6661 | . . 3 ⊢ (𝑁:𝑃⟶(Base‘((mulGrp‘ℂfld) ↾s {1, -1})) → 𝑁 Fn 𝑃) | |
| 21 | fniniseg 7005 | . . 3 ⊢ (𝑁 Fn 𝑃 → (𝐹 ∈ (◡𝑁 “ {1}) ↔ (𝐹 ∈ 𝑃 ∧ (𝑁‘𝐹) = 1))) | |
| 22 | 16, 19, 20, 21 | 4syl 19 | . 2 ⊢ (𝐷 ∈ Fin → (𝐹 ∈ (◡𝑁 “ {1}) ↔ (𝐹 ∈ 𝑃 ∧ (𝑁‘𝐹) = 1))) |
| 23 | 13, 22 | bitrd 279 | 1 ⊢ (𝐷 ∈ Fin → (𝐹 ∈ (pmEven‘𝐷) ↔ (𝐹 ∈ 𝑃 ∧ (𝑁‘𝐹) = 1))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 Vcvv 3439 {csn 4579 {cpr 4581 ◡ccnv 5622 “ cima 5626 Fn wfn 6486 ⟶wf 6487 ‘cfv 6491 (class class class)co 7358 Fincfn 8885 1c1 11029 -cneg 11367 Basecbs 17138 ↾s cress 17159 GrpHom cghm 19143 SymGrpcsymg 19300 pmSgncpsgn 19420 pmEvencevpm 19421 mulGrpcmgp 20077 ℂfldccnfld 21311 |
| 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 2183 ax-ext 2707 ax-rep 5223 ax-sep 5240 ax-nul 5250 ax-pow 5309 ax-pr 5376 ax-un 7680 ax-cnex 11084 ax-resscn 11085 ax-1cn 11086 ax-icn 11087 ax-addcl 11088 ax-addrcl 11089 ax-mulcl 11090 ax-mulrcl 11091 ax-mulcom 11092 ax-addass 11093 ax-mulass 11094 ax-distr 11095 ax-i2m1 11096 ax-1ne0 11097 ax-1rid 11098 ax-rnegex 11099 ax-rrecex 11100 ax-cnre 11101 ax-pre-lttri 11102 ax-pre-lttrn 11103 ax-pre-ltadd 11104 ax-pre-mulgt0 11105 ax-addf 11107 ax-mulf 11108 |
| 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 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3349 df-reu 3350 df-rab 3399 df-v 3441 df-sbc 3740 df-csb 3849 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-pss 3920 df-nul 4285 df-if 4479 df-pw 4555 df-sn 4580 df-pr 4582 df-tp 4584 df-op 4586 df-ot 4588 df-uni 4863 df-int 4902 df-iun 4947 df-iin 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5518 df-eprel 5523 df-po 5531 df-so 5532 df-fr 5576 df-se 5577 df-we 5578 df-xp 5629 df-rel 5630 df-cnv 5631 df-co 5632 df-dm 5633 df-rn 5634 df-res 5635 df-ima 5636 df-pred 6258 df-ord 6319 df-on 6320 df-lim 6321 df-suc 6322 df-iota 6447 df-fun 6493 df-fn 6494 df-f 6495 df-f1 6496 df-fo 6497 df-f1o 6498 df-fv 6499 df-isom 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-1st 7933 df-2nd 7934 df-tpos 8168 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-map 8767 df-en 8886 df-dom 8887 df-sdom 8888 df-fin 8889 df-card 9853 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12148 df-2 12210 df-3 12211 df-4 12212 df-5 12213 df-6 12214 df-7 12215 df-8 12216 df-9 12217 df-n0 12404 df-xnn0 12477 df-z 12491 df-dec 12610 df-uz 12754 df-rp 12908 df-fz 13426 df-fzo 13573 df-seq 13927 df-exp 13987 df-hash 14256 df-word 14439 df-lsw 14488 df-concat 14496 df-s1 14522 df-substr 14567 df-pfx 14597 df-splice 14675 df-reverse 14684 df-s2 14773 df-struct 17076 df-sets 17093 df-slot 17111 df-ndx 17123 df-base 17139 df-ress 17160 df-plusg 17192 df-mulr 17193 df-starv 17194 df-tset 17198 df-ple 17199 df-ds 17201 df-unif 17202 df-0g 17363 df-gsum 17364 df-mre 17507 df-mrc 17508 df-acs 17510 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-mhm 18710 df-submnd 18711 df-efmnd 18796 df-grp 18868 df-minusg 18869 df-subg 19055 df-ghm 19144 df-gim 19190 df-oppg 19277 df-symg 19301 df-pmtr 19373 df-psgn 19422 df-evpm 19423 df-cmn 19713 df-abl 19714 df-mgp 20078 df-rng 20090 df-ur 20119 df-ring 20172 df-cring 20173 df-oppr 20275 df-dvdsr 20295 df-unit 20296 df-invr 20326 df-dvr 20339 df-drng 20666 df-cnfld 21312 |
| This theorem is referenced by: psgnodpm 21545 psgnevpm 21546 evpmodpmf1o 21553 mdet0pr 22538 odpmco 33147 evpmid 33209 cyc3evpm 33211 |
| Copyright terms: Public domain | W3C validator |