| Mathbox for Saveliy Skresanov |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > sigardiv | Structured version Visualization version GIF version | ||
| Description: If signed area between vectors 𝐵 − 𝐴 and 𝐶 − 𝐴 is zero, then those vectors lie on the same line. (Contributed by Saveliy Skresanov, 22-Sep-2017.) |
| Ref | Expression |
|---|---|
| sigar | ⊢ 𝐺 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (ℑ‘((∗‘𝑥) · 𝑦))) |
| sigardiv.a | ⊢ (𝜑 → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) |
| sigardiv.b | ⊢ (𝜑 → ¬ 𝐶 = 𝐴) |
| sigardiv.c | ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = 0) |
| Ref | Expression |
|---|---|
| sigardiv | ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sigardiv.a | . . . . . . . 8 ⊢ (𝜑 → (𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐶 ∈ ℂ)) | |
| 2 | 1 | simp2d 1144 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 3 | 1 | simp1d 1143 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 4 | 2, 3 | subcld 11505 | . . . . . 6 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℂ) |
| 5 | 1 | simp3d 1145 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 6 | 5, 3 | subcld 11505 | . . . . . 6 ⊢ (𝜑 → (𝐶 − 𝐴) ∈ ℂ) |
| 7 | sigardiv.b | . . . . . . . 8 ⊢ (𝜑 → ¬ 𝐶 = 𝐴) | |
| 8 | 7 | neqned 2939 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
| 9 | 5, 3, 8 | subne0d 11514 | . . . . . 6 ⊢ (𝜑 → (𝐶 − 𝐴) ≠ 0) |
| 10 | 4, 6, 9 | cjdivd 15185 | . . . . 5 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) = ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴)))) |
| 11 | 4 | cjcld 15158 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐵 − 𝐴)) ∈ ℂ) |
| 12 | 6 | cjcld 15158 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐶 − 𝐴)) ∈ ℂ) |
| 13 | 6, 9 | cjne0d 15165 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐶 − 𝐴)) ≠ 0) |
| 14 | 11, 12, 6, 13, 9 | divcan5rd 11958 | . . . . . 6 ⊢ (𝜑 → (((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) / ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) = ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴)))) |
| 15 | 11, 6 | mulcld 11165 | . . . . . . . 8 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℂ) |
| 16 | sigar | . . . . . . . . . . 11 ⊢ 𝐺 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (ℑ‘((∗‘𝑥) · 𝑦))) | |
| 17 | 16 | sigarval 47278 | . . . . . . . . . 10 ⊢ (((𝐵 − 𝐴) ∈ ℂ ∧ (𝐶 − 𝐴) ∈ ℂ) → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)))) |
| 18 | 4, 6, 17 | syl2anc 585 | . . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)))) |
| 19 | sigardiv.c | . . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = 0) | |
| 20 | 18, 19 | eqtr3d 2773 | . . . . . . . 8 ⊢ (𝜑 → (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴))) = 0) |
| 21 | 15, 20 | reim0bd 15162 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℝ) |
| 22 | 6, 12 | mulcomd 11166 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶 − 𝐴) · (∗‘(𝐶 − 𝐴))) = ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) |
| 23 | 6 | cjmulrcld 15168 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶 − 𝐴) · (∗‘(𝐶 − 𝐴))) ∈ ℝ) |
| 24 | 22, 23 | eqeltrrd 2837 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℝ) |
| 25 | 12, 6, 13, 9 | mulne0d 11802 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴)) ≠ 0) |
| 26 | 21, 24, 25 | redivcld 11983 | . . . . . 6 ⊢ (𝜑 → (((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) / ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) ∈ ℝ) |
| 27 | 14, 26 | eqeltrrd 2837 | . . . . 5 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴))) ∈ ℝ) |
| 28 | 10, 27 | eqeltrd 2836 | . . . 4 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) ∈ ℝ) |
| 29 | 28 | cjred 15188 | . . 3 ⊢ (𝜑 → (∗‘(∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) = (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) |
| 30 | 4, 6, 9 | divcld 11931 | . . . 4 ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℂ) |
| 31 | 30 | cjcjd 15161 | . . 3 ⊢ (𝜑 → (∗‘(∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) = ((𝐵 − 𝐴) / (𝐶 − 𝐴))) |
| 32 | 29, 31 | eqtr3d 2773 | . 2 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) = ((𝐵 − 𝐴) / (𝐶 − 𝐴))) |
| 33 | 32, 28 | eqeltrrd 2837 | 1 ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℝ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ‘cfv 6498 (class class class)co 7367 ∈ cmpo 7369 ℂcc 11036 ℝcr 11037 0cc0 11038 · cmul 11043 − cmin 11377 / cdiv 11807 ∗ccj 15058 ℑcim 15060 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-cj 15061 df-re 15062 df-im 15063 |
| This theorem is referenced by: sigarcol 47292 sharhght 47293 |
| Copyright terms: Public domain | W3C validator |