| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > smadiadetlem0 | Structured version Visualization version GIF version | ||
| Description: Lemma 0 for smadiadet 22583: The products of the Leibniz' formula vanish for all permutations fixing the index of the row containing the 0's and the 1 to the column with the 1. (Contributed by AV, 3-Jan-2019.) |
| Ref | Expression |
|---|---|
| marep01ma.a | ⊢ 𝐴 = (𝑁 Mat 𝑅) |
| marep01ma.b | ⊢ 𝐵 = (Base‘𝐴) |
| marep01ma.r | ⊢ 𝑅 ∈ CRing |
| marep01ma.0 | ⊢ 0 = (0g‘𝑅) |
| marep01ma.1 | ⊢ 1 = (1r‘𝑅) |
| smadiadetlem.p | ⊢ 𝑃 = (Base‘(SymGrp‘𝑁)) |
| smadiadetlem.g | ⊢ 𝐺 = (mulGrp‘𝑅) |
| Ref | Expression |
|---|---|
| smadiadetlem0 | ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → (𝐺 Σg (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)))) = 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | smadiadetlem.g | . . 3 ⊢ 𝐺 = (mulGrp‘𝑅) | |
| 2 | marep01ma.0 | . . 3 ⊢ 0 = (0g‘𝑅) | |
| 3 | marep01ma.r | . . . 4 ⊢ 𝑅 ∈ CRing | |
| 4 | 3 | a1i 11 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → 𝑅 ∈ CRing) |
| 5 | marep01ma.a | . . . . . . 7 ⊢ 𝐴 = (𝑁 Mat 𝑅) | |
| 6 | marep01ma.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐴) | |
| 7 | 5, 6 | matrcl 22325 | . . . . . 6 ⊢ (𝑀 ∈ 𝐵 → (𝑁 ∈ Fin ∧ 𝑅 ∈ V)) |
| 8 | 7 | simpld 494 | . . . . 5 ⊢ (𝑀 ∈ 𝐵 → 𝑁 ∈ Fin) |
| 9 | 8 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → 𝑁 ∈ Fin) |
| 10 | 9 | adantr 480 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → 𝑁 ∈ Fin) |
| 11 | crngring 20161 | . . . . . . 7 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 12 | 3, 11 | mp1i 13 | . . . . . 6 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → 𝑅 ∈ Ring) |
| 13 | eldifi 4081 | . . . . . . 7 ⊢ (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → 𝑄 ∈ 𝑃) | |
| 14 | 13 | adantl 481 | . . . . . 6 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → 𝑄 ∈ 𝑃) |
| 15 | marep01ma.1 | . . . . . . . . 9 ⊢ 1 = (1r‘𝑅) | |
| 16 | 5, 6, 3, 2, 15 | marep01ma 22573 | . . . . . . . 8 ⊢ (𝑀 ∈ 𝐵 → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))) ∈ 𝐵) |
| 17 | 16 | 3ad2ant1 1133 | . . . . . . 7 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))) ∈ 𝐵) |
| 18 | 17 | adantr 480 | . . . . . 6 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))) ∈ 𝐵) |
| 19 | smadiadetlem.p | . . . . . . 7 ⊢ 𝑃 = (Base‘(SymGrp‘𝑁)) | |
| 20 | 5, 6, 19 | matepm2cl 22376 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ 𝑄 ∈ 𝑃 ∧ (𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗))) ∈ 𝐵) → ∀𝑚 ∈ 𝑁 (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚)) ∈ (Base‘𝑅)) |
| 21 | 12, 14, 18, 20 | syl3anc 1373 | . . . . 5 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → ∀𝑚 ∈ 𝑁 (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚)) ∈ (Base‘𝑅)) |
| 22 | id 22 | . . . . . . . 8 ⊢ (𝑚 = 𝑛 → 𝑚 = 𝑛) | |
| 23 | fveq2 6822 | . . . . . . . 8 ⊢ (𝑚 = 𝑛 → (𝑄‘𝑚) = (𝑄‘𝑛)) | |
| 24 | 22, 23 | oveq12d 7364 | . . . . . . 7 ⊢ (𝑚 = 𝑛 → (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚)) = (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛))) |
| 25 | 24 | eleq1d 2816 | . . . . . 6 ⊢ (𝑚 = 𝑛 → ((𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚)) ∈ (Base‘𝑅) ↔ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)) ∈ (Base‘𝑅))) |
| 26 | 25 | rspccv 3574 | . . . . 5 ⊢ (∀𝑚 ∈ 𝑁 (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚)) ∈ (Base‘𝑅) → (𝑛 ∈ 𝑁 → (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)) ∈ (Base‘𝑅))) |
| 27 | 21, 26 | syl 17 | . . . 4 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → (𝑛 ∈ 𝑁 → (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)) ∈ (Base‘𝑅))) |
| 28 | 27 | imp 406 | . . 3 ⊢ ((((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) ∧ 𝑛 ∈ 𝑁) → (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)) ∈ (Base‘𝑅)) |
| 29 | id 22 | . . . . 5 ⊢ (𝑛 = 𝑚 → 𝑛 = 𝑚) | |
| 30 | fveq2 6822 | . . . . 5 ⊢ (𝑛 = 𝑚 → (𝑄‘𝑛) = (𝑄‘𝑚)) | |
| 31 | 29, 30 | oveq12d 7364 | . . . 4 ⊢ (𝑛 = 𝑚 → (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)) = (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚))) |
| 32 | 31 | adantl 481 | . . 3 ⊢ ((((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) ∧ 𝑛 = 𝑚) → (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)) = (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚))) |
| 33 | 19, 2, 15 | symgmatr01 22567 | . . . . 5 ⊢ ((𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → ∃𝑚 ∈ 𝑁 (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚)) = 0 )) |
| 34 | 33 | 3adant1 1130 | . . . 4 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → ∃𝑚 ∈ 𝑁 (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚)) = 0 )) |
| 35 | 34 | imp 406 | . . 3 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → ∃𝑚 ∈ 𝑁 (𝑚(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑚)) = 0 ) |
| 36 | 1, 2, 4, 10, 28, 32, 35 | gsummgp0 20234 | . 2 ⊢ (((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) ∧ 𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿})) → (𝐺 Σg (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)))) = 0 ) |
| 37 | 36 | ex 412 | 1 ⊢ ((𝑀 ∈ 𝐵 ∧ 𝐾 ∈ 𝑁 ∧ 𝐿 ∈ 𝑁) → (𝑄 ∈ (𝑃 ∖ {𝑞 ∈ 𝑃 ∣ (𝑞‘𝐾) = 𝐿}) → (𝐺 Σg (𝑛 ∈ 𝑁 ↦ (𝑛(𝑖 ∈ 𝑁, 𝑗 ∈ 𝑁 ↦ if(𝑖 = 𝐾, if(𝑗 = 𝐿, 1 , 0 ), (𝑖𝑀𝑗)))(𝑄‘𝑛)))) = 0 )) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ∀wral 3047 ∃wrex 3056 {crab 3395 Vcvv 3436 ∖ cdif 3899 ifcif 4475 ↦ cmpt 5172 ‘cfv 6481 (class class class)co 7346 ∈ cmpo 7348 Fincfn 8869 Basecbs 17117 0gc0g 17340 Σg cgsu 17341 SymGrpcsymg 19279 mulGrpcmgp 20056 1rcur 20097 Ringcrg 20149 CRingccrg 20150 Mat cmat 22320 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2113 ax-9 2121 ax-10 2144 ax-11 2160 ax-12 2180 ax-ext 2703 ax-rep 5217 ax-sep 5234 ax-nul 5244 ax-pow 5303 ax-pr 5370 ax-un 7668 ax-cnex 11059 ax-resscn 11060 ax-1cn 11061 ax-icn 11062 ax-addcl 11063 ax-addrcl 11064 ax-mulcl 11065 ax-mulrcl 11066 ax-mulcom 11067 ax-addass 11068 ax-mulass 11069 ax-distr 11070 ax-i2m1 11071 ax-1ne0 11072 ax-1rid 11073 ax-rnegex 11074 ax-rrecex 11075 ax-cnre 11076 ax-pre-lttri 11077 ax-pre-lttrn 11078 ax-pre-ltadd 11079 ax-pre-mulgt0 11080 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2535 df-eu 2564 df-clab 2710 df-cleq 2723 df-clel 2806 df-nfc 2881 df-ne 2929 df-nel 3033 df-ral 3048 df-rex 3057 df-rmo 3346 df-reu 3347 df-rab 3396 df-v 3438 df-sbc 3742 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4476 df-pw 4552 df-sn 4577 df-pr 4579 df-tp 4581 df-op 4583 df-ot 4585 df-uni 4860 df-int 4898 df-iun 4943 df-iin 4944 df-br 5092 df-opab 5154 df-mpt 5173 df-tr 5199 df-id 5511 df-eprel 5516 df-po 5524 df-so 5525 df-fr 5569 df-se 5570 df-we 5571 df-xp 5622 df-rel 5623 df-cnv 5624 df-co 5625 df-dm 5626 df-rn 5627 df-res 5628 df-ima 5629 df-pred 6248 df-ord 6309 df-on 6310 df-lim 6311 df-suc 6312 df-iota 6437 df-fun 6483 df-fn 6484 df-f 6485 df-f1 6486 df-fo 6487 df-f1o 6488 df-fv 6489 df-isom 6490 df-riota 7303 df-ov 7349 df-oprab 7350 df-mpo 7351 df-of 7610 df-om 7797 df-1st 7921 df-2nd 7922 df-supp 8091 df-frecs 8211 df-wrecs 8242 df-recs 8291 df-rdg 8329 df-1o 8385 df-2o 8386 df-er 8622 df-map 8752 df-ixp 8822 df-en 8870 df-dom 8871 df-sdom 8872 df-fin 8873 df-fsupp 9246 df-sup 9326 df-oi 9396 df-card 9829 df-pnf 11145 df-mnf 11146 df-xr 11147 df-ltxr 11148 df-le 11149 df-sub 11343 df-neg 11344 df-nn 12123 df-2 12185 df-3 12186 df-4 12187 df-5 12188 df-6 12189 df-7 12190 df-8 12191 df-9 12192 df-n0 12379 df-z 12466 df-dec 12586 df-uz 12730 df-fz 13405 df-fzo 13552 df-seq 13906 df-hash 14235 df-struct 17055 df-sets 17072 df-slot 17090 df-ndx 17102 df-base 17118 df-ress 17139 df-plusg 17171 df-mulr 17172 df-sca 17174 df-vsca 17175 df-ip 17176 df-tset 17177 df-ple 17178 df-ds 17180 df-hom 17182 df-cco 17183 df-0g 17342 df-gsum 17343 df-prds 17348 df-pws 17350 df-mre 17485 df-mrc 17486 df-acs 17488 df-mgm 18545 df-sgrp 18624 df-mnd 18640 df-submnd 18689 df-efmnd 18774 df-grp 18846 df-minusg 18847 df-mulg 18978 df-cntz 19227 df-symg 19280 df-cmn 19692 df-abl 19693 df-mgp 20057 df-rng 20069 df-ur 20098 df-ring 20151 df-cring 20152 df-sra 21105 df-rgmod 21106 df-dsmm 21667 df-frlm 21682 df-mat 22321 |
| This theorem is referenced by: smadiadetlem1a 22576 |
| Copyright terms: Public domain | W3C validator |