| 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 20165 | . . . . . 6 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 2 | cply1binom.p | . . . . . . 7 ⊢ 𝑃 = (Poly1‘𝑅) | |
| 3 | 2 | ply1ring 22165 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring) |
| 4 | ringcmn 20202 | . . . . . 6 ⊢ (𝑃 ∈ Ring → 𝑃 ∈ CMnd) | |
| 5 | 1, 3, 4 | 3syl 18 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ CMnd) |
| 6 | 5 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑃 ∈ CMnd) |
| 7 | cply1binom.x | . . . . . . 7 ⊢ 𝑋 = (var1‘𝑅) | |
| 8 | cply1binom.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝑃) | |
| 9 | 7, 2, 8 | vr1cl 22135 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑋 ∈ 𝐵) |
| 10 | 1, 9 | syl 17 | . . . . 5 ⊢ (𝑅 ∈ CRing → 𝑋 ∈ 𝐵) |
| 11 | 10 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑋 ∈ 𝐵) |
| 12 | simp3 1138 | . . . 4 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ 𝐵) | |
| 13 | cply1binom.a | . . . . 5 ⊢ + = (+g‘𝑃) | |
| 14 | 8, 13 | cmncom 19712 | . . . 4 ⊢ ((𝑃 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
| 15 | 6, 11, 12, 14 | syl3anc 1373 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
| 16 | 15 | oveq2d 7385 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑁 ↑ (𝐴 + 𝑋))) |
| 17 | 2 | ply1crng 22116 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ CRing) |
| 18 | 17 | 3ad2ant1 1133 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑃 ∈ CRing) |
| 19 | simp2 1137 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℕ0) | |
| 20 | 8 | eleq2i 2820 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ (Base‘𝑃)) |
| 21 | 20 | biimpi 216 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ (Base‘𝑃)) |
| 22 | 21 | 3ad2ant3 1135 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ (Base‘𝑃)) |
| 23 | 10, 8 | eleqtrdi 2838 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑋 ∈ (Base‘𝑃)) |
| 24 | 23 | 3ad2ant1 1133 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑋 ∈ (Base‘𝑃)) |
| 25 | eqid 2729 | . . . 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 20255 | . . 3 ⊢ (((𝑃 ∈ CRing ∧ 𝑁 ∈ ℕ0) ∧ (𝐴 ∈ (Base‘𝑃) ∧ 𝑋 ∈ (Base‘𝑃))) → (𝑁 ↑ (𝐴 + 𝑋)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
| 31 | 18, 19, 22, 24, 30 | syl22anc 838 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝐴 + 𝑋)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
| 32 | 16, 31 | eqtrd 2764 | 1 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ↦ cmpt 5183 ‘cfv 6499 (class class class)co 7369 0cc0 11044 − cmin 11381 ℕ0cn0 12418 ...cfz 13444 Ccbc 14243 Basecbs 17155 +gcplusg 17196 .rcmulr 17197 Σg cgsu 17379 .gcmg 18981 CMndccmn 19694 mulGrpcmgp 20060 Ringcrg 20153 CRingccrg 20154 var1cv1 22093 Poly1cpl1 22094 |
| 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-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-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-of 7633 df-ofr 7634 df-om 7823 df-1st 7947 df-2nd 7948 df-supp 8117 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-pm 8779 df-ixp 8848 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-fsupp 9289 df-sup 9369 df-oi 9439 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-z 12506 df-dec 12626 df-uz 12770 df-rp 12928 df-fz 13445 df-fzo 13592 df-seq 13943 df-fac 14215 df-bc 14244 df-hash 14272 df-struct 17093 df-sets 17110 df-slot 17128 df-ndx 17140 df-base 17156 df-ress 17177 df-plusg 17209 df-mulr 17210 df-sca 17212 df-vsca 17213 df-ip 17214 df-tset 17215 df-ple 17216 df-ds 17218 df-hom 17220 df-cco 17221 df-0g 17380 df-gsum 17381 df-prds 17386 df-pws 17388 df-mre 17523 df-mrc 17524 df-acs 17526 df-mgm 18549 df-sgrp 18628 df-mnd 18644 df-mhm 18692 df-submnd 18693 df-grp 18850 df-minusg 18851 df-mulg 18982 df-subg 19037 df-ghm 19127 df-cntz 19231 df-cmn 19696 df-abl 19697 df-mgp 20061 df-rng 20073 df-ur 20102 df-srg 20107 df-ring 20155 df-cring 20156 df-subrng 20466 df-subrg 20490 df-psr 21851 df-mvr 21852 df-mpl 21853 df-opsr 21855 df-psr1 22097 df-vr1 22098 df-ply1 22099 |
| This theorem is referenced by: lply1binomsc 22231 |
| Copyright terms: Public domain | W3C validator |