| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > divrec | Structured version Visualization version GIF version | ||
| Description: Relationship between division and reciprocal. Theorem I.9 of [Apostol] p. 18. (Contributed by NM, 2-Aug-2004.) (Revised by Mario Carneiro, 27-May-2016.) |
| Ref | Expression |
|---|---|
| divrec | ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 / 𝐵) = (𝐴 · (1 / 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp2 1155 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → 𝐵 ∈ ℂ) | |
| 2 | simp1 1154 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → 𝐴 ∈ ℂ) | |
| 3 | reccl 12011 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (1 / 𝐵) ∈ ℂ) | |
| 4 | 3 | 3adant1 1148 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (1 / 𝐵) ∈ ℂ) |
| 5 | 1, 2, 4 | mul12d 11549 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 · (𝐴 · (1 / 𝐵))) = (𝐴 · (𝐵 · (1 / 𝐵)))) |
| 6 | recid 12018 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 · (1 / 𝐵)) = 1) | |
| 7 | 6 | 3adant1 1148 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 · (1 / 𝐵)) = 1) |
| 8 | 7 | oveq2d 7462 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 · (𝐵 · (1 / 𝐵))) = (𝐴 · 1)) |
| 9 | 2 | mulridd 11356 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 · 1) = 𝐴) |
| 10 | 5, 8, 9 | 3eqtrd 2802 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 · (𝐴 · (1 / 𝐵))) = 𝐴) |
| 11 | 2, 4 | mulcld 11359 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 · (1 / 𝐵)) ∈ ℂ) |
| 12 | 3simpc 1168 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) | |
| 13 | divmul 12007 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴 · (1 / 𝐵)) ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) → ((𝐴 / 𝐵) = (𝐴 · (1 / 𝐵)) ↔ (𝐵 · (𝐴 · (1 / 𝐵))) = 𝐴)) | |
| 14 | 2, 11, 12, 13 | syl3anc 1399 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → ((𝐴 / 𝐵) = (𝐴 · (1 / 𝐵)) ↔ (𝐵 · (𝐴 · (1 / 𝐵))) = 𝐴)) |
| 15 | 10, 14 | mpbird 260 | 1 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 / 𝐵) = (𝐴 · (1 / 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 (class class class)co 7446 ℂcc 11228 0cc0 11230 1c1 11231 · cmul 11235 / cdiv 12003 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-opab 5172 df-mpt 5191 df-id 5551 df-po 5564 df-so 5565 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-er 8748 df-en 9005 df-dom 9006 df-sdom 9007 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 |
| This theorem is used by: divrec2 12021 divass 12022 divdir 12029 divneg 12038 rec11 12045 divdiv32 12055 redivcl 12066 divreczi 12085 divrecd 12126 ltdiv2 12233 lediv2 12237 qdivcl 13128 expdiv 14286 0.999... 16082 efsub 16300 efival 16352 ef01bndlem 16384 cos01bnd 16386 rpnnen2lem11 16424 prmreclem5 17130 divcn 25222 divccn 25227 subfaclim 36133 lediv2aALT 36622 heiborlem7 38954 ofdivrec 45513 |
| Copyright terms: Public domain | W3C validator |