![]() |
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 1140 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
3 | 1 | simp1d 1139 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
4 | 2, 3 | subcld 10986 | . . . . . 6 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℂ) |
5 | 1 | simp3d 1141 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
6 | 5, 3 | subcld 10986 | . . . . . 6 ⊢ (𝜑 → (𝐶 − 𝐴) ∈ ℂ) |
7 | sigardiv.b | . . . . . . . 8 ⊢ (𝜑 → ¬ 𝐶 = 𝐴) | |
8 | 7 | neqned 2994 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
9 | 5, 3, 8 | subne0d 10995 | . . . . . 6 ⊢ (𝜑 → (𝐶 − 𝐴) ≠ 0) |
10 | 4, 6, 9 | cjdivd 14574 | . . . . 5 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) = ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴)))) |
11 | 4 | cjcld 14547 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐵 − 𝐴)) ∈ ℂ) |
12 | 6 | cjcld 14547 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐶 − 𝐴)) ∈ ℂ) |
13 | 6, 9 | cjne0d 14554 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐶 − 𝐴)) ≠ 0) |
14 | 11, 12, 6, 13, 9 | divcan5rd 11432 | . . . . . 6 ⊢ (𝜑 → (((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) / ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) = ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴)))) |
15 | 11, 6 | mulcld 10650 | . . . . . . . 8 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℂ) |
16 | sigar | . . . . . . . . . . 11 ⊢ 𝐺 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (ℑ‘((∗‘𝑥) · 𝑦))) | |
17 | 16 | sigarval 43464 | . . . . . . . . . 10 ⊢ (((𝐵 − 𝐴) ∈ ℂ ∧ (𝐶 − 𝐴) ∈ ℂ) → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)))) |
18 | 4, 6, 17 | syl2anc 587 | . . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)))) |
19 | sigardiv.c | . . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = 0) | |
20 | 18, 19 | eqtr3d 2835 | . . . . . . . 8 ⊢ (𝜑 → (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴))) = 0) |
21 | 15, 20 | reim0bd 14551 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℝ) |
22 | 6, 12 | mulcomd 10651 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶 − 𝐴) · (∗‘(𝐶 − 𝐴))) = ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) |
23 | 6 | cjmulrcld 14557 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶 − 𝐴) · (∗‘(𝐶 − 𝐴))) ∈ ℝ) |
24 | 22, 23 | eqeltrrd 2891 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℝ) |
25 | 12, 6, 13, 9 | mulne0d 11281 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴)) ≠ 0) |
26 | 21, 24, 25 | redivcld 11457 | . . . . . 6 ⊢ (𝜑 → (((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) / ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) ∈ ℝ) |
27 | 14, 26 | eqeltrrd 2891 | . . . . 5 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴))) ∈ ℝ) |
28 | 10, 27 | eqeltrd 2890 | . . . 4 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) ∈ ℝ) |
29 | 28 | cjred 14577 | . . 3 ⊢ (𝜑 → (∗‘(∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) = (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) |
30 | 4, 6, 9 | divcld 11405 | . . . 4 ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℂ) |
31 | 30 | cjcjd 14550 | . . 3 ⊢ (𝜑 → (∗‘(∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) = ((𝐵 − 𝐴) / (𝐶 − 𝐴))) |
32 | 29, 31 | eqtr3d 2835 | . 2 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) = ((𝐵 − 𝐴) / (𝐶 − 𝐴))) |
33 | 32, 28 | eqeltrrd 2891 | 1 ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ‘cfv 6324 (class class class)co 7135 ∈ cmpo 7137 ℂcc 10524 ℝcr 10525 0cc0 10526 · cmul 10531 − cmin 10859 / cdiv 11286 ∗ccj 14447 ℑcim 14449 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-resscn 10583 ax-1cn 10584 ax-icn 10585 ax-addcl 10586 ax-addrcl 10587 ax-mulcl 10588 ax-mulrcl 10589 ax-mulcom 10590 ax-addass 10591 ax-mulass 10592 ax-distr 10593 ax-i2m1 10594 ax-1ne0 10595 ax-1rid 10596 ax-rnegex 10597 ax-rrecex 10598 ax-cnre 10599 ax-pre-lttri 10600 ax-pre-lttrn 10601 ax-pre-ltadd 10602 ax-pre-mulgt0 10603 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-nel 3092 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-po 5438 df-so 5439 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-er 8272 df-en 8493 df-dom 8494 df-sdom 8495 df-pnf 10666 df-mnf 10667 df-xr 10668 df-ltxr 10669 df-le 10670 df-sub 10861 df-neg 10862 df-div 11287 df-2 11688 df-cj 14450 df-re 14451 df-im 14452 |
This theorem is referenced by: sigarcol 43478 sharhght 43479 |
Copyright terms: Public domain | W3C validator |