![]() |
Mathbox for Saveliy Skresanov |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sigarmf | Structured version Visualization version GIF version |
Description: Signed area is additive (with respect to subtraction) by the first argument. (Contributed by Saveliy Skresanov, 19-Sep-2017.) |
Ref | Expression |
---|---|
sigar | ⊢ 𝐺 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (ℑ‘((∗‘𝑥) · 𝑦))) |
Ref | Expression |
---|---|
sigarmf | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐶)𝐺𝐵) = ((𝐴𝐺𝐵) − (𝐶𝐺𝐵))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cjsub 13933 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (∗‘(𝐴 − 𝐶)) = ((∗‘𝐴) − (∗‘𝐶))) | |
2 | 1 | oveq1d 6705 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((∗‘(𝐴 − 𝐶)) · 𝐵) = (((∗‘𝐴) − (∗‘𝐶)) · 𝐵)) |
3 | 2 | 3adant2 1100 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((∗‘(𝐴 − 𝐶)) · 𝐵) = (((∗‘𝐴) − (∗‘𝐶)) · 𝐵)) |
4 | simp1 1081 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐴 ∈ ℂ) | |
5 | 4 | cjcld 13980 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (∗‘𝐴) ∈ ℂ) |
6 | simp3 1083 | . . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐶 ∈ ℂ) | |
7 | 6 | cjcld 13980 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (∗‘𝐶) ∈ ℂ) |
8 | simp2 1082 | . . . . . 6 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → 𝐵 ∈ ℂ) | |
9 | 5, 7, 8 | subdird 10525 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (((∗‘𝐴) − (∗‘𝐶)) · 𝐵) = (((∗‘𝐴) · 𝐵) − ((∗‘𝐶) · 𝐵))) |
10 | 3, 9 | eqtrd 2685 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((∗‘(𝐴 − 𝐶)) · 𝐵) = (((∗‘𝐴) · 𝐵) − ((∗‘𝐶) · 𝐵))) |
11 | 10 | fveq2d 6233 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (ℑ‘((∗‘(𝐴 − 𝐶)) · 𝐵)) = (ℑ‘(((∗‘𝐴) · 𝐵) − ((∗‘𝐶) · 𝐵)))) |
12 | 5, 8 | mulcld 10098 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((∗‘𝐴) · 𝐵) ∈ ℂ) |
13 | 7, 8 | mulcld 10098 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((∗‘𝐶) · 𝐵) ∈ ℂ) |
14 | 12, 13 | imsubd 14001 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (ℑ‘(((∗‘𝐴) · 𝐵) − ((∗‘𝐶) · 𝐵))) = ((ℑ‘((∗‘𝐴) · 𝐵)) − (ℑ‘((∗‘𝐶) · 𝐵)))) |
15 | 11, 14 | eqtrd 2685 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (ℑ‘((∗‘(𝐴 − 𝐶)) · 𝐵)) = ((ℑ‘((∗‘𝐴) · 𝐵)) − (ℑ‘((∗‘𝐶) · 𝐵)))) |
16 | 4, 6 | subcld 10430 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴 − 𝐶) ∈ ℂ) |
17 | sigar | . . . 4 ⊢ 𝐺 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (ℑ‘((∗‘𝑥) · 𝑦))) | |
18 | 17 | sigarval 41360 | . . 3 ⊢ (((𝐴 − 𝐶) ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐶)𝐺𝐵) = (ℑ‘((∗‘(𝐴 − 𝐶)) · 𝐵))) |
19 | 16, 8, 18 | syl2anc 694 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐶)𝐺𝐵) = (ℑ‘((∗‘(𝐴 − 𝐶)) · 𝐵))) |
20 | 17 | sigarval 41360 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴𝐺𝐵) = (ℑ‘((∗‘𝐴) · 𝐵))) |
21 | 20 | 3adant3 1101 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐴𝐺𝐵) = (ℑ‘((∗‘𝐴) · 𝐵))) |
22 | 3simpc 1080 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) | |
23 | 22 | ancomd 466 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ)) |
24 | 17 | sigarval 41360 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐶𝐺𝐵) = (ℑ‘((∗‘𝐶) · 𝐵))) |
25 | 23, 24 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → (𝐶𝐺𝐵) = (ℑ‘((∗‘𝐶) · 𝐵))) |
26 | 21, 25 | oveq12d 6708 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴𝐺𝐵) − (𝐶𝐺𝐵)) = ((ℑ‘((∗‘𝐴) · 𝐵)) − (ℑ‘((∗‘𝐶) · 𝐵)))) |
27 | 15, 19, 26 | 3eqtr4d 2695 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ) → ((𝐴 − 𝐶)𝐺𝐵) = ((𝐴𝐺𝐵) − (𝐶𝐺𝐵))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 383 ∧ w3a 1054 = wceq 1523 ∈ wcel 2030 ‘cfv 5926 (class class class)co 6690 ↦ cmpt2 6692 ℂcc 9972 · cmul 9979 − cmin 10304 ∗ccj 13880 ℑcim 13882 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1762 ax-4 1777 ax-5 1879 ax-6 1945 ax-7 1981 ax-8 2032 ax-9 2039 ax-10 2059 ax-11 2074 ax-12 2087 ax-13 2282 ax-ext 2631 ax-sep 4814 ax-nul 4822 ax-pow 4873 ax-pr 4936 ax-un 6991 ax-resscn 10031 ax-1cn 10032 ax-icn 10033 ax-addcl 10034 ax-addrcl 10035 ax-mulcl 10036 ax-mulrcl 10037 ax-mulcom 10038 ax-addass 10039 ax-mulass 10040 ax-distr 10041 ax-i2m1 10042 ax-1ne0 10043 ax-1rid 10044 ax-rnegex 10045 ax-rrecex 10046 ax-cnre 10047 ax-pre-lttri 10048 ax-pre-lttrn 10049 ax-pre-ltadd 10050 ax-pre-mulgt0 10051 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1055 df-3an 1056 df-tru 1526 df-ex 1745 df-nf 1750 df-sb 1938 df-eu 2502 df-mo 2503 df-clab 2638 df-cleq 2644 df-clel 2647 df-nfc 2782 df-ne 2824 df-nel 2927 df-ral 2946 df-rex 2947 df-reu 2948 df-rmo 2949 df-rab 2950 df-v 3233 df-sbc 3469 df-csb 3567 df-dif 3610 df-un 3612 df-in 3614 df-ss 3621 df-nul 3949 df-if 4120 df-pw 4193 df-sn 4211 df-pr 4213 df-op 4217 df-uni 4469 df-br 4686 df-opab 4746 df-mpt 4763 df-id 5053 df-po 5064 df-so 5065 df-xp 5149 df-rel 5150 df-cnv 5151 df-co 5152 df-dm 5153 df-rn 5154 df-res 5155 df-ima 5156 df-iota 5889 df-fun 5928 df-fn 5929 df-f 5930 df-f1 5931 df-fo 5932 df-f1o 5933 df-fv 5934 df-riota 6651 df-ov 6693 df-oprab 6694 df-mpt2 6695 df-er 7787 df-en 7998 df-dom 7999 df-sdom 8000 df-pnf 10114 df-mnf 10115 df-xr 10116 df-ltxr 10117 df-le 10118 df-sub 10306 df-neg 10307 df-div 10723 df-2 11117 df-cj 13883 df-re 13884 df-im 13885 |
This theorem is referenced by: sigarms 41366 sigarexp 41369 sigaradd 41376 |
Copyright terms: Public domain | W3C validator |