Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mulcanapd | GIF version |
Description: Cancellation law for multiplication. (Contributed by Jim Kingdon, 21-Feb-2020.) |
Ref | Expression |
---|---|
mulcand.1 | ⊢ (𝜑 → 𝐴 ∈ ℂ) |
mulcand.2 | ⊢ (𝜑 → 𝐵 ∈ ℂ) |
mulcand.3 | ⊢ (𝜑 → 𝐶 ∈ ℂ) |
mulcand.4 | ⊢ (𝜑 → 𝐶 # 0) |
Ref | Expression |
---|---|
mulcanapd | ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mulcand.3 | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℂ) | |
2 | mulcand.4 | . . . 4 ⊢ (𝜑 → 𝐶 # 0) | |
3 | recexap 8382 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) → ∃𝑥 ∈ ℂ (𝐶 · 𝑥) = 1) | |
4 | 1, 2, 3 | syl2anc 408 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℂ (𝐶 · 𝑥) = 1) |
5 | oveq2 5750 | . . . 4 ⊢ ((𝐶 · 𝐴) = (𝐶 · 𝐵) → (𝑥 · (𝐶 · 𝐴)) = (𝑥 · (𝐶 · 𝐵))) | |
6 | simprl 505 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝑥 ∈ ℂ) | |
7 | 1 | adantr 274 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐶 ∈ ℂ) |
8 | 6, 7 | mulcomd 7755 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · 𝐶) = (𝐶 · 𝑥)) |
9 | simprr 506 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝐶 · 𝑥) = 1) | |
10 | 8, 9 | eqtrd 2150 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · 𝐶) = 1) |
11 | 10 | oveq1d 5757 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐴) = (1 · 𝐴)) |
12 | mulcand.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
13 | 12 | adantr 274 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐴 ∈ ℂ) |
14 | 6, 7, 13 | mulassd 7757 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐴) = (𝑥 · (𝐶 · 𝐴))) |
15 | 13 | mulid2d 7752 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (1 · 𝐴) = 𝐴) |
16 | 11, 14, 15 | 3eqtr3d 2158 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · (𝐶 · 𝐴)) = 𝐴) |
17 | 10 | oveq1d 5757 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐵) = (1 · 𝐵)) |
18 | mulcand.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
19 | 18 | adantr 274 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐵 ∈ ℂ) |
20 | 6, 7, 19 | mulassd 7757 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐵) = (𝑥 · (𝐶 · 𝐵))) |
21 | 19 | mulid2d 7752 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (1 · 𝐵) = 𝐵) |
22 | 17, 20, 21 | 3eqtr3d 2158 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · (𝐶 · 𝐵)) = 𝐵) |
23 | 16, 22 | eqeq12d 2132 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · (𝐶 · 𝐴)) = (𝑥 · (𝐶 · 𝐵)) ↔ 𝐴 = 𝐵)) |
24 | 5, 23 | syl5ib 153 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝐶 · 𝐴) = (𝐶 · 𝐵) → 𝐴 = 𝐵)) |
25 | 4, 24 | rexlimddv 2531 | . 2 ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) → 𝐴 = 𝐵)) |
26 | oveq2 5750 | . 2 ⊢ (𝐴 = 𝐵 → (𝐶 · 𝐴) = (𝐶 · 𝐵)) | |
27 | 25, 26 | impbid1 141 | 1 ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1316 ∈ wcel 1465 ∃wrex 2394 class class class wbr 3899 (class class class)co 5742 ℂcc 7586 0cc0 7588 1c1 7589 · cmul 7593 # cap 8311 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 588 ax-in2 589 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-13 1476 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-sep 4016 ax-pow 4068 ax-pr 4101 ax-un 4325 ax-setind 4422 ax-cnex 7679 ax-resscn 7680 ax-1cn 7681 ax-1re 7682 ax-icn 7683 ax-addcl 7684 ax-addrcl 7685 ax-mulcl 7686 ax-mulrcl 7687 ax-addcom 7688 ax-mulcom 7689 ax-addass 7690 ax-mulass 7691 ax-distr 7692 ax-i2m1 7693 ax-0lt1 7694 ax-1rid 7695 ax-0id 7696 ax-rnegex 7697 ax-precex 7698 ax-cnre 7699 ax-pre-ltirr 7700 ax-pre-ltwlin 7701 ax-pre-lttrn 7702 ax-pre-apti 7703 ax-pre-ltadd 7704 ax-pre-mulgt0 7705 ax-pre-mulext 7706 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-fal 1322 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ne 2286 df-nel 2381 df-ral 2398 df-rex 2399 df-reu 2400 df-rab 2402 df-v 2662 df-sbc 2883 df-dif 3043 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-br 3900 df-opab 3960 df-id 4185 df-po 4188 df-iso 4189 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-iota 5058 df-fun 5095 df-fv 5101 df-riota 5698 df-ov 5745 df-oprab 5746 df-mpo 5747 df-pnf 7770 df-mnf 7771 df-xr 7772 df-ltxr 7773 df-le 7774 df-sub 7903 df-neg 7904 df-reap 8305 df-ap 8312 |
This theorem is referenced by: mulcanap2d 8391 mulcanapad 8392 mulcanap 8394 div11ap 8428 eqneg 8460 dvdscmulr 11449 qredeq 11704 cncongr1 11711 |
Copyright terms: Public domain | W3C validator |