| 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 5409 | . . . . . . 7 ⊢ {1, 2} ∈ V | |
| 3 | 1, 2 | eqeltri 2859 | . . . . . 6 ⊢ 𝐷 ∈ V |
| 4 | psgnprfval.g | . . . . . . 7 ⊢ 𝐺 = (SymGrp‘𝐷) | |
| 5 | 4 | symgid 19466 | . . . . . 6 ⊢ (𝐷 ∈ V → ( I ↾ 𝐷) = (0g‘𝐺)) |
| 6 | 3, 5 | ax-mp 5 | . . . . 5 ⊢ ( I ↾ 𝐷) = (0g‘𝐺) |
| 7 | 6 | gsum0 18737 | . . . 4 ⊢ (𝐺 Σg ∅) = ( I ↾ 𝐷) |
| 8 | reseq2 5973 | . . . . . 6 ⊢ (𝐷 = {1, 2} → ( I ↾ 𝐷) = ( I ↾ {1, 2})) | |
| 9 | 1ex 11198 | . . . . . . 7 ⊢ 1 ∈ V | |
| 10 | 2nn 12309 | . . . . . . 7 ⊢ 2 ∈ ℕ | |
| 11 | residpr 7139 | . . . . . . 7 ⊢ ((1 ∈ V ∧ 2 ∈ ℕ) → ( I ↾ {1, 2}) = {〈1, 1〉, 〈2, 2〉}) | |
| 12 | 9, 10, 11 | mp2an 704 | . . . . . 6 ⊢ ( I ↾ {1, 2}) = {〈1, 1〉, 〈2, 2〉} |
| 13 | 8, 12 | eqtrdi 2814 | . . . . 5 ⊢ (𝐷 = {1, 2} → ( I ↾ 𝐷) = {〈1, 1〉, 〈2, 2〉}) |
| 14 | 1, 13 | ax-mp 5 | . . . 4 ⊢ ( I ↾ 𝐷) = {〈1, 1〉, 〈2, 2〉} |
| 15 | 7, 14 | eqtr2i 2787 | . . 3 ⊢ {〈1, 1〉, 〈2, 2〉} = (𝐺 Σg ∅) |
| 16 | 15 | fveq2i 6884 | . 2 ⊢ (𝑁‘{〈1, 1〉, 〈2, 2〉}) = (𝑁‘(𝐺 Σg ∅)) |
| 17 | wrd0 14572 | . . 3 ⊢ ∅ ∈ Word 𝑇 | |
| 18 | psgnprfval.t | . . . 4 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 19 | psgnprfval.n | . . . 4 ⊢ 𝑁 = (pmSgn‘𝐷) | |
| 20 | 4, 18, 19 | psgnvalii 19574 | . . 3 ⊢ ((𝐷 ∈ V ∧ ∅ ∈ Word 𝑇) → (𝑁‘(𝐺 Σg ∅)) = (-1↑(♯‘∅))) |
| 21 | 3, 17, 20 | mp2an 704 | . 2 ⊢ (𝑁‘(𝐺 Σg ∅)) = (-1↑(♯‘∅)) |
| 22 | hash0 14399 | . . . 4 ⊢ (♯‘∅) = 0 | |
| 23 | 22 | oveq2i 7421 | . . 3 ⊢ (-1↑(♯‘∅)) = (-1↑0) |
| 24 | neg1cn 12198 | . . . 4 ⊢ -1 ∈ ℂ | |
| 25 | exp0 14097 | . . . 4 ⊢ (-1 ∈ ℂ → (-1↑0) = 1) | |
| 26 | 24, 25 | ax-mp 5 | . . 3 ⊢ (-1↑0) = 1 |
| 27 | 23, 26 | eqtri 2786 | . 2 ⊢ (-1↑(♯‘∅)) = 1 |
| 28 | 16, 21, 27 | 3eqtri 2790 | 1 ⊢ (𝑁‘{〈1, 1〉, 〈2, 2〉}) = 1 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1570 ∈ wcel 2143 Vcvv 3455 ∅c0 4286 {cpr 4591 〈cop 4595 I cid 5555 ran crn 5662 ↾ cres 5663 ‘cfv 6536 (class class class)co 7410 ℂcc 11093 0cc0 11095 1c1 11096 -cneg 11437 ℕcn 12228 2c2 12290 ↑cexp 14093 ♯chash 14362 Word cword 14546 Basecbs 17264 0gc0g 17487 Σg cgsu 17488 SymGrpcsymg 19434 pmTrspcpmtr 19506 pmSgncpsgn 19554 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5238 ax-sep 5257 ax-nul 5269 ax-pow 5336 ax-pr 5404 ax-un 7732 ax-cnex 11151 ax-resscn 11152 ax-1cn 11153 ax-icn 11154 ax-addcl 11155 ax-addrcl 11156 ax-mulcl 11157 ax-mulrcl 11158 ax-mulcom 11159 ax-addass 11160 ax-mulass 11161 ax-distr 11162 ax-i2m1 11163 ax-1ne0 11164 ax-1rid 11165 ax-rnegex 11166 ax-rrecex 11167 ax-cnre 11168 ax-pre-lttri 11169 ax-pre-lttrn 11170 ax-pre-ltadd 11171 ax-pre-mulgt0 11172 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1104 df-3an 1105 df-xor 1542 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3457 df-sbc 3745 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-pss 3925 df-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-ot 4598 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5110 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5556 df-eprel 5561 df-po 5569 df-so 5570 df-fr 5614 df-se 5615 df-we 5616 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-pred 6302 df-ord 6363 df-on 6364 df-lim 6365 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-isom 6545 df-riota 7367 df-ov 7413 df-oprab 7414 df-mpo 7415 df-om 7859 df-1st 7982 df-2nd 7983 df-tpos 8218 df-frecs 8274 df-wrecs 8305 df-recs 8354 df-rdg 8393 df-1o 8449 df-2o 8450 df-er 8690 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-card 9921 df-pnf 11240 df-mnf 11241 df-xr 11242 df-ltxr 11243 df-le 11244 df-sub 11438 df-neg 11439 df-div 11867 df-nn 12229 df-2 12298 df-3 12299 df-4 12300 df-5 12301 df-6 12302 df-7 12303 df-8 12304 df-9 12305 df-n0 12500 df-xnn0 12573 df-z 12587 df-uz 12858 df-rp 13012 df-fz 13531 df-fzo 13679 df-seq 14034 df-exp 14094 df-hash 14363 df-word 14547 df-lsw 14596 df-concat 14604 df-s1 14630 df-substr 14675 df-pfx 14705 df-splice 14783 df-reverse 14792 df-s2 14881 df-struct 17202 df-sets 17219 df-slot 17237 df-ndx 17249 df-base 17265 df-ress 17286 df-plusg 17318 df-tset 17324 df-0g 17489 df-gsum 17490 df-mre 17633 df-mrc 17634 df-acs 17636 df-mgm 18693 df-sgrp 18772 df-mnd 18788 df-mhm 18836 df-submnd 18837 df-efmnd 18923 df-grp 18998 df-minusg 18999 df-subg 19184 df-ghm 19279 df-gim 19324 df-oppg 19411 df-symg 19435 df-pmtr 19507 df-psgn 19556 |
| This theorem is referenced by: m2detleiblem1 22781 m2detleiblem5 22782 |
| Copyright terms: Public domain | W3C validator |