| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subsq | GIF version | ||
| Description: Factor the difference of two squares. (Contributed by NM, 21-Feb-2008.) |
| Ref | Expression |
|---|---|
| subsq | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴↑2) − (𝐵↑2)) = ((𝐴 + 𝐵) · (𝐴 − 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpl 109 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐴 ∈ ℂ) | |
| 2 | simpr 110 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → 𝐵 ∈ ℂ) | |
| 3 | subcl 8271 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 4 | 1, 2, 3 | adddird 8098 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 + 𝐵) · (𝐴 − 𝐵)) = ((𝐴 · (𝐴 − 𝐵)) + (𝐵 · (𝐴 − 𝐵)))) |
| 5 | subdi 8457 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · (𝐴 − 𝐵)) = ((𝐴 · 𝐴) − (𝐴 · 𝐵))) | |
| 6 | 5 | 3anidm12 1308 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · (𝐴 − 𝐵)) = ((𝐴 · 𝐴) − (𝐴 · 𝐵))) |
| 7 | sqval 10742 | . . . . . 6 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) = (𝐴 · 𝐴)) | |
| 8 | 7 | adantr 276 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴↑2) = (𝐴 · 𝐴)) |
| 9 | 8 | oveq1d 5959 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴↑2) − (𝐴 · 𝐵)) = ((𝐴 · 𝐴) − (𝐴 · 𝐵))) |
| 10 | 6, 9 | eqtr4d 2241 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · (𝐴 − 𝐵)) = ((𝐴↑2) − (𝐴 · 𝐵))) |
| 11 | 2, 1, 2 | subdid 8486 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 · (𝐴 − 𝐵)) = ((𝐵 · 𝐴) − (𝐵 · 𝐵))) |
| 12 | mulcom 8054 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) = (𝐵 · 𝐴)) | |
| 13 | sqval 10742 | . . . . . 6 ⊢ (𝐵 ∈ ℂ → (𝐵↑2) = (𝐵 · 𝐵)) | |
| 14 | 13 | adantl 277 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵↑2) = (𝐵 · 𝐵)) |
| 15 | 12, 14 | oveq12d 5962 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · 𝐵) − (𝐵↑2)) = ((𝐵 · 𝐴) − (𝐵 · 𝐵))) |
| 16 | 11, 15 | eqtr4d 2241 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵 · (𝐴 − 𝐵)) = ((𝐴 · 𝐵) − (𝐵↑2))) |
| 17 | 10, 16 | oveq12d 5962 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 · (𝐴 − 𝐵)) + (𝐵 · (𝐴 − 𝐵))) = (((𝐴↑2) − (𝐴 · 𝐵)) + ((𝐴 · 𝐵) − (𝐵↑2)))) |
| 18 | sqcl 10745 | . . . 4 ⊢ (𝐴 ∈ ℂ → (𝐴↑2) ∈ ℂ) | |
| 19 | 18 | adantr 276 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴↑2) ∈ ℂ) |
| 20 | mulcl 8052 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 · 𝐵) ∈ ℂ) | |
| 21 | sqcl 10745 | . . . 4 ⊢ (𝐵 ∈ ℂ → (𝐵↑2) ∈ ℂ) | |
| 22 | 21 | adantl 277 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐵↑2) ∈ ℂ) |
| 23 | 19, 20, 22 | npncand 8407 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (((𝐴↑2) − (𝐴 · 𝐵)) + ((𝐴 · 𝐵) − (𝐵↑2))) = ((𝐴↑2) − (𝐵↑2))) |
| 24 | 4, 17, 23 | 3eqtrrd 2243 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴↑2) − (𝐵↑2)) = ((𝐴 + 𝐵) · (𝐴 − 𝐵))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1373 ∈ wcel 2176 (class class class)co 5944 ℂcc 7923 + caddc 7928 · cmul 7930 − cmin 8243 2c2 9087 ↑cexp 10683 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-coll 4159 ax-sep 4162 ax-nul 4170 ax-pow 4218 ax-pr 4253 ax-un 4480 ax-setind 4585 ax-iinf 4636 ax-cnex 8016 ax-resscn 8017 ax-1cn 8018 ax-1re 8019 ax-icn 8020 ax-addcl 8021 ax-addrcl 8022 ax-mulcl 8023 ax-mulrcl 8024 ax-addcom 8025 ax-mulcom 8026 ax-addass 8027 ax-mulass 8028 ax-distr 8029 ax-i2m1 8030 ax-0lt1 8031 ax-1rid 8032 ax-0id 8033 ax-rnegex 8034 ax-precex 8035 ax-cnre 8036 ax-pre-ltirr 8037 ax-pre-ltwlin 8038 ax-pre-lttrn 8039 ax-pre-apti 8040 ax-pre-ltadd 8041 ax-pre-mulgt0 8042 ax-pre-mulext 8043 |
| This theorem depends on definitions: df-bi 117 df-dc 837 df-3or 982 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-nel 2472 df-ral 2489 df-rex 2490 df-reu 2491 df-rmo 2492 df-rab 2493 df-v 2774 df-sbc 2999 df-csb 3094 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-nul 3461 df-if 3572 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-int 3886 df-iun 3929 df-br 4045 df-opab 4106 df-mpt 4107 df-tr 4143 df-id 4340 df-po 4343 df-iso 4344 df-iord 4413 df-on 4415 df-ilim 4416 df-suc 4418 df-iom 4639 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-rn 4686 df-res 4687 df-ima 4688 df-iota 5232 df-fun 5273 df-fn 5274 df-f 5275 df-f1 5276 df-fo 5277 df-f1o 5278 df-fv 5279 df-riota 5899 df-ov 5947 df-oprab 5948 df-mpo 5949 df-1st 6226 df-2nd 6227 df-recs 6391 df-frec 6477 df-pnf 8109 df-mnf 8110 df-xr 8111 df-ltxr 8112 df-le 8113 df-sub 8245 df-neg 8246 df-reap 8648 df-ap 8655 df-div 8746 df-inn 9037 df-2 9095 df-n0 9296 df-z 9373 df-uz 9649 df-seqfrec 10593 df-exp 10684 |
| This theorem is referenced by: subsq2 10792 subsqi 10794 resqrexlemnm 11329 resqrexlemglsq 11333 pythagtriplem4 12591 pythagtriplem6 12593 pythagtriplem7 12594 pythagtriplem12 12598 pythagtriplem14 12600 pythagtriplem16 12602 difsqpwdvds 12661 4sqlem8 12708 4sqlem10 12710 4sqlem11 12724 wilthlem1 15452 lgslem1 15477 2sqlem4 15595 |
| Copyright terms: Public domain | W3C validator |