| 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 11907 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (1 / 𝐵) ∈ ℂ) | |
| 4 | 3 | 3adant1 1148 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (1 / 𝐵) ∈ ℂ) |
| 5 | 1, 2, 4 | mul12d 11447 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 · (𝐴 · (1 / 𝐵))) = (𝐴 · (𝐵 · (1 / 𝐵)))) |
| 6 | recid 11914 | . . . . 5 ⊢ ((𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 · (1 / 𝐵)) = 1) | |
| 7 | 6 | 3adant1 1148 | . . . 4 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 · (1 / 𝐵)) = 1) |
| 8 | 7 | oveq2d 7433 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 · (𝐵 · (1 / 𝐵))) = (𝐴 · 1)) |
| 9 | 2 | mulridd 11254 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 · 1) = 𝐴) |
| 10 | 5, 8, 9 | 3eqtrd 2801 | . 2 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 · (𝐴 · (1 / 𝐵))) = 𝐴) |
| 11 | 2, 4 | mulcld 11257 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐴 · (1 / 𝐵)) ∈ ℂ) |
| 12 | 3simpc 1168 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ ∧ 𝐵 ≠ 0) → (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) | |
| 13 | divmul 11903 | . . 3 ⊢ ((𝐴 ∈ ℂ ∧ (𝐴 · (1 / 𝐵)) ∈ ℂ ∧ (𝐵 ∈ ℂ ∧ 𝐵 ≠ 0)) → ((𝐴 / 𝐵) = (𝐴 · (1 / 𝐵)) ↔ (𝐵 · (𝐴 · (1 / 𝐵))) = 𝐴)) | |
| 14 | 2, 11, 12, 13 | syl3anc 1398 | . 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 2145 ≠ wne 2957 (class class class)co 7417 ℂcc 11126 0cc0 11128 1c1 11129 · cmul 11133 / cdiv 11899 |
| 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 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 |
| 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 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-mpt 5191 df-id 5554 df-po 5567 df-so 5568 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-er 8700 df-en 8957 df-dom 8958 df-sdom 8959 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-div 11900 |
| This theorem is used by: divrec2 11917 divass 11918 divdir 11925 divneg 11934 rec11 11941 divdiv32 11951 redivcl 11962 divreczi 11981 divrecd 12022 ltdiv2 12129 lediv2 12133 qdivcl 13024 expdiv 14181 0.999... 15974 efsub 16194 efival 16246 ef01bndlem 16278 cos01bnd 16280 rpnnen2lem11 16318 prmreclem5 17018 divcn 25102 divccn 25107 subfaclim 35775 lediv2aALT 36264 heiborlem7 38575 ofdivrec 45158 |
| Copyright terms: Public domain | W3C validator |