![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > psgndmfi | Structured version Visualization version GIF version |
Description: For a finite base set, the permutation sign is defined for all permutations. (Contributed by Thierry Arnoux, 22-Aug-2020.) |
Ref | Expression |
---|---|
psgndmfi.s | ⊢ 𝑆 = (pmSgn‘𝐷) |
psgndmfi.g | ⊢ 𝐺 = (Base‘(SymGrp‘𝐷)) |
Ref | Expression |
---|---|
psgndmfi | ⊢ (𝐷 ∈ Fin → 𝑆 Fn 𝐺) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2728 | . . 3 ⊢ (SymGrp‘𝐷) = (SymGrp‘𝐷) | |
2 | psgndmfi.g | . . 3 ⊢ 𝐺 = (Base‘(SymGrp‘𝐷)) | |
3 | eqid 2728 | . . 3 ⊢ {𝑝 ∈ 𝐺 ∣ dom (𝑝 ∖ I ) ∈ Fin} = {𝑝 ∈ 𝐺 ∣ dom (𝑝 ∖ I ) ∈ Fin} | |
4 | psgndmfi.s | . . 3 ⊢ 𝑆 = (pmSgn‘𝐷) | |
5 | 1, 2, 3, 4 | psgnfn 19470 | . 2 ⊢ 𝑆 Fn {𝑝 ∈ 𝐺 ∣ dom (𝑝 ∖ I ) ∈ Fin} |
6 | 1, 2 | sygbasnfpfi 19481 | . . . . . 6 ⊢ ((𝐷 ∈ Fin ∧ 𝑝 ∈ 𝐺) → dom (𝑝 ∖ I ) ∈ Fin) |
7 | 6 | ralrimiva 3143 | . . . . 5 ⊢ (𝐷 ∈ Fin → ∀𝑝 ∈ 𝐺 dom (𝑝 ∖ I ) ∈ Fin) |
8 | rabid2 3463 | . . . . 5 ⊢ (𝐺 = {𝑝 ∈ 𝐺 ∣ dom (𝑝 ∖ I ) ∈ Fin} ↔ ∀𝑝 ∈ 𝐺 dom (𝑝 ∖ I ) ∈ Fin) | |
9 | 7, 8 | sylibr 233 | . . . 4 ⊢ (𝐷 ∈ Fin → 𝐺 = {𝑝 ∈ 𝐺 ∣ dom (𝑝 ∖ I ) ∈ Fin}) |
10 | 9 | eqcomd 2734 | . . 3 ⊢ (𝐷 ∈ Fin → {𝑝 ∈ 𝐺 ∣ dom (𝑝 ∖ I ) ∈ Fin} = 𝐺) |
11 | 10 | fneq2d 6653 | . 2 ⊢ (𝐷 ∈ Fin → (𝑆 Fn {𝑝 ∈ 𝐺 ∣ dom (𝑝 ∖ I ) ∈ Fin} ↔ 𝑆 Fn 𝐺)) |
12 | 5, 11 | mpbii 232 | 1 ⊢ (𝐷 ∈ Fin → 𝑆 Fn 𝐺) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1533 ∈ wcel 2098 ∀wral 3058 {crab 3430 ∖ cdif 3946 I cid 5579 dom cdm 5682 Fn wfn 6548 ‘cfv 6553 Fincfn 8972 Basecbs 17189 SymGrpcsymg 19335 pmSgncpsgn 19458 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2699 ax-rep 5289 ax-sep 5303 ax-nul 5310 ax-pow 5369 ax-pr 5433 ax-un 7748 ax-cnex 11204 ax-resscn 11205 ax-1cn 11206 ax-icn 11207 ax-addcl 11208 ax-addrcl 11209 ax-mulcl 11210 ax-mulrcl 11211 ax-mulcom 11212 ax-addass 11213 ax-mulass 11214 ax-distr 11215 ax-i2m1 11216 ax-1ne0 11217 ax-1rid 11218 ax-rnegex 11219 ax-rrecex 11220 ax-cnre 11221 ax-pre-lttri 11222 ax-pre-lttrn 11223 ax-pre-ltadd 11224 ax-pre-mulgt0 11225 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2529 df-eu 2558 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-reu 3375 df-rab 3431 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4327 df-if 4533 df-pw 4608 df-sn 4633 df-pr 4635 df-tp 4637 df-op 4639 df-uni 4913 df-int 4954 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-tr 5270 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6310 df-ord 6377 df-on 6378 df-lim 6379 df-suc 6380 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-riota 7382 df-ov 7429 df-oprab 7430 df-mpo 7431 df-om 7879 df-1st 8001 df-2nd 8002 df-frecs 8295 df-wrecs 8326 df-recs 8400 df-rdg 8439 df-1o 8495 df-er 8733 df-map 8855 df-en 8973 df-dom 8974 df-sdom 8975 df-fin 8976 df-card 9972 df-pnf 11290 df-mnf 11291 df-xr 11292 df-ltxr 11293 df-le 11294 df-sub 11486 df-neg 11487 df-nn 12253 df-2 12315 df-3 12316 df-4 12317 df-5 12318 df-6 12319 df-7 12320 df-8 12321 df-9 12322 df-n0 12513 df-z 12599 df-uz 12863 df-fz 13527 df-fzo 13670 df-hash 14332 df-word 14507 df-struct 17125 df-sets 17142 df-slot 17160 df-ndx 17172 df-base 17190 df-ress 17219 df-plusg 17255 df-tset 17261 df-efmnd 18835 df-symg 19336 df-psgn 19460 |
This theorem is referenced by: mdetpmtr1 33465 |
Copyright terms: Public domain | W3C validator |