| 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 11504 | . . . . . 6 ⊢ (𝜑 → (𝐵 − 𝐴) ∈ ℂ) |
| 5 | 1 | simp3d 1145 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ∈ ℂ) |
| 6 | 5, 3 | subcld 11504 | . . . . . 6 ⊢ (𝜑 → (𝐶 − 𝐴) ∈ ℂ) |
| 7 | sigardiv.b | . . . . . . . 8 ⊢ (𝜑 → ¬ 𝐶 = 𝐴) | |
| 8 | 7 | neqned 2940 | . . . . . . 7 ⊢ (𝜑 → 𝐶 ≠ 𝐴) |
| 9 | 5, 3, 8 | subne0d 11513 | . . . . . 6 ⊢ (𝜑 → (𝐶 − 𝐴) ≠ 0) |
| 10 | 4, 6, 9 | cjdivd 15158 | . . . . 5 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) = ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴)))) |
| 11 | 4 | cjcld 15131 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐵 − 𝐴)) ∈ ℂ) |
| 12 | 6 | cjcld 15131 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐶 − 𝐴)) ∈ ℂ) |
| 13 | 6, 9 | cjne0d 15138 | . . . . . . 7 ⊢ (𝜑 → (∗‘(𝐶 − 𝐴)) ≠ 0) |
| 14 | 11, 12, 6, 13, 9 | divcan5rd 11956 | . . . . . 6 ⊢ (𝜑 → (((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) / ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) = ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴)))) |
| 15 | 11, 6 | mulcld 11164 | . . . . . . . 8 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℂ) |
| 16 | sigar | . . . . . . . . . . 11 ⊢ 𝐺 = (𝑥 ∈ ℂ, 𝑦 ∈ ℂ ↦ (ℑ‘((∗‘𝑥) · 𝑦))) | |
| 17 | 16 | sigarval 47208 | . . . . . . . . . 10 ⊢ (((𝐵 − 𝐴) ∈ ℂ ∧ (𝐶 − 𝐴) ∈ ℂ) → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)))) |
| 18 | 4, 6, 17 | syl2anc 585 | . . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)))) |
| 19 | sigardiv.c | . . . . . . . . 9 ⊢ (𝜑 → ((𝐵 − 𝐴)𝐺(𝐶 − 𝐴)) = 0) | |
| 20 | 18, 19 | eqtr3d 2774 | . . . . . . . 8 ⊢ (𝜑 → (ℑ‘((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴))) = 0) |
| 21 | 15, 20 | reim0bd 15135 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℝ) |
| 22 | 6, 12 | mulcomd 11165 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶 − 𝐴) · (∗‘(𝐶 − 𝐴))) = ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) |
| 23 | 6 | cjmulrcld 15141 | . . . . . . . 8 ⊢ (𝜑 → ((𝐶 − 𝐴) · (∗‘(𝐶 − 𝐴))) ∈ ℝ) |
| 24 | 22, 23 | eqeltrrd 2838 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴)) ∈ ℝ) |
| 25 | 12, 6, 13, 9 | mulne0d 11801 | . . . . . . 7 ⊢ (𝜑 → ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴)) ≠ 0) |
| 26 | 21, 24, 25 | redivcld 11981 | . . . . . 6 ⊢ (𝜑 → (((∗‘(𝐵 − 𝐴)) · (𝐶 − 𝐴)) / ((∗‘(𝐶 − 𝐴)) · (𝐶 − 𝐴))) ∈ ℝ) |
| 27 | 14, 26 | eqeltrrd 2838 | . . . . 5 ⊢ (𝜑 → ((∗‘(𝐵 − 𝐴)) / (∗‘(𝐶 − 𝐴))) ∈ ℝ) |
| 28 | 10, 27 | eqeltrd 2837 | . . . 4 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) ∈ ℝ) |
| 29 | 28 | cjred 15161 | . . 3 ⊢ (𝜑 → (∗‘(∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) = (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) |
| 30 | 4, 6, 9 | divcld 11929 | . . . 4 ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℂ) |
| 31 | 30 | cjcjd 15134 | . . 3 ⊢ (𝜑 → (∗‘(∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴)))) = ((𝐵 − 𝐴) / (𝐶 − 𝐴))) |
| 32 | 29, 31 | eqtr3d 2774 | . 2 ⊢ (𝜑 → (∗‘((𝐵 − 𝐴) / (𝐶 − 𝐴))) = ((𝐵 − 𝐴) / (𝐶 − 𝐴))) |
| 33 | 32, 28 | eqeltrrd 2838 | 1 ⊢ (𝜑 → ((𝐵 − 𝐴) / (𝐶 − 𝐴)) ∈ ℝ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ‘cfv 6500 (class class class)co 7368 ∈ cmpo 7370 ℂcc 11036 ℝcr 11037 0cc0 11038 · cmul 11043 − cmin 11376 / cdiv 11806 ∗ccj 15031 ℑcim 15033 |
| 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 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-cj 15034 df-re 15035 df-im 15036 |
| This theorem is referenced by: sigarcol 47222 sharhght 47223 |
| Copyright terms: Public domain | W3C validator |