| 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 20223 | . . . . . 6 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 2 | cply1binom.p | . . . . . . 7 ⊢ 𝑃 = (Poly1‘𝑅) | |
| 3 | 2 | ply1ring 22208 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring) |
| 4 | ringcmn 20260 | . . . . . 6 ⊢ (𝑃 ∈ Ring → 𝑃 ∈ CMnd) | |
| 5 | 1, 3, 4 | 3syl 18 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ CMnd) |
| 6 | 5 | 3ad2ant1 1134 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑃 ∈ CMnd) |
| 7 | cply1binom.x | . . . . . . 7 ⊢ 𝑋 = (var1‘𝑅) | |
| 8 | cply1binom.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑃) | |
| 9 | 7, 2, 8 | vr1cl 22178 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑋 ∈ 𝐵) |
| 10 | 1, 9 | syl 17 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑋 ∈ 𝐵) |
| 11 | 10 | 3ad2ant1 1134 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑋 ∈ 𝐵) |
| 12 | simp3 1139 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵) | |
| 13 | cply1binom.a | . . . . 5 ⊢ + = (+g‘𝑃) | |
| 14 | 8, 13 | cmncom 19770 | . . . 4 ⊢ ((𝑃 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
| 15 | 6, 11, 12, 14 | syl3anc 1374 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
| 16 | 15 | oveq2d 7380 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑁 ↑ (𝐴 + 𝑋))) |
| 17 | 2 | ply1crng 22159 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ CRing) |
| 18 | 17 | 3ad2ant1 1134 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑃 ∈ CRing) |
| 19 | simp2 1138 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℕ0) | |
| 20 | 8 | eleq2i 2829 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ (Base‘𝑃)) |
| 21 | 20 | biimpi 216 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ (Base‘𝑃)) |
| 22 | 21 | 3ad2ant3 1136 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ (Base‘𝑃)) |
| 23 | 10, 8 | eleqtrdi 2847 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑋 ∈ (Base‘𝑃)) |
| 24 | 23 | 3ad2ant1 1134 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑋 ∈ (Base‘𝑃)) |
| 25 | eqid 2737 | . . . 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 20312 | . . 3 ⊢ (((𝑃 ∈ CRing ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ (Base‘𝑃) ∧ 𝑋 ∈ (Base‘𝑃))) → (𝑁 ↑ (𝐴 + 𝑋)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
| 31 | 18, 19, 22, 24, 30 | syl22anc 839 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝐴 + 𝑋)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
| 32 | 16, 31 | eqtrd 2772 | 1 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ↦ cmpt 5167 ‘cfv 6496 (class class class)co 7364 0cc0 11035 − cmin 11374 ℕ0cn0 12434 ...cfz 13458 Ccbc 14261 Basecbs 17176 +gcplusg 17217 .rcmulr 17218 Σg cgsu 17400 .gcmg 19040 CMndccmn 19752 mulGrpcmgp 20118 Ringcrg 20211 CRingccrg 20212 var1cv1 22136 Poly1cpl1 22137 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5306 ax-pr 5374 ax-un 7686 ax-cnex 11091 ax-resscn 11092 ax-1cn 11093 ax-icn 11094 ax-addcl 11095 ax-addrcl 11096 ax-mulcl 11097 ax-mulrcl 11098 ax-mulcom 11099 ax-addass 11100 ax-mulass 11101 ax-distr 11102 ax-i2m1 11103 ax-1ne0 11104 ax-1rid 11105 ax-rnegex 11106 ax-rrecex 11107 ax-cnre 11108 ax-pre-lttri 11109 ax-pre-lttrn 11110 ax-pre-ltadd 11111 ax-pre-mulgt0 11112 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5523 df-eprel 5528 df-po 5536 df-so 5537 df-fr 5581 df-se 5582 df-we 5583 df-xp 5634 df-rel 5635 df-cnv 5636 df-co 5637 df-dm 5638 df-rn 5639 df-res 5640 df-ima 5641 df-pred 6263 df-ord 6324 df-on 6325 df-lim 6326 df-suc 6327 df-iota 6452 df-fun 6498 df-fn 6499 df-f 6500 df-f1 6501 df-fo 6502 df-f1o 6503 df-fv 6504 df-isom 6505 df-riota 7321 df-ov 7367 df-oprab 7368 df-mpo 7369 df-of 7628 df-ofr 7629 df-om 7815 df-1st 7939 df-2nd 7940 df-supp 8108 df-frecs 8228 df-wrecs 8259 df-recs 8308 df-rdg 8346 df-1o 8402 df-2o 8403 df-er 8640 df-map 8772 df-pm 8773 df-ixp 8843 df-en 8891 df-dom 8892 df-sdom 8893 df-fin 8894 df-fsupp 9272 df-sup 9352 df-oi 9422 df-card 9860 df-pnf 11178 df-mnf 11179 df-xr 11180 df-ltxr 11181 df-le 11182 df-sub 11376 df-neg 11377 df-div 11805 df-nn 12172 df-2 12241 df-3 12242 df-4 12243 df-5 12244 df-6 12245 df-7 12246 df-8 12247 df-9 12248 df-n0 12435 df-z 12522 df-dec 12642 df-uz 12786 df-rp 12940 df-fz 13459 df-fzo 13606 df-seq 13961 df-fac 14233 df-bc 14262 df-hash 14290 df-struct 17114 df-sets 17131 df-slot 17149 df-ndx 17161 df-base 17177 df-ress 17198 df-plusg 17230 df-mulr 17231 df-sca 17233 df-vsca 17234 df-ip 17235 df-tset 17236 df-ple 17237 df-ds 17239 df-hom 17241 df-cco 17242 df-0g 17401 df-gsum 17402 df-prds 17407 df-pws 17409 df-mre 17545 df-mrc 17546 df-acs 17548 df-mgm 18605 df-sgrp 18684 df-mnd 18700 df-mhm 18748 df-submnd 18749 df-grp 18909 df-minusg 18910 df-mulg 19041 df-subg 19096 df-ghm 19185 df-cntz 19289 df-cmn 19754 df-abl 19755 df-mgp 20119 df-rng 20131 df-ur 20160 df-srg 20165 df-ring 20213 df-cring 20214 df-subrng 20520 df-subrg 20544 df-psr 21886 df-mvr 21887 df-mpl 21888 df-opsr 21890 df-psr1 22140 df-vr1 22141 df-ply1 22142 |
| This theorem is referenced by: lply1binomsc 22273 |
| Copyright terms: Public domain | W3C validator |