| 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 1161 | . . . . . . 7 ⊢ (𝜑 → 𝐵 ∈ ℂ) |
| 3 | 1 | simp1d 1160 | . . . . . . 7 ⊢ (𝜑 → 𝐴 ∈ ℂ) |
| 4 | 2, 3 | subcld 11593 | . . . . . 6 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℂ) |
| 5 | 1 | simp3d 1162 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 6 | 5, 3 | subcld 11593 | . . . . . 6 ⊢ (𝜑 → (𝐶 − 𝐴) ∈ ℂ) |
| 7 | sigardiv.b | . . . . . . . 8 ⊢ (𝜑 → ¬ 𝐶 = 𝐴) | |
| 8 | 7 | neqned 2962 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
| 9 | 5, 3, 8 | subne0d 11603 | . . . . . 6 ⊢ (𝜑 → (𝐶 − 𝐴) ≠ 0) |
| 10 | 4, 6, 9 | cjdivd 15310 | . . . . 5 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) = ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴)))) |
| 11 | 4 | cjcld 15283 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐵 − 𝐴)) ∈ ℂ) |
| 12 | 6 | cjcld 15283 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐶 − 𝐴)) ∈ ℂ) |
| 13 | 6, 9 | cjne0d 15290 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐶 − 𝐴)) ≠ 0) |
| 14 | 11, 12, 6, 13, 9 | divcan5rd 12042 | . . . . . 6 ⊢ (𝜑 → (((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) / ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) = ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴)))) |
| 15 | 11, 6 | mulcld 11253 | . . . . . . . 8 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℂ) |
| 16 | sigar | . . . . . . . . . . 11 ⊢ 𝐺 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (ℑ‘((∗‘𝑥) · 𝑦))) | |
| 17 | 16 | sigarval 47678 | . . . . . . . . . 10 ⊢ (((𝐵 − 𝐴) ∈ ℂ ∧ (𝐶 − 𝐴) ∈ ℂ) → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)))) |
| 18 | 4, 6, 17 | syl2anc 596 | . . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)))) |
| 19 | sigardiv.c | . . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = 0) | |
| 20 | 18, 19 | eqtr3d 2797 | . . . . . . . 8 ⊢ (𝜑 → (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴))) = 0) |
| 21 | 15, 20 | reim0bd 15287 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℝ) |
| 22 | 6, 12 | mulcomd 11254 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶 − 𝐴) · (∗‘(𝐶 − 𝐴))) = ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) |
| 23 | 6 | cjmulrcld 15293 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶 − 𝐴) · (∗‘(𝐶 − 𝐴))) ∈ ℝ) |
| 24 | 22, 23 | eqeltrrd 2861 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℝ) |
| 25 | 12, 6, 13, 9 | mulne0d 11890 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴)) ≠ 0) |
| 26 | 21, 24, 25 | redivcld 12067 | . . . . . 6 ⊢ (𝜑 → (((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) / ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) ∈ ℝ) |
| 27 | 14, 26 | eqeltrrd 2861 | . . . . 5 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴))) ∈ ℝ) |
| 28 | 10, 27 | eqeltrd 2860 | . . . 4 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) ∈ ℝ) |
| 29 | 28 | cjred 15313 | . . 3 ⊢ (𝜑 → (∗‘(∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) = (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) |
| 30 | 4, 6, 9 | divcld 12015 | . . . 4 ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℂ) |
| 31 | 30 | cjcjd 15286 | . . 3 ⊢ (𝜑 → (∗‘(∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) = ((𝐵 − 𝐴) / (𝐶 − 𝐴))) |
| 32 | 29, 31 | eqtr3d 2797 | . 2 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) = ((𝐵 − 𝐴) / (𝐶 − 𝐴))) |
| 33 | 32, 28 | eqeltrrd 2861 | 1 ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ‘cfv 6533 (class class class)co 7413 ∈ cmpo 7415 ℂcc 11122 ℝcr 11123 0cc0 11124 · cmul 11129 − cmin 11465 / cdiv 11895 ∗ccj 15183 ℑcim 15185 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-cj 15186 df-re 15187 df-im 15188 |
| This theorem is used by: sigarcol 47692 sharhght 47693 |
| Copyright terms: Public domain | W3C validator |