| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > psgnvali | Structured version Visualization version GIF version | ||
| Description: A finitary permutation has at least one representation for its parity. (Contributed by Stefan O'Rear, 28-Aug-2015.) |
| Ref | Expression |
|---|---|
| psgnval.g | ⊢ 𝐺 = (SymGrp‘𝐷) |
| psgnval.t | ⊢ 𝑇 = ran (pmTrsp‘𝐷) |
| psgnval.n | ⊢ 𝑁 = (pmSgn‘𝐷) |
| Ref | Expression |
|---|---|
| psgnvali | ⊢ (𝑃 ∈ dom 𝑁 → ∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ (𝑁‘𝑃) = (-1↑(♯‘𝑤)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | psgnval.g | . . . 4 ⊢ 𝐺 = (SymGrp‘𝐷) | |
| 2 | psgnval.t | . . . 4 ⊢ 𝑇 = ran (pmTrsp‘𝐷) | |
| 3 | psgnval.n | . . . 4 ⊢ 𝑁 = (pmSgn‘𝐷) | |
| 4 | 1, 2, 3 | psgnval 19413 | . . 3 ⊢ (𝑃 ∈ dom 𝑁 → (𝑁‘𝑃) = (℩𝑠∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤))))) |
| 5 | 1, 2, 3 | psgneu 19412 | . . . 4 ⊢ (𝑃 ∈ dom 𝑁 → ∃!𝑠∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤)))) |
| 6 | iotacl 6485 | . . . 4 ⊢ (∃!𝑠∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤))) → (℩𝑠∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤)))) ∈ {𝑠 ∣ ∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤)))}) | |
| 7 | 5, 6 | syl 17 | . . 3 ⊢ (𝑃 ∈ dom 𝑁 → (℩𝑠∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤)))) ∈ {𝑠 ∣ ∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤)))}) |
| 8 | 4, 7 | eqeltrd 2828 | . 2 ⊢ (𝑃 ∈ dom 𝑁 → (𝑁‘𝑃) ∈ {𝑠 ∣ ∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤)))}) |
| 9 | fvex 6853 | . . 3 ⊢ (𝑁‘𝑃) ∈ V | |
| 10 | eqeq1 2733 | . . . . 5 ⊢ (𝑠 = (𝑁‘𝑃) → (𝑠 = (-1↑(♯‘𝑤)) ↔ (𝑁‘𝑃) = (-1↑(♯‘𝑤)))) | |
| 11 | 10 | anbi2d 630 | . . . 4 ⊢ (𝑠 = (𝑁‘𝑃) → ((𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤))) ↔ (𝑃 = (𝐺 Σg 𝑤) ∧ (𝑁‘𝑃) = (-1↑(♯‘𝑤))))) |
| 12 | 11 | rexbidv 3157 | . . 3 ⊢ (𝑠 = (𝑁‘𝑃) → (∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤))) ↔ ∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ (𝑁‘𝑃) = (-1↑(♯‘𝑤))))) |
| 13 | 9, 12 | elab 3643 | . 2 ⊢ ((𝑁‘𝑃) ∈ {𝑠 ∣ ∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ 𝑠 = (-1↑(♯‘𝑤)))} ↔ ∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ (𝑁‘𝑃) = (-1↑(♯‘𝑤)))) |
| 14 | 8, 13 | sylib 218 | 1 ⊢ (𝑃 ∈ dom 𝑁 → ∃𝑤 ∈ Word 𝑇(𝑃 = (𝐺 Σg 𝑤) ∧ (𝑁‘𝑃) = (-1↑(♯‘𝑤)))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∃!weu 2561 {cab 2707 ∃wrex 3053 dom cdm 5631 ran crn 5632 ℩cio 6450 ‘cfv 6499 (class class class)co 7369 1c1 11045 -cneg 11382 ↑cexp 14002 ♯chash 14271 Word cword 14454 Σg cgsu 17379 SymGrpcsymg 19275 pmTrspcpmtr 19347 pmSgncpsgn 19395 |
| 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 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 ax-cnex 11100 ax-resscn 11101 ax-1cn 11102 ax-icn 11103 ax-addcl 11104 ax-addrcl 11105 ax-mulcl 11106 ax-mulrcl 11107 ax-mulcom 11108 ax-addass 11109 ax-mulass 11110 ax-distr 11111 ax-i2m1 11112 ax-1ne0 11113 ax-1rid 11114 ax-rnegex 11115 ax-rrecex 11116 ax-cnre 11117 ax-pre-lttri 11118 ax-pre-lttrn 11119 ax-pre-ltadd 11120 ax-pre-mulgt0 11121 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-xor 1512 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-pss 3931 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-tp 4590 df-op 4592 df-ot 4594 df-uni 4868 df-int 4907 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-tr 5210 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6262 df-ord 6323 df-on 6324 df-lim 6325 df-suc 6326 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-isom 6508 df-riota 7326 df-ov 7372 df-oprab 7373 df-mpo 7374 df-om 7823 df-1st 7947 df-2nd 7948 df-tpos 8182 df-frecs 8237 df-wrecs 8268 df-recs 8317 df-rdg 8355 df-1o 8411 df-2o 8412 df-er 8648 df-map 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-card 9868 df-pnf 11186 df-mnf 11187 df-xr 11188 df-ltxr 11189 df-le 11190 df-sub 11383 df-neg 11384 df-div 11812 df-nn 12163 df-2 12225 df-3 12226 df-4 12227 df-5 12228 df-6 12229 df-7 12230 df-8 12231 df-9 12232 df-n0 12419 df-xnn0 12492 df-z 12506 df-uz 12770 df-rp 12928 df-fz 13445 df-fzo 13592 df-seq 13943 df-exp 14003 df-hash 14272 df-word 14455 df-lsw 14504 df-concat 14512 df-s1 14537 df-substr 14582 df-pfx 14612 df-splice 14691 df-reverse 14700 df-s2 14790 df-struct 17093 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-tset 17215 df-0g 17380 df-gsum 17381 df-mre 17523 df-mrc 17524 df-acs 17526 df-mgm 18543 df-sgrp 18622 df-mnd 18638 df-mhm 18686 df-submnd 18687 df-efmnd 18772 df-grp 18844 df-minusg 18845 df-subg 19031 df-ghm 19121 df-gim 19167 df-oppg 19254 df-symg 19276 df-pmtr 19348 df-psgn 19397 |
| This theorem is referenced by: psgnran 19421 psgnghm 21465 |
| Copyright terms: Public domain | W3C validator |