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 8407 | . . . 4 ⊢ ((𝐶 ∈ ℂ ∧ 𝐶 # 0) → ∃𝑥 ∈ ℂ (𝐶 · 𝑥) = 1) | |
4 | 1, 2, 3 | syl2anc 408 | . . 3 ⊢ (𝜑 → ∃𝑥 ∈ ℂ (𝐶 · 𝑥) = 1) |
5 | oveq2 5775 | . . . 4 ⊢ ((𝐶 · 𝐴) = (𝐶 · 𝐵) → (𝑥 · (𝐶 · 𝐴)) = (𝑥 · (𝐶 · 𝐵))) | |
6 | simprl 520 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝑥 ∈ ℂ) | |
7 | 1 | adantr 274 | . . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐶 ∈ ℂ) |
8 | 6, 7 | mulcomd 7780 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · 𝐶) = (𝐶 · 𝑥)) |
9 | simprr 521 | . . . . . . . 8 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝐶 · 𝑥) = 1) | |
10 | 8, 9 | eqtrd 2170 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · 𝐶) = 1) |
11 | 10 | oveq1d 5782 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐴) = (1 · 𝐴)) |
12 | mulcand.1 | . . . . . . . 8 ⊢ (𝜑 → 𝐴 ∈ ℂ) | |
13 | 12 | adantr 274 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐴 ∈ ℂ) |
14 | 6, 7, 13 | mulassd 7782 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐴) = (𝑥 · (𝐶 · 𝐴))) |
15 | 13 | mulid2d 7777 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (1 · 𝐴) = 𝐴) |
16 | 11, 14, 15 | 3eqtr3d 2178 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · (𝐶 · 𝐴)) = 𝐴) |
17 | 10 | oveq1d 5782 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐵) = (1 · 𝐵)) |
18 | mulcand.2 | . . . . . . . 8 ⊢ (𝜑 → 𝐵 ∈ ℂ) | |
19 | 18 | adantr 274 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → 𝐵 ∈ ℂ) |
20 | 6, 7, 19 | mulassd 7782 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · 𝐶) · 𝐵) = (𝑥 · (𝐶 · 𝐵))) |
21 | 19 | mulid2d 7777 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (1 · 𝐵) = 𝐵) |
22 | 17, 20, 21 | 3eqtr3d 2178 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → (𝑥 · (𝐶 · 𝐵)) = 𝐵) |
23 | 16, 22 | eqeq12d 2152 | . . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝑥 · (𝐶 · 𝐴)) = (𝑥 · (𝐶 · 𝐵)) ↔ 𝐴 = 𝐵)) |
24 | 5, 23 | syl5ib 153 | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ ℂ ∧ (𝐶 · 𝑥) = 1)) → ((𝐶 · 𝐴) = (𝐶 · 𝐵) → 𝐴 = 𝐵)) |
25 | 4, 24 | rexlimddv 2552 | . 2 ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) → 𝐴 = 𝐵)) |
26 | oveq2 5775 | . 2 ⊢ (𝐴 = 𝐵 → (𝐶 · 𝐴) = (𝐶 · 𝐵)) | |
27 | 25, 26 | impbid1 141 | 1 ⊢ (𝜑 → ((𝐶 · 𝐴) = (𝐶 · 𝐵) ↔ 𝐴 = 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 = wceq 1331 ∈ wcel 1480 ∃wrex 2415 class class class wbr 3924 (class class class)co 5767 ℂcc 7611 0cc0 7613 1c1 7614 · cmul 7618 # cap 8336 |
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 603 ax-in2 604 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-13 1491 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 ax-un 4350 ax-setind 4447 ax-cnex 7704 ax-resscn 7705 ax-1cn 7706 ax-1re 7707 ax-icn 7708 ax-addcl 7709 ax-addrcl 7710 ax-mulcl 7711 ax-mulrcl 7712 ax-addcom 7713 ax-mulcom 7714 ax-addass 7715 ax-mulass 7716 ax-distr 7717 ax-i2m1 7718 ax-0lt1 7719 ax-1rid 7720 ax-0id 7721 ax-rnegex 7722 ax-precex 7723 ax-cnre 7724 ax-pre-ltirr 7725 ax-pre-ltwlin 7726 ax-pre-lttrn 7727 ax-pre-apti 7728 ax-pre-ltadd 7729 ax-pre-mulgt0 7730 ax-pre-mulext 7731 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-fal 1337 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ne 2307 df-nel 2402 df-ral 2419 df-rex 2420 df-reu 2421 df-rab 2423 df-v 2683 df-sbc 2905 df-dif 3068 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-br 3925 df-opab 3985 df-id 4210 df-po 4213 df-iso 4214 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-iota 5083 df-fun 5120 df-fv 5126 df-riota 5723 df-ov 5770 df-oprab 5771 df-mpo 5772 df-pnf 7795 df-mnf 7796 df-xr 7797 df-ltxr 7798 df-le 7799 df-sub 7928 df-neg 7929 df-reap 8330 df-ap 8337 |
This theorem is referenced by: mulcanap2d 8416 mulcanapad 8417 mulcanap 8419 div11ap 8453 eqneg 8485 dvdscmulr 11511 qredeq 11766 cncongr1 11773 |
Copyright terms: Public domain | W3C validator |