| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > cjsub | GIF version | ||
| Description: Complex conjugate distributes over subtraction. (Contributed by NM, 28-Apr-2005.) |
| Ref | Expression |
|---|---|
| cjsub | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 − 𝐵)) = ((∗‘𝐴) − (∗‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | negcl 8534 | . . 3 ⊢ (𝐵 ∈ ℂ → -𝐵 ∈ ℂ) | |
| 2 | cjadd 11672 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ -𝐵 ∈ ℂ) → (∗‘(𝐴 + -𝐵)) = ((∗‘𝐴) + (∗‘ -𝐵))) | |
| 3 | 1, 2 | sylan2 286 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + -𝐵)) = ((∗‘𝐴) + (∗‘ -𝐵))) |
| 4 | negsub 8582 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + -𝐵) = (𝐴 − 𝐵)) | |
| 5 | 4 | fveq2d 5702 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 + -𝐵)) = (∗‘(𝐴 − 𝐵))) |
| 6 | cjneg 11678 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (∗‘ -𝐵) = -(∗‘𝐵)) | |
| 7 | 6 | adantl 277 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘ -𝐵) = -(∗‘𝐵)) |
| 8 | 7 | oveq2d 6104 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) + (∗‘ -𝐵)) = ((∗‘𝐴) + -(∗‘𝐵))) |
| 9 | cjcl 11636 | . . . 4 ⊢ (𝐴 ∈ ℂ → (∗‘𝐴) ∈ ℂ) | |
| 10 | cjcl 11636 | . . . 4 ⊢ (𝐵 ∈ ℂ → (∗‘𝐵) ∈ ℂ) | |
| 11 | negsub 8582 | . . . 4 ⊢ (((∗‘𝐴) ∈ ℂ ∧ (∗‘𝐵) ∈ ℂ) → ((∗‘𝐴) + -(∗‘𝐵)) = ((∗‘𝐴) − (∗‘𝐵))) | |
| 12 | 9, 10, 11 | syl2an 289 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) + -(∗‘𝐵)) = ((∗‘𝐴) − (∗‘𝐵))) |
| 13 | 8, 12 | eqtrd 2271 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((∗‘𝐴) + (∗‘ -𝐵)) = ((∗‘𝐴) − (∗‘𝐵))) |
| 14 | 3, 5, 13 | 3eqtr3d 2279 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘(𝐴 − 𝐵)) = ((∗‘𝐴) − (∗‘𝐵))) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 = wceq 1402 ∈ wcel 2209 ‘cfv 5380 (class class class)co 6088 ℂcc 8184 + caddc 8189 − cmin 8505 -cneg 8506 ∗ccj 11627 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-mulrcl 8285 ax-addcom 8286 ax-mulcom 8287 ax-addass 8288 ax-mulass 8289 ax-distr 8290 ax-i2m1 8291 ax-0lt1 8292 ax-1rid 8293 ax-0id 8294 ax-rnegex 8295 ax-precex 8296 ax-cnre 8297 ax-pre-ltirr 8298 ax-pre-ltwlin 8299 ax-pre-lttrn 8300 ax-pre-apti 8301 ax-pre-ltadd 8302 ax-pre-mulgt0 8303 ax-pre-mulext 8304 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-po 4443 df-iso 4444 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-f 5384 df-fv 5388 df-riota 6041 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8369 df-mnf 8370 df-xr 8371 df-ltxr 8372 df-le 8373 df-sub 8507 df-neg 8508 df-reap 8912 df-ap 8919 df-div 9012 df-2 9373 df-cj 11630 df-re 11631 df-im 11632 |
| This theorem is used by: sqabssub 11845 cjcn2 12108 mul4sqlem 13202 dvcjbr 15946 |
| Copyright terms: Public domain | W3C validator |