binom2 - Intuitionistic Logic Explorer

	Intuitionistic Logic Explorer		< Previous Next > Nearby theorems
Mirrors > Home > ILE Home > Th. List > binom2		GIF version

Theorem binom2 10030

Description: The square of a binomial. (Contributed by FL, 10-Dec-2006.)

**Assertion**
Ref	Expression
binom2	⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵)↑2) = (((𝐴↑2) + (2 · (𝐴 · 𝐵))) + (𝐵↑2)))

**Proof of Theorem binom2**
Step	Hyp	Ref	Expression
1		addcl 7446	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ)
2		simpl 107	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ)
3		simpr 108	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ)
4	1, 2, 3	adddid 7491	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · (𝐴 + 𝐵)) = (((𝐴 + 𝐵) · 𝐴) + ((𝐴 + 𝐵) · 𝐵)))
5	2, 3, 2	adddird 7492	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · 𝐴) = ((𝐴 · 𝐴) + (𝐵 · 𝐴)))
6	3, 2	mulcomd 7488	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 · 𝐴) = (𝐴 · 𝐵))
7	6	oveq2d 5650	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐴) + (𝐵 · 𝐴)) = ((𝐴 · 𝐴) + (𝐴 · 𝐵)))
8	5, 7	eqtrd 2120	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · 𝐴) = ((𝐴 · 𝐴) + (𝐴 · 𝐵)))
9	2, 3, 3	adddird 7492	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · 𝐵) = ((𝐴 · 𝐵) + (𝐵 · 𝐵)))
10	8, 9	oveq12d 5652	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) · 𝐴) + ((𝐴 + 𝐵) · 𝐵)) = (((𝐴 · 𝐴) + (𝐴 · 𝐵)) + ((𝐴 · 𝐵) + (𝐵 · 𝐵))))
11	2, 2	mulcld 7487	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐴) ∈ ℂ)
12	2, 3	mulcld 7487	. . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ)
13	11, 12	addcld 7486	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐴) + (𝐴 · 𝐵)) ∈ ℂ)
14	3, 3	mulcld 7487	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 · 𝐵) ∈ ℂ)
15	13, 12, 14	addassd 7489	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((((𝐴 · 𝐴) + (𝐴 · 𝐵)) + (𝐴 · 𝐵)) + (𝐵 · 𝐵)) = (((𝐴 · 𝐴) + (𝐴 · 𝐵)) + ((𝐴 · 𝐵) + (𝐵 · 𝐵))))
16	11, 12, 12	addassd 7489	. . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 · 𝐴) + (𝐴 · 𝐵)) + (𝐴 · 𝐵)) = ((𝐴 · 𝐴) + ((𝐴 · 𝐵) + (𝐴 · 𝐵))))
17	16	oveq1d 5649	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((((𝐴 · 𝐴) + (𝐴 · 𝐵)) + (𝐴 · 𝐵)) + (𝐵 · 𝐵)) = (((𝐴 · 𝐴) + ((𝐴 · 𝐵) + (𝐴 · 𝐵))) + (𝐵 · 𝐵)))
18	10, 15, 17	3eqtr2d 2126	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴 + 𝐵) · 𝐴) + ((𝐴 + 𝐵) · 𝐵)) = (((𝐴 · 𝐴) + ((𝐴 · 𝐵) + (𝐴 · 𝐵))) + (𝐵 · 𝐵)))
19	4, 18	eqtrd 2120	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · (𝐴 + 𝐵)) = (((𝐴 · 𝐴) + ((𝐴 · 𝐵) + (𝐴 · 𝐵))) + (𝐵 · 𝐵)))
20		sqval 9978	. . 3 ⊢ ((𝐴 + 𝐵) ∈ ℂ → ((𝐴 + 𝐵)↑2) = ((𝐴 + 𝐵) · (𝐴 + 𝐵)))
21	1, 20	syl 14	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵)↑2) = ((𝐴 + 𝐵) · (𝐴 + 𝐵)))
22		sqval 9978	. . . . 5 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) = (𝐴 · 𝐴))
23	2, 22	syl 14	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴↑2) = (𝐴 · 𝐴))
24	12	2timesd 8628	. . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (2 · (𝐴 · 𝐵)) = ((𝐴 · 𝐵) + (𝐴 · 𝐵)))
25	23, 24	oveq12d 5652	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴↑2) + (2 · (𝐴 · 𝐵))) = ((𝐴 · 𝐴) + ((𝐴 · 𝐵) + (𝐴 · 𝐵))))
26		sqval 9978	. . . 4 ⊢ (𝐵 ∈ ℂ → (𝐵↑2) = (𝐵 · 𝐵))
27	3, 26	syl 14	. . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵↑2) = (𝐵 · 𝐵))
28	25, 27	oveq12d 5652	. 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴↑2) + (2 · (𝐴 · 𝐵))) + (𝐵↑2)) = (((𝐴 · 𝐴) + ((𝐴 · 𝐵) + (𝐴 · 𝐵))) + (𝐵 · 𝐵)))
29	19, 21, 28	3eqtr4d 2130	1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵)↑2) = (((𝐴↑2) + (2 · (𝐴 · 𝐵))) + (𝐵↑2)))

Colors of variables: wff set class

Syntax hints: → wi 4 ∧ wa 102 = wceq 1289 ∈ wcel 1438 (class class class)co 5634 ℂcc 7327 + caddc 7332 · cmul 7334 2c2 8444 ↑cexp 9919

This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-in1 579 ax-in2 580 ax-io 665 ax-5 1381 ax-7 1382 ax-gen 1383 ax-ie1 1427 ax-ie2 1428 ax-8 1440 ax-10 1441 ax-11 1442 ax-i12 1443 ax-bndl 1444 ax-4 1445 ax-13 1449 ax-14 1450 ax-17 1464 ax-i9 1468 ax-ial 1472 ax-i5r 1473 ax-ext 2070 ax-coll 3946 ax-sep 3949 ax-nul 3957 ax-pow 4001 ax-pr 4027 ax-un 4251 ax-setind 4343 ax-iinf 4393 ax-cnex 7415 ax-resscn 7416 ax-1cn 7417 ax-1re 7418 ax-icn 7419 ax-addcl 7420 ax-addrcl 7421 ax-mulcl 7422 ax-mulrcl 7423 ax-addcom 7424 ax-mulcom 7425 ax-addass 7426 ax-mulass 7427 ax-distr 7428 ax-i2m1 7429 ax-0lt1 7430 ax-1rid 7431 ax-0id 7432 ax-rnegex 7433 ax-precex 7434 ax-cnre 7435 ax-pre-ltirr 7436 ax-pre-ltwlin 7437 ax-pre-lttrn 7438 ax-pre-apti 7439 ax-pre-ltadd 7440 ax-pre-mulgt0 7441 ax-pre-mulext 7442

This theorem depends on definitions: df-bi 115 df-dc 781 df-3or 925 df-3an 926 df-tru 1292 df-fal 1295 df-nf 1395 df-sb 1693 df-eu 1951 df-mo 1952 df-clab 2075 df-cleq 2081 df-clel 2084 df-nfc 2217 df-ne 2256 df-nel 2351 df-ral 2364 df-rex 2365 df-reu 2366 df-rmo 2367 df-rab 2368 df-v 2621 df-sbc 2839 df-csb 2932 df-dif 2999 df-un 3001 df-in 3003 df-ss 3010 df-nul 3285 df-if 3390 df-pw 3427 df-sn 3447 df-pr 3448 df-op 3450 df-uni 3649 df-int 3684 df-iun 3727 df-br 3838 df-opab 3892 df-mpt 3893 df-tr 3929 df-id 4111 df-po 4114 df-iso 4115 df-iord 4184 df-on 4186 df-ilim 4187 df-suc 4189 df-iom 4396 df-xp 4434 df-rel 4435 df-cnv 4436 df-co 4437 df-dm 4438 df-rn 4439 df-res 4440 df-ima 4441 df-iota 4967 df-fun 5004 df-fn 5005 df-f 5006 df-f1 5007 df-fo 5008 df-f1o 5009 df-fv 5010 df-riota 5590 df-ov 5637 df-oprab 5638 df-mpt2 5639 df-1st 5893 df-2nd 5894 df-recs 6052 df-frec 6138 df-pnf 7503 df-mnf 7504 df-xr 7505 df-ltxr 7506 df-le 7507 df-sub 7634 df-neg 7635 df-reap 8028 df-ap 8035 df-div 8114 df-inn 8395 df-2 8452 df-n0 8644 df-z 8721 df-uz 8989 df-iseq 9818 df-seq3 9819 df-exp 9920

This theorem is referenced by: binom21 10031 binom2sub 10032 mulbinom2 10035 binom3 10036 nn0opthlem1d 10093 resqrexlemover 10408 resqrexlemcalc1 10412 abstri 10502 amgm2 10516

W3C validator