| 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 20163 | . . . . . 6 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 2 | cply1binom.p | . . . . . . 7 ⊢ 𝑃 = (Poly1‘𝑅) | |
| 3 | 2 | ply1ring 22160 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring) |
| 4 | ringcmn 20200 | . . . . . 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 22130 | . . . . . 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 19710 | . . . 4 ⊢ ((𝑃 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
| 15 | 6, 11, 12, 14 | syl3anc 1373 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
| 16 | 15 | oveq2d 7362 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑁 ↑ (𝐴 + 𝑋))) |
| 17 | 2 | ply1crng 22111 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑃 ∈ CRing) |
| 18 | 17 | 3ad2ant1 1133 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑃 ∈ CRing) |
| 19 | simp2 1137 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑁 ∈ ℕ0) | |
| 20 | 8 | eleq2i 2823 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 ↔ 𝐴 ∈ (Base‘𝑃)) |
| 21 | 20 | biimpi 216 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ (Base‘𝑃)) |
| 22 | 21 | 3ad2ant3 1135 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝐴 ∈ (Base‘𝑃)) |
| 23 | 10, 8 | eleqtrdi 2841 | . . . 4 ⊢ (𝑅 ∈ CRing → 𝑋 ∈ (Base‘𝑃)) |
| 24 | 23 | 3ad2ant1 1133 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → 𝑋 ∈ (Base‘𝑃)) |
| 25 | eqid 2731 | . . . 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 20253 | . . 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 2766 | 1 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑃 Σg (𝑘 ∈ (0...𝑁) ↦ ((𝑁C𝑘) · (((𝑁 − 𝑘) ↑ 𝐴) × (𝑘 ↑ 𝑋)))))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2111 ↦ cmpt 5170 ‘cfv 6481 (class class class)co 7346 0cc0 11006 − cmin 11344 ℕ0cn0 12381 ...cfz 13407 Ccbc 14209 Basecbs 17120 +gcplusg 17161 .rcmulr 17162 Σg cgsu 17344 .gcmg 18980 CMndccmn 19692 mulGrpcmgp 20058 Ringcrg 20151 CRingccrg 20152 var1cv1 22088 Poly1cpl1 22089 |
| 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 5215 ax-sep 5232 ax-nul 5242 ax-pow 5301 ax-pr 5368 ax-un 7668 ax-cnex 11062 ax-resscn 11063 ax-1cn 11064 ax-icn 11065 ax-addcl 11066 ax-addrcl 11067 ax-mulcl 11068 ax-mulrcl 11069 ax-mulcom 11070 ax-addass 11071 ax-mulass 11072 ax-distr 11073 ax-i2m1 11074 ax-1ne0 11075 ax-1rid 11076 ax-rnegex 11077 ax-rrecex 11078 ax-cnre 11079 ax-pre-lttri 11080 ax-pre-lttrn 11081 ax-pre-ltadd 11082 ax-pre-mulgt0 11083 |
| 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 3737 df-csb 3846 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-pss 3917 df-nul 4281 df-if 4473 df-pw 4549 df-sn 4574 df-pr 4576 df-tp 4578 df-op 4580 df-uni 4857 df-int 4896 df-iun 4941 df-iin 4942 df-br 5090 df-opab 5152 df-mpt 5171 df-tr 5197 df-id 5509 df-eprel 5514 df-po 5522 df-so 5523 df-fr 5567 df-se 5568 df-we 5569 df-xp 5620 df-rel 5621 df-cnv 5622 df-co 5623 df-dm 5624 df-rn 5625 df-res 5626 df-ima 5627 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-ofr 7611 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-pm 8753 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 9832 df-pnf 11148 df-mnf 11149 df-xr 11150 df-ltxr 11151 df-le 11152 df-sub 11346 df-neg 11347 df-div 11775 df-nn 12126 df-2 12188 df-3 12189 df-4 12190 df-5 12191 df-6 12192 df-7 12193 df-8 12194 df-9 12195 df-n0 12382 df-z 12469 df-dec 12589 df-uz 12733 df-rp 12891 df-fz 13408 df-fzo 13555 df-seq 13909 df-fac 14181 df-bc 14210 df-hash 14238 df-struct 17058 df-sets 17075 df-slot 17093 df-ndx 17105 df-base 17121 df-ress 17142 df-plusg 17174 df-mulr 17175 df-sca 17177 df-vsca 17178 df-ip 17179 df-tset 17180 df-ple 17181 df-ds 17183 df-hom 17185 df-cco 17186 df-0g 17345 df-gsum 17346 df-prds 17351 df-pws 17353 df-mre 17488 df-mrc 17489 df-acs 17491 df-mgm 18548 df-sgrp 18627 df-mnd 18643 df-mhm 18691 df-submnd 18692 df-grp 18849 df-minusg 18850 df-mulg 18981 df-subg 19036 df-ghm 19125 df-cntz 19229 df-cmn 19694 df-abl 19695 df-mgp 20059 df-rng 20071 df-ur 20100 df-srg 20105 df-ring 20153 df-cring 20154 df-subrng 20461 df-subrg 20485 df-psr 21846 df-mvr 21847 df-mpl 21848 df-opsr 21850 df-psr1 22092 df-vr1 22093 df-ply1 22094 |
| This theorem is referenced by: lply1binomsc 22226 |
| Copyright terms: Public domain | W3C validator |