Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mulcand | Structured version Visualization version GIF version |
Description: Cancellation law for multiplication. Theorem I.7 of [Apostol] p. 18. (Contributed by NM, 26-Jan-1995.) (Revised by Mario Carneiro, 27-May-2016.) |
Ref | Expression |
---|---|
mulcand.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
mulcand.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
mulcand.3 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
mulcand.4 | ⊢ (𝜑 → 𝐶 ≠ 0) |
Ref | Expression |
---|---|
mulcand | ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mulcand.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
2 | mulcand.4 | . . . 4 ⊢ (𝜑 → 𝐶 ≠ 0) | |
3 | recex 11271 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐶 ≠ 0) → ∃𝑥 ∈ ℂ (𝐶 · 𝑥) = 1) | |
4 | 1, 2, 3 | syl2anc 586 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℂ (𝐶 · 𝑥) = 1) |
5 | oveq2 7163 | . . . 4 ⊢ ((𝐶 · 𝐴) = (𝐶 · 𝐵) → (𝑥 · (𝐶 · 𝐴)) = (𝑥 · (𝐶 · 𝐵))) | |
6 | simprl 769 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝑥 ∈ ℂ) | |
7 | 1 | adantr 483 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐶 ∈ ℂ) |
8 | 6, 7 | mulcomd 10661 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · 𝐶) = (𝐶 · 𝑥)) |
9 | simprr 771 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝐶 · 𝑥) = 1) | |
10 | 8, 9 | eqtrd 2856 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · 𝐶) = 1) |
11 | 10 | oveq1d 7170 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐴) = (1 · 𝐴)) |
12 | mulcand.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
13 | 12 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐴 ∈ ℂ) |
14 | 6, 7, 13 | mulassd 10663 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐴) = (𝑥 · (𝐶 · 𝐴))) |
15 | 13 | mulid2d 10658 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (1 · 𝐴) = 𝐴) |
16 | 11, 14, 15 | 3eqtr3d 2864 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · (𝐶 · 𝐴)) = 𝐴) |
17 | 10 | oveq1d 7170 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐵) = (1 · 𝐵)) |
18 | mulcand.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
19 | 18 | adantr 483 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐵 ∈ ℂ) |
20 | 6, 7, 19 | mulassd 10663 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐵) = (𝑥 · (𝐶 · 𝐵))) |
21 | 19 | mulid2d 10658 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (1 · 𝐵) = 𝐵) |
22 | 17, 20, 21 | 3eqtr3d 2864 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · (𝐶 · 𝐵)) = 𝐵) |
23 | 16, 22 | eqeq12d 2837 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · (𝐶 · 𝐴)) = (𝑥 · (𝐶 · 𝐵)) ↔ 𝐴 = 𝐵)) |
24 | 5, 23 | syl5ib 246 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝐶 · 𝐴) = (𝐶 · 𝐵) → 𝐴 = 𝐵)) |
25 | 4, 24 | rexlimddv 3291 | . 2 ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) → 𝐴 = 𝐵)) |
26 | oveq2 7163 | . 2 ⊢ (𝐴 = 𝐵 → (𝐶 · 𝐴) = (𝐶 · 𝐵)) | |
27 | 25, 26 | impbid1 227 | 1 ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1533 ∈ wcel 2110 ≠ wne 3016 ∃wrex 3139 (class class class)co 7155 ℂcc 10534 0cc0 10536 1c1 10537 · cmul 10541 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 ax-un 7460 ax-resscn 10593 ax-1cn 10594 ax-icn 10595 ax-addcl 10596 ax-addrcl 10597 ax-mulcl 10598 ax-mulrcl 10599 ax-mulcom 10600 ax-addass 10601 ax-mulass 10602 ax-distr 10603 ax-i2m1 10604 ax-1ne0 10605 ax-1rid 10606 ax-rnegex 10607 ax-rrecex 10608 ax-cnre 10609 ax-pre-lttri 10610 ax-pre-lttrn 10611 ax-pre-ltadd 10612 ax-pre-mulgt0 10613 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-mpt 5146 df-id 5459 df-po 5473 df-so 5474 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-res 5566 df-ima 5567 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-f1 6359 df-fo 6360 df-f1o 6361 df-fv 6362 df-riota 7113 df-ov 7158 df-oprab 7159 df-mpo 7160 df-er 8288 df-en 8509 df-dom 8510 df-sdom 8511 df-pnf 10676 df-mnf 10677 df-xr 10678 df-ltxr 10679 df-le 10680 df-sub 10871 df-neg 10872 |
This theorem is referenced by: mulcan2d 11273 mulcanad 11274 mulcan 11276 div11 11325 eqneg 11359 qredeq 16000 cncongr1 16010 prmirredlem 20639 tanarg 25201 quad2 25416 atandm2 25454 lgseisenlem2 25951 frrusgrord0 28118 fpprwppr 43903 affinecomb2 44689 rrx2linest 44728 itscnhlc0yqe 44745 itsclquadeu 44763 |
Copyright terms: Public domain | W3C validator |