| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cjdiv | Structured version Visualization version GIF version | ||
| Description: Complex conjugate distributes over division. (Contributed by NM, 29-Apr-2005.) (Proof shortened by Mario Carneiro, 29-May-2016.) |
| Ref | Expression |
|---|---|
| cjdiv | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (∗‘(𝐴 / 𝐵)) = ((∗‘𝐴) / (∗‘𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | divcl 11804 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 / 𝐵) ∈ ℂ) | |
| 2 | cjcl 15056 | . . . 4 ⊢ ((𝐴 / 𝐵) ∈ ℂ → (∗‘(𝐴 / 𝐵)) ∈ ℂ) | |
| 3 | 1, 2 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (∗‘(𝐴 / 𝐵)) ∈ ℂ) |
| 4 | simp2 1138 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → 𝐵 ∈ ℂ) | |
| 5 | cjcl 15056 | . . . 4 ⊢ (𝐵 ∈ ℂ → (∗‘𝐵) ∈ ℂ) | |
| 6 | 4, 5 | syl 17 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (∗‘𝐵) ∈ ℂ) |
| 7 | simp3 1139 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → 𝐵 ≠ 0) | |
| 8 | cjne0 15114 | . . . . 5 ⊢ (𝐵 ∈ ℂ → (𝐵 ≠ 0 ↔ (∗‘𝐵) ≠ 0)) | |
| 9 | 4, 8 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 ≠ 0 ↔ (∗‘𝐵) ≠ 0)) |
| 10 | 7, 9 | mpbid 232 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (∗‘𝐵) ≠ 0) |
| 11 | 3, 6, 10 | divcan4d 11926 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (((∗‘(𝐴 / 𝐵)) · (∗‘𝐵)) / (∗‘𝐵)) = (∗‘(𝐴 / 𝐵))) |
| 12 | cjmul 15093 | . . . . 5 ⊢ (((𝐴 / 𝐵) ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∗‘((𝐴 / 𝐵) · 𝐵)) = ((∗‘(𝐴 / 𝐵)) · (∗‘𝐵))) | |
| 13 | 1, 4, 12 | syl2anc 585 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (∗‘((𝐴 / 𝐵) · 𝐵)) = ((∗‘(𝐴 / 𝐵)) · (∗‘𝐵))) |
| 14 | divcan1 11807 | . . . . 5 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → ((𝐴 / 𝐵) · 𝐵) = 𝐴) | |
| 15 | 14 | fveq2d 6836 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (∗‘((𝐴 / 𝐵) · 𝐵)) = (∗‘𝐴)) |
| 16 | 13, 15 | eqtr3d 2774 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → ((∗‘(𝐴 / 𝐵)) · (∗‘𝐵)) = (∗‘𝐴)) |
| 17 | 16 | oveq1d 7373 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (((∗‘(𝐴 / 𝐵)) · (∗‘𝐵)) / (∗‘𝐵)) = ((∗‘𝐴) / (∗‘𝐵))) |
| 18 | 11, 17 | eqtr3d 2774 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (∗‘(𝐴 / 𝐵)) = ((∗‘𝐴) / (∗‘𝐵))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ≠ wne 2933 ‘cfv 6490 (class class class)co 7358 ℂcc 11025 0cc0 11027 · cmul 11032 / cdiv 11796 ∗ccj 15047 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5517 df-eprel 5522 df-po 5530 df-so 5531 df-fr 5575 df-we 5577 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-pred 6257 df-ord 6318 df-on 6319 df-lim 6320 df-suc 6321 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8222 df-wrecs 8253 df-recs 8302 df-rdg 8340 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-div 11797 df-nn 12164 df-2 12233 df-cj 15050 df-re 15051 df-im 15052 |
| This theorem is referenced by: cjdivi 15142 cjdivd 15174 dipcj 30805 |
| Copyright terms: Public domain | W3C validator |