| 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 20197 | . . . . . 6 ⊢ (𝑅 ∈ CRing → 𝑅 ∈ Ring) | |
| 2 | cply1binom.p | . . . . . . 7 ⊢ 𝑃 = (Poly1‘𝑅) | |
| 3 | 2 | ply1ring 22205 | . . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑃 ∈ Ring) |
| 4 | ringcmn 20234 | . . . . . 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 22175 | . . . . . 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 19744 | . . . 4 ⊢ ((𝑃 ∈ CMnd ∧ 𝑋 ∈ 𝐵 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
| 15 | 6, 11, 12, 14 | syl3anc 1374 | . . 3 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑋 + 𝐴) = (𝐴 + 𝑋)) |
| 16 | 15 | oveq2d 7386 | . 2 ⊢ ((𝑅 ∈ CRing ∧ 𝑁 ∈ ℕ0 ∧ 𝐴 ∈ 𝐵) → (𝑁 ↑ (𝑋 + 𝐴)) = (𝑁 ↑ (𝐴 + 𝑋))) |
| 17 | 2 | ply1crng 22156 | . . . 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 20288 | . . 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 5181 ‘cfv 6502 (class class class)co 7370 0cc0 11040 − cmin 11378 ℕ0cn0 12415 ...cfz 13437 Ccbc 14239 Basecbs 17150 +gcplusg 17191 .rcmulr 17192 Σg cgsu 17374 .gcmg 19014 CMndccmn 19726 mulGrpcmgp 20092 Ringcrg 20185 CRingccrg 20186 var1cv1 22133 Poly1cpl1 22134 |
| 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 5226 ax-sep 5245 ax-nul 5255 ax-pow 5314 ax-pr 5381 ax-un 7692 ax-cnex 11096 ax-resscn 11097 ax-1cn 11098 ax-icn 11099 ax-addcl 11100 ax-addrcl 11101 ax-mulcl 11102 ax-mulrcl 11103 ax-mulcom 11104 ax-addass 11105 ax-mulass 11106 ax-distr 11107 ax-i2m1 11108 ax-1ne0 11109 ax-1rid 11110 ax-rnegex 11111 ax-rrecex 11112 ax-cnre 11113 ax-pre-lttri 11114 ax-pre-lttrn 11115 ax-pre-ltadd 11116 ax-pre-mulgt0 11117 |
| 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 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-tp 4587 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-iin 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5529 df-eprel 5534 df-po 5542 df-so 5543 df-fr 5587 df-se 5588 df-we 5589 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-pred 6269 df-ord 6330 df-on 6331 df-lim 6332 df-suc 6333 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-riota 7327 df-ov 7373 df-oprab 7374 df-mpo 7375 df-of 7634 df-ofr 7635 df-om 7821 df-1st 7945 df-2nd 7946 df-supp 8115 df-frecs 8235 df-wrecs 8266 df-recs 8315 df-rdg 8353 df-1o 8409 df-2o 8410 df-er 8647 df-map 8779 df-pm 8780 df-ixp 8850 df-en 8898 df-dom 8899 df-sdom 8900 df-fin 8901 df-fsupp 9279 df-sup 9359 df-oi 9429 df-card 9865 df-pnf 11182 df-mnf 11183 df-xr 11184 df-ltxr 11185 df-le 11186 df-sub 11380 df-neg 11381 df-div 11809 df-nn 12160 df-2 12222 df-3 12223 df-4 12224 df-5 12225 df-6 12226 df-7 12227 df-8 12228 df-9 12229 df-n0 12416 df-z 12503 df-dec 12622 df-uz 12766 df-rp 12920 df-fz 13438 df-fzo 13585 df-seq 13939 df-fac 14211 df-bc 14240 df-hash 14268 df-struct 17088 df-sets 17105 df-slot 17123 df-ndx 17135 df-base 17151 df-ress 17172 df-plusg 17204 df-mulr 17205 df-sca 17207 df-vsca 17208 df-ip 17209 df-tset 17210 df-ple 17211 df-ds 17213 df-hom 17215 df-cco 17216 df-0g 17375 df-gsum 17376 df-prds 17381 df-pws 17383 df-mre 17519 df-mrc 17520 df-acs 17522 df-mgm 18579 df-sgrp 18658 df-mnd 18674 df-mhm 18722 df-submnd 18723 df-grp 18883 df-minusg 18884 df-mulg 19015 df-subg 19070 df-ghm 19159 df-cntz 19263 df-cmn 19728 df-abl 19729 df-mgp 20093 df-rng 20105 df-ur 20134 df-srg 20139 df-ring 20187 df-cring 20188 df-subrng 20496 df-subrg 20520 df-psr 21882 df-mvr 21883 df-mpl 21884 df-opsr 21886 df-psr1 22137 df-vr1 22138 df-ply1 22139 |
| This theorem is referenced by: lply1binomsc 22272 |
| Copyright terms: Public domain | W3C validator |