| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > binom2 | Structured version Visualization version GIF version | ||
| Description: The square of a binomial. (Contributed by FL, 10-Dec-2006.) |
| Ref | Expression |
|---|---|
| binom2 | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵)↑2) = (((𝐴↑2) + (2 · (𝐴 · 𝐵))) + (𝐵↑2))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7458 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℂ, 𝐴, 0) → (𝐴 + 𝐵) = (if(𝐴 ∈ ℂ, 𝐴, 0) + 𝐵)) | |
| 2 | 1 | oveq1d 7466 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℂ, 𝐴, 0) → ((𝐴 + 𝐵)↑2) = ((if(𝐴 ∈ ℂ, 𝐴, 0) + 𝐵)↑2)) |
| 3 | oveq1 7458 | . . . . 5 ⊢ (𝐴 = if(𝐴 ∈ ℂ, 𝐴, 0) → (𝐴↑2) = (if(𝐴 ∈ ℂ, 𝐴, 0)↑2)) | |
| 4 | oveq1 7458 | . . . . . 6 ⊢ (𝐴 = if(𝐴 ∈ ℂ, 𝐴, 0) → (𝐴 · 𝐵) = (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵)) | |
| 5 | 4 | oveq2d 7467 | . . . . 5 ⊢ (𝐴 = if(𝐴 ∈ ℂ, 𝐴, 0) → (2 · (𝐴 · 𝐵)) = (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵))) |
| 6 | 3, 5 | oveq12d 7469 | . . . 4 ⊢ (𝐴 = if(𝐴 ∈ ℂ, 𝐴, 0) → ((𝐴↑2) + (2 · (𝐴 · 𝐵))) = ((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵)))) |
| 7 | 6 | oveq1d 7466 | . . 3 ⊢ (𝐴 = if(𝐴 ∈ ℂ, 𝐴, 0) → (((𝐴↑2) + (2 · (𝐴 · 𝐵))) + (𝐵↑2)) = (((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵))) + (𝐵↑2))) |
| 8 | 2, 7 | eqeq12d 2779 | . 2 ⊢ (𝐴 = if(𝐴 ∈ ℂ, 𝐴, 0) → (((𝐴 + 𝐵)↑2) = (((𝐴↑2) + (2 · (𝐴 · 𝐵))) + (𝐵↑2)) ↔ ((if(𝐴 ∈ ℂ, 𝐴, 0) + 𝐵)↑2) = (((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵))) + (𝐵↑2)))) |
| 9 | oveq2 7459 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℂ, 𝐵, 0) → (if(𝐴 ∈ ℂ, 𝐴, 0) + 𝐵) = (if(𝐴 ∈ ℂ, 𝐴, 0) + if(𝐵 ∈ ℂ, 𝐵, 0))) | |
| 10 | 9 | oveq1d 7466 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℂ, 𝐵, 0) → ((if(𝐴 ∈ ℂ, 𝐴, 0) + 𝐵)↑2) = ((if(𝐴 ∈ ℂ, 𝐴, 0) + if(𝐵 ∈ ℂ, 𝐵, 0))↑2)) |
| 11 | oveq2 7459 | . . . . . 6 ⊢ (𝐵 = if(𝐵 ∈ ℂ, 𝐵, 0) → (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵) = (if(𝐴 ∈ ℂ, 𝐴, 0) · if(𝐵 ∈ ℂ, 𝐵, 0))) | |
| 12 | 11 | oveq2d 7467 | . . . . 5 ⊢ (𝐵 = if(𝐵 ∈ ℂ, 𝐵, 0) → (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵)) = (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · if(𝐵 ∈ ℂ, 𝐵, 0)))) |
| 13 | 12 | oveq2d 7467 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℂ, 𝐵, 0) → ((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵))) = ((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · if(𝐵 ∈ ℂ, 𝐵, 0))))) |
| 14 | oveq1 7458 | . . . 4 ⊢ (𝐵 = if(𝐵 ∈ ℂ, 𝐵, 0) → (𝐵↑2) = (if(𝐵 ∈ ℂ, 𝐵, 0)↑2)) | |
| 15 | 13, 14 | oveq12d 7469 | . . 3 ⊢ (𝐵 = if(𝐵 ∈ ℂ, 𝐵, 0) → (((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵))) + (𝐵↑2)) = (((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · if(𝐵 ∈ ℂ, 𝐵, 0)))) + (if(𝐵 ∈ ℂ, 𝐵, 0)↑2))) |
| 16 | 10, 15 | eqeq12d 2779 | . 2 ⊢ (𝐵 = if(𝐵 ∈ ℂ, 𝐵, 0) → (((if(𝐴 ∈ ℂ, 𝐴, 0) + 𝐵)↑2) = (((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · 𝐵))) + (𝐵↑2)) ↔ ((if(𝐴 ∈ ℂ, 𝐴, 0) + if(𝐵 ∈ ℂ, 𝐵, 0))↑2) = (((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · if(𝐵 ∈ ℂ, 𝐵, 0)))) + (if(𝐵 ∈ ℂ, 𝐵, 0)↑2)))) |
| 17 | 0cn 11337 | . . . 4 ⊢ 0 ∈ ℂ | |
| 18 | 17 | elimel 4555 | . . 3 ⊢ if(𝐴 ∈ ℂ, 𝐴, 0) ∈ ℂ |
| 19 | 17 | elimel 4555 | . . 3 ⊢ if(𝐵 ∈ ℂ, 𝐵, 0) ∈ ℂ |
| 20 | 18, 19 | binom2i 14397 | . 2 ⊢ ((if(𝐴 ∈ ℂ, 𝐴, 0) + if(𝐵 ∈ ℂ, 𝐵, 0))↑2) = (((if(𝐴 ∈ ℂ, 𝐴, 0)↑2) + (2 · (if(𝐴 ∈ ℂ, 𝐴, 0) · if(𝐵 ∈ ℂ, 𝐵, 0)))) + (if(𝐵 ∈ ℂ, 𝐵, 0)↑2)) |
| 21 | 8, 16, 20 | dedth2h 4545 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵)↑2) = (((𝐴↑2) + (2 · (𝐴 · 𝐵))) + (𝐵↑2))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ifcif 4485 (class class class)co 7451 ℂcc 11237 0cc0 11239 + caddc 11242 · cmul 11244 2c2 12437 ↑cexp 14244 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-seq 14185 df-exp 14245 |
| This theorem is used by: binom2d 14403 binom21 14404 binom2sub 14405 mulbinom2 14408 binom3 14409 01sqrexlem7 15458 abstri 15541 sqreulem 15571 amgm2 15581 bhmafibid1cn 15677 bhmafibid2cn 15678 pythagtriplem1 17038 pythagtriplem12 17048 tcphcphlem1 25611 csbren 25775 trirn 25776 tanarg 27004 heron 27223 quad2 27224 dquartlem2 27237 dquart 27238 quart1 27241 sqrtcval 44902 stirlinglem10 47366 itsclc0xyqsolr 50212 2itscplem2 50222 |
| Copyright terms: Public domain | W3C validator |