| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > div2sub | Structured version Visualization version GIF version | ||
| Description: Swap the order of subtraction in a division. (Contributed by Scott Fenton, 24-Jun-2013.) |
| Ref | Expression |
|---|---|
| div2sub | ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐶 ≠ 𝐷)) → ((𝐴 − 𝐵) / (𝐶 − 𝐷)) = ((𝐵 − 𝐴) / (𝐷 − 𝐶))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subcl 11586 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 − 𝐵) ∈ ℂ) | |
| 2 | subcl 11586 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → (𝐶 − 𝐷) ∈ ℂ) | |
| 3 | 2 | 3adant3 1150 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐶 ≠ 𝐷) → (𝐶 − 𝐷) ∈ ℂ) |
| 4 | subeq0 11614 | . . . . . 6 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → ((𝐶 − 𝐷) = 0 ↔ 𝐶 = 𝐷)) | |
| 5 | 4 | necon3bid 3003 | . . . . 5 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → ((𝐶 − 𝐷) ≠ 0 ↔ 𝐶 ≠ 𝐷)) |
| 6 | 5 | biimp3ar 1500 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐶 ≠ 𝐷) → (𝐶 − 𝐷) ≠ 0) |
| 7 | 3, 6 | jca 521 | . . 3 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐶 ≠ 𝐷) → ((𝐶 − 𝐷) ∈ ℂ ∧ (𝐶 − 𝐷) ≠ 0)) |
| 8 | div2neg 12070 | . . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℂ ∧ (𝐶 − 𝐷) ∈ ℂ ∧ (𝐶 − 𝐷) ≠ 0) → ( -(𝐴 − 𝐵) / -(𝐶 − 𝐷)) = ((𝐴 − 𝐵) / (𝐶 − 𝐷))) | |
| 9 | 8 | 3expb 1138 | . . 3 ⊢ (((𝐴 − 𝐵) ∈ ℂ ∧ ((𝐶 − 𝐷) ∈ ℂ ∧ (𝐶 − 𝐷) ≠ 0)) → ( -(𝐴 − 𝐵) / -(𝐶 − 𝐷)) = ((𝐴 − 𝐵) / (𝐶 − 𝐷))) |
| 10 | 1, 7, 9 | syl2an 608 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐶 ≠ 𝐷)) → ( -(𝐴 − 𝐵) / -(𝐶 − 𝐷)) = ((𝐴 − 𝐵) / (𝐶 − 𝐷))) |
| 11 | negsubdi2 11647 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → -(𝐴 − 𝐵) = (𝐵 − 𝐴)) | |
| 12 | negsubdi2 11647 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → -(𝐶 − 𝐷) = (𝐷 − 𝐶)) | |
| 13 | 12 | 3adant3 1150 | . . 3 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐶 ≠ 𝐷) → -(𝐶 − 𝐷) = (𝐷 − 𝐶)) |
| 14 | 11, 13 | oveqan12d 7465 | . 2 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐶 ≠ 𝐷)) → ( -(𝐴 − 𝐵) / -(𝐶 − 𝐷)) = ((𝐵 − 𝐴) / (𝐷 − 𝐶))) |
| 15 | 10, 14 | eqtr3d 2800 | 1 ⊢ (((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) ∧ (𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ ∧ 𝐶 ≠ 𝐷)) → ((𝐴 − 𝐵) / (𝐶 − 𝐷)) = ((𝐵 − 𝐴) / (𝐷 − 𝐶))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 (class class class)co 7446 ℂcc 11228 0cc0 11230 − cmin 11571 -cneg 11572 / cdiv 12003 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-po 5564 df-so 5565 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 |
| This theorem is used by: div2subd 12173 |
| Copyright terms: Public domain | W3C validator |