Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > lply1binom | Structured version Visualization version GIF version |
Description: The binomial theorem for linear polynomials (monic polynomials of degree 1) over commutative rings: (𝑋 + 𝐴)↑𝑁 is the sum from 𝑘 = 0 to 𝑁 of (𝑁C𝑘) · ((𝐴↑(𝑁 − 𝑘)) · (𝑋↑𝑘)). (Contributed by AV, 25-Aug-2019.) |
Ref | Expression |
---|---|
cply1binom.p | ⊢ 𝑃 = (Poly1‘𝑅) |
cply1binom.x | ⊢ 𝑋 = (var1‘𝑅) |
cply1binom.a | ⊢ + = (+g‘𝑃) |
cply1binom.m | ⊢ × = (.r‘𝑃) |
cply1binom.t | ⊢ · = (.g‘𝑃) |
cply1binom.g | ⊢ 𝐺 = (mulGrp‘𝑃) |
cply1binom.e | ⊢ ↑ = (.g‘𝐺) |
cply1binom.b | ⊢ 𝐵 = (Base‘𝑃) |
Ref | Expression |
---|---|
lply1binom | ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | crngring 19795 | . . . . . 6 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
2 | cply1binom.p | . . . . . . 7 ⊢ 𝑃 = (Poly1‘𝑅) | |
3 | 2 | ply1ring 21419 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring) |
4 | ringcmn 19820 | . . . . . 6 ⊢ (𝑃 ∈ Ring → 𝑃 ∈ CMnd) | |
5 | 1, 3, 4 | 3syl 18 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ CMnd) |
6 | 5 | 3ad2ant1 1132 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑃 ∈ CMnd) |
7 | cply1binom.x | . . . . . . 7 ⊢ 𝑋 = (var1‘𝑅) | |
8 | cply1binom.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑃) | |
9 | 7, 2, 8 | vr1cl 21388 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑋 ∈ 𝐵) |
10 | 1, 9 | syl 17 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑋 ∈ 𝐵) |
11 | 10 | 3ad2ant1 1132 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑋 ∈ 𝐵) |
12 | simp3 1137 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵) | |
13 | cply1binom.a | . . . . 5 ⊢ + = (+g‘𝑃) | |
14 | 8, 13 | cmncom 19403 | . . . 4 ⊢ ((𝑃 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
15 | 6, 11, 12, 14 | syl3anc 1370 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
16 | 15 | oveq2d 7291 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑁 ↑ (𝐴 + 𝑋))) |
17 | 2 | ply1crng 21369 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ CRing) |
18 | 17 | 3ad2ant1 1132 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑃 ∈ CRing) |
19 | simp2 1136 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℕ0) | |
20 | 8 | eleq2i 2830 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ (Base‘𝑃)) |
21 | 20 | biimpi 215 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ (Base‘𝑃)) |
22 | 21 | 3ad2ant3 1134 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ (Base‘𝑃)) |
23 | 10, 8 | eleqtrdi 2849 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑋 ∈ (Base‘𝑃)) |
24 | 23 | 3ad2ant1 1132 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑋 ∈ (Base‘𝑃)) |
25 | eqid 2738 | . . . 4 ⊢ (Base‘𝑃) = (Base‘𝑃) | |
26 | cply1binom.m | . . . 4 ⊢ × = (.r‘𝑃) | |
27 | cply1binom.t | . . . 4 ⊢ · = (.g‘𝑃) | |
28 | cply1binom.g | . . . 4 ⊢ 𝐺 = (mulGrp‘𝑃) | |
29 | cply1binom.e | . . . 4 ⊢ ↑ = (.g‘𝐺) | |
30 | 25, 26, 27, 13, 28, 29 | crngbinom 19860 | . . 3 ⊢ (((𝑃 ∈ CRing ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ (Base‘𝑃) ∧ 𝑋 ∈ (Base‘𝑃))) → (𝑁 ↑ (𝐴 + 𝑋)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
31 | 18, 19, 22, 24, 30 | syl22anc 836 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝐴 + 𝑋)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
32 | 16, 31 | eqtrd 2778 | 1 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 ↦ cmpt 5157 ‘cfv 6433 (class class class)co 7275 0cc0 10871 − cmin 11205 ℕ0cn0 12233 ...cfz 13239 Ccbc 14016 Basecbs 16912 +gcplusg 16962 .rcmulr 16963 Σg cgsu 17151 .gcmg 18700 CMndccmn 19386 mulGrpcmgp 19720 Ringcrg 19783 CRingccrg 19784 var1cv1 21347 Poly1cpl1 21348 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-iin 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-ofr 7534 df-om 7713 df-1st 7831 df-2nd 7832 df-supp 7978 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-er 8498 df-map 8617 df-pm 8618 df-ixp 8686 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-fsupp 9129 df-oi 9269 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-9 12043 df-n0 12234 df-z 12320 df-dec 12438 df-uz 12583 df-rp 12731 df-fz 13240 df-fzo 13383 df-seq 13722 df-fac 13988 df-bc 14017 df-hash 14045 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-sca 16978 df-vsca 16979 df-tset 16981 df-ple 16982 df-0g 17152 df-gsum 17153 df-mre 17295 df-mrc 17296 df-acs 17298 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-mhm 18430 df-submnd 18431 df-grp 18580 df-minusg 18581 df-mulg 18701 df-subg 18752 df-ghm 18832 df-cntz 18923 df-cmn 19388 df-abl 19389 df-mgp 19721 df-ur 19738 df-srg 19742 df-ring 19785 df-cring 19786 df-subrg 20022 df-psr 21112 df-mvr 21113 df-mpl 21114 df-opsr 21116 df-psr1 21351 df-vr1 21352 df-ply1 21353 |
This theorem is referenced by: lply1binomsc 21478 |
Copyright terms: Public domain | W3C validator |