| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > psgnprfval1 | Structured version Visualization version GIF version | ||
| Description: The permutation sign of the identity for a pair. (Contributed by AV, 11-Dec-2018.) |
| Ref | Expression |
|---|---|
| psgnprfval.0 | ⊢ 𝐷 = {1, 2} |
| psgnprfval.g | ⊢ 𝐺 = (SymGrp‘𝐷) |
| psgnprfval.b | ⊢ 𝐵 = (Base‘𝐺) |
| psgnprfval.t | ⊢ 𝑇 = ran (pmTrsp‘𝐷) |
| psgnprfval.n | ⊢ 𝑁 = (pmSgn‘𝐷) |
| Ref | Expression |
|---|---|
| psgnprfval1 | ⊢ (𝑁‘{〈1, 1〉, 〈2, 2〉}) = 1 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | psgnprfval.0 | . . . . . . 7 ⊢ 𝐷 = {1, 2} | |
| 2 | prex 5395 | . . . . . . 7 ⊢ {1, 2} ∈ V | |
| 3 | 1, 2 | eqeltri 2858 | . . . . . 6 ⊢ 𝐷 ∈ V |
| 4 | psgnprfval.g | . . . . . . 7 ⊢ 𝐺 = (SymGrp‘𝐷) | |
| 5 | 4 | symgid 19441 | . . . . . 6 ⊢ (𝐷 ∈ V → ( I ↾ 𝐷) = (0g‘𝐺)) |
| 6 | 3, 5 | ax-mp 5 | . . . . 5 ⊢ ( I ↾ 𝐷) = (0g‘𝐺) |
| 7 | 6 | gsum0 18718 | . . . 4 ⊢ (𝐺 Σg ∅) = ( I ↾ 𝐷) |
| 8 | reseq2 5960 | . . . . . 6 ⊢ (𝐷 = {1, 2} → ( I ↾ 𝐷) = ( I ↾ {1, 2})) | |
| 9 | 1ex 11176 | . . . . . . 7 ⊢ 1 ∈ V | |
| 10 | 2nn 12291 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 11 | residpr 7125 | . . . . . . 7 ⊢ ((1 ∈ V ∧ 2 ∈ ℕ) → ( I ↾ {1, 2}) = {〈1, 1〉, 〈2, 2〉}) | |
| 12 | 9, 10, 11 | mp2an 702 | . . . . . 6 ⊢ ( I ↾ {1, 2}) = {〈1, 1〉, 〈2, 2〉} |
| 13 | 8, 12 | eqtrdi 2813 | . . . . 5 ⊢ (𝐷 = {1, 2} → ( I ↾ 𝐷) = {〈1, 1〉, 〈2, 2〉}) |
| 14 | 1, 13 | ax-mp 5 | . . . 4 ⊢ ( I ↾ 𝐷) = {〈1, 1〉, 〈2, 2〉} |
| 15 | 7, 14 | eqtr2i 2786 | . . 3 ⊢ {〈1, 1〉, 〈2, 2〉} = (𝐺 Σg ∅) |
| 16 | 15 | fveq2i 6870 | . 2 ⊢ (𝑁‘{〈1, 1〉, 〈2, 2〉}) = (𝑁‘(𝐺 Σg ∅)) |
| 17 | wrd0 14552 | . . 3 ⊢ ∅ ∈ Word 𝑇 | |
| 18 | psgnprfval.t | . . . 4 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 19 | psgnprfval.n | . . . 4 ⊢ 𝑁 = (pmSgn‘𝐷) | |
| 20 | 4, 18, 19 | psgnvalii 19549 | . . 3 ⊢ ((𝐷 ∈ V ∧ ∅ ∈ Word 𝑇) → (𝑁‘(𝐺 Σg ∅)) = (-1↑(♯‘∅))) |
| 21 | 3, 17, 20 | mp2an 702 | . 2 ⊢ (𝑁‘(𝐺 Σg ∅)) = (-1↑(♯‘∅)) |
| 22 | hash0 14380 | . . . 4 ⊢ (♯‘∅) = 0 | |
| 23 | 22 | oveq2i 7407 | . . 3 ⊢ (-1↑(♯‘∅)) = (-1↑0) |
| 24 | neg1cn 12180 | . . . 4 ⊢ -1 ∈ ℂ | |
| 25 | exp0 14078 | . . . 4 ⊢ (-1 ∈ ℂ → (-1↑0) = 1) | |
| 26 | 24, 25 | ax-mp 5 | . . 3 ⊢ (-1↑0) = 1 |
| 27 | 23, 26 | eqtri 2785 | . 2 ⊢ (-1↑(♯‘∅)) = 1 |
| 28 | 16, 21, 27 | 3eqtri 2789 | 1 ⊢ (𝑁‘{〈1, 1〉, 〈2, 2〉}) = 1 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1560 ∈ wcel 2142 Vcvv 3454 ∅c0 4285 {cpr 4584 〈cop 4588 I cid 5541 ran crn 5648 ↾ cres 5649 ‘cfv 6521 (class class class)co 7396 ℂcc 11071 0cc0 11073 1c1 11074 -cneg 11415 ℕcn 12210 2c2 12272 ↑cexp 14074 ♯chash 14343 Word cword 14526 Basecbs 17245 0gc0g 17468 Σg cgsu 17469 SymGrpcsymg 19409 pmTrspcpmtr 19481 pmSgncpsgn 19529 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 ax-cnex 11129 ax-resscn 11130 ax-1cn 11131 ax-icn 11132 ax-addcl 11133 ax-addrcl 11134 ax-mulcl 11135 ax-mulrcl 11136 ax-mulcom 11137 ax-addass 11138 ax-mulass 11139 ax-distr 11140 ax-i2m1 11141 ax-1ne0 11142 ax-1rid 11143 ax-rnegex 11144 ax-rrecex 11145 ax-cnre 11146 ax-pre-lttri 11147 ax-pre-lttrn 11148 ax-pre-ltadd 11149 ax-pre-mulgt0 11150 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1099 df-3an 1100 df-xor 1532 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-pss 3924 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-ot 4591 df-uni 4866 df-int 4906 df-iun 4951 df-iin 4952 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5542 df-eprel 5547 df-po 5555 df-so 5556 df-fr 5600 df-se 5601 df-we 5602 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-pred 6288 df-ord 6349 df-on 6350 df-lim 6351 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-isom 6530 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7847 df-1st 7970 df-2nd 7971 df-tpos 8206 df-frecs 8262 df-wrecs 8293 df-recs 8342 df-rdg 8381 df-1o 8437 df-2o 8438 df-er 8678 df-map 8810 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-card 9897 df-pnf 11218 df-mnf 11219 df-xr 11220 df-ltxr 11221 df-le 11222 df-sub 11416 df-neg 11417 df-div 11845 df-nn 12211 df-2 12280 df-3 12281 df-4 12282 df-5 12283 df-6 12284 df-7 12285 df-8 12286 df-9 12287 df-n0 12482 df-xnn0 12555 df-z 12569 df-uz 12840 df-rp 12994 df-fz 13513 df-fzo 13660 df-seq 14015 df-exp 14075 df-hash 14344 df-word 14527 df-lsw 14576 df-concat 14584 df-s1 14610 df-substr 14655 df-pfx 14685 df-splice 14763 df-reverse 14772 df-s2 14861 df-struct 17183 df-sets 17200 df-slot 17218 df-ndx 17230 df-base 17246 df-ress 17267 df-plusg 17299 df-tset 17305 df-0g 17470 df-gsum 17471 df-mre 17614 df-mrc 17615 df-acs 17617 df-mgm 18674 df-sgrp 18753 df-mnd 18769 df-mhm 18817 df-submnd 18818 df-efmnd 18903 df-grp 18978 df-minusg 18979 df-subg 19165 df-ghm 19254 df-gim 19299 df-oppg 19386 df-symg 19410 df-pmtr 19482 df-psgn 19531 |
| This theorem is referenced by: m2detleiblem1 22681 m2detleiblem5 22682 |
| Copyright terms: Public domain | W3C validator |