![]() |
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 11120 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐶 ≠ 0) → ∃𝑥 ∈ ℂ (𝐶 · 𝑥) = 1) | |
4 | 1, 2, 3 | syl2anc 584 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℂ (𝐶 · 𝑥) = 1) |
5 | oveq2 7024 | . . . 4 ⊢ ((𝐶 · 𝐴) = (𝐶 · 𝐵) → (𝑥 · (𝐶 · 𝐴)) = (𝑥 · (𝐶 · 𝐵))) | |
6 | simprl 767 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝑥 ∈ ℂ) | |
7 | 1 | adantr 481 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐶 ∈ ℂ) |
8 | 6, 7 | mulcomd 10508 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · 𝐶) = (𝐶 · 𝑥)) |
9 | simprr 769 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝐶 · 𝑥) = 1) | |
10 | 8, 9 | eqtrd 2831 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · 𝐶) = 1) |
11 | 10 | oveq1d 7031 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐴) = (1 · 𝐴)) |
12 | mulcand.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
13 | 12 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐴 ∈ ℂ) |
14 | 6, 7, 13 | mulassd 10510 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐴) = (𝑥 · (𝐶 · 𝐴))) |
15 | 13 | mulid2d 10505 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (1 · 𝐴) = 𝐴) |
16 | 11, 14, 15 | 3eqtr3d 2839 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · (𝐶 · 𝐴)) = 𝐴) |
17 | 10 | oveq1d 7031 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐵) = (1 · 𝐵)) |
18 | mulcand.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
19 | 18 | adantr 481 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐵 ∈ ℂ) |
20 | 6, 7, 19 | mulassd 10510 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐵) = (𝑥 · (𝐶 · 𝐵))) |
21 | 19 | mulid2d 10505 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (1 · 𝐵) = 𝐵) |
22 | 17, 20, 21 | 3eqtr3d 2839 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · (𝐶 · 𝐵)) = 𝐵) |
23 | 16, 22 | eqeq12d 2810 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · (𝐶 · 𝐴)) = (𝑥 · (𝐶 · 𝐵)) ↔ 𝐴 = 𝐵)) |
24 | 5, 23 | syl5ib 245 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝐶 · 𝐴) = (𝐶 · 𝐵) → 𝐴 = 𝐵)) |
25 | 4, 24 | rexlimddv 3254 | . 2 ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) → 𝐴 = 𝐵)) |
26 | oveq2 7024 | . 2 ⊢ (𝐴 = 𝐵 → (𝐶 · 𝐴) = (𝐶 · 𝐵)) | |
27 | 25, 26 | impbid1 226 | 1 ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 207 ∧ wa 396 = wceq 1522 ∈ wcel 2081 ≠ wne 2984 ∃wrex 3106 (class class class)co 7016 ℂcc 10381 0cc0 10383 1c1 10384 · cmul 10388 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1777 ax-4 1791 ax-5 1888 ax-6 1947 ax-7 1992 ax-8 2083 ax-9 2091 ax-10 2112 ax-11 2126 ax-12 2141 ax-13 2344 ax-ext 2769 ax-sep 5094 ax-nul 5101 ax-pow 5157 ax-pr 5221 ax-un 7319 ax-resscn 10440 ax-1cn 10441 ax-icn 10442 ax-addcl 10443 ax-addrcl 10444 ax-mulcl 10445 ax-mulrcl 10446 ax-mulcom 10447 ax-addass 10448 ax-mulass 10449 ax-distr 10450 ax-i2m1 10451 ax-1ne0 10452 ax-1rid 10453 ax-rnegex 10454 ax-rrecex 10455 ax-cnre 10456 ax-pre-lttri 10457 ax-pre-lttrn 10458 ax-pre-ltadd 10459 ax-pre-mulgt0 10460 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 843 df-3or 1081 df-3an 1082 df-tru 1525 df-ex 1762 df-nf 1766 df-sb 2043 df-mo 2576 df-eu 2612 df-clab 2776 df-cleq 2788 df-clel 2863 df-nfc 2935 df-ne 2985 df-nel 3091 df-ral 3110 df-rex 3111 df-reu 3112 df-rab 3114 df-v 3439 df-sbc 3707 df-csb 3812 df-dif 3862 df-un 3864 df-in 3866 df-ss 3874 df-nul 4212 df-if 4382 df-pw 4455 df-sn 4473 df-pr 4475 df-op 4479 df-uni 4746 df-br 4963 df-opab 5025 df-mpt 5042 df-id 5348 df-po 5362 df-so 5363 df-xp 5449 df-rel 5450 df-cnv 5451 df-co 5452 df-dm 5453 df-rn 5454 df-res 5455 df-ima 5456 df-iota 6189 df-fun 6227 df-fn 6228 df-f 6229 df-f1 6230 df-fo 6231 df-f1o 6232 df-fv 6233 df-riota 6977 df-ov 7019 df-oprab 7020 df-mpo 7021 df-er 8139 df-en 8358 df-dom 8359 df-sdom 8360 df-pnf 10523 df-mnf 10524 df-xr 10525 df-ltxr 10526 df-le 10527 df-sub 10719 df-neg 10720 |
This theorem is referenced by: mulcan2d 11122 mulcanad 11123 mulcan 11125 div11 11174 eqneg 11208 qredeq 15830 cncongr1 15840 prmirredlem 20322 tanarg 24883 quad2 25098 atandm2 25136 lgseisenlem2 25634 frrusgrord0 27811 fpprwppr 43406 affinecomb2 44191 rrx2linest 44230 itscnhlc0yqe 44247 itsclquadeu 44265 |
Copyright terms: Public domain | W3C validator |