| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abvrec | Structured version Visualization version GIF version | ||
| Description: The absolute value distributes under reciprocal. (Contributed by Mario Carneiro, 10-Sep-2014.) |
| Ref | Expression |
|---|---|
| abv0.a | ⊢ 𝐴 = (AbsVal‘𝑅) |
| abvneg.b | ⊢ 𝐵 = (Base‘𝑅) |
| abvrec.z | ⊢ 0 = (0g‘𝑅) |
| abvrec.p | ⊢ 𝐼 = (invr‘𝑅) |
| Ref | Expression |
|---|---|
| abvrec | ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) = (1 / (𝐹‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simplr 768 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝐹 ∈ 𝐴) | |
| 2 | simprl 770 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑋 ∈ 𝐵) | |
| 3 | abv0.a | . . . . 5 ⊢ 𝐴 = (AbsVal‘𝑅) | |
| 4 | abvneg.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 3, 4 | abvcl 20774 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ ℝ) |
| 6 | 1, 2, 5 | syl2anc 584 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ∈ ℝ) |
| 7 | 6 | recnd 11261 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ∈ ℂ) |
| 8 | simpll 766 | . . . . 5 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑅 ∈ DivRing) | |
| 9 | simprr 772 | . . . . 5 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑋 ≠ 0 ) | |
| 10 | abvrec.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 11 | abvrec.p | . . . . . 6 ⊢ 𝐼 = (invr‘𝑅) | |
| 12 | 4, 10, 11 | drnginvrcl 20711 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐼‘𝑋) ∈ 𝐵) |
| 13 | 8, 2, 9, 12 | syl3anc 1373 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐼‘𝑋) ∈ 𝐵) |
| 14 | 3, 4 | abvcl 20774 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 15 | 1, 13, 14 | syl2anc 584 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 16 | 15 | recnd 11261 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℂ) |
| 17 | 3, 4, 10 | abvne0 20777 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐹‘𝑋) ≠ 0) |
| 18 | 1, 2, 9, 17 | syl3anc 1373 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ≠ 0) |
| 19 | eqid 2735 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 20 | eqid 2735 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 21 | 4, 10, 19, 20, 11 | drnginvrr 20715 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 22 | 8, 2, 9, 21 | syl3anc 1373 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 23 | 22 | fveq2d 6879 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = (𝐹‘(1r‘𝑅))) |
| 24 | 3, 4, 19 | abvmul 20779 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 25 | 1, 2, 13, 24 | syl3anc 1373 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 26 | 3, 20 | abv1 20783 | . . . 4 ⊢ ((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) → (𝐹‘(1r‘𝑅)) = 1) |
| 27 | 26 | adantr 480 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(1r‘𝑅)) = 1) |
| 28 | 23, 25, 27 | 3eqtr3d 2778 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋))) = 1) |
| 29 | 7, 16, 18, 28 | mvllmuld 12071 | 1 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) = (1 / (𝐹‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2108 ≠ wne 2932 ‘cfv 6530 (class class class)co 7403 ℝcr 11126 0cc0 11127 1c1 11128 · cmul 11132 / cdiv 11892 Basecbs 17226 .rcmulr 17270 0gc0g 17451 1rcur 20139 invrcinvr 20345 DivRingcdr 20687 AbsValcabv 20766 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7727 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-op 4608 df-uni 4884 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-lim 6357 df-suc 6358 df-iota 6483 df-fun 6532 df-fn 6533 df-f 6534 df-f1 6535 df-fo 6536 df-f1o 6537 df-fv 6538 df-riota 7360 df-ov 7406 df-oprab 7407 df-mpo 7408 df-om 7860 df-2nd 7987 df-tpos 8223 df-frecs 8278 df-wrecs 8309 df-recs 8383 df-rdg 8422 df-er 8717 df-map 8840 df-en 8958 df-dom 8959 df-sdom 8960 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11466 df-neg 11467 df-div 11893 df-nn 12239 df-2 12301 df-3 12302 df-ico 13366 df-sets 17181 df-slot 17199 df-ndx 17211 df-base 17227 df-ress 17250 df-plusg 17282 df-mulr 17283 df-0g 17453 df-mgm 18616 df-sgrp 18695 df-mnd 18711 df-grp 18917 df-minusg 18918 df-cmn 19761 df-abl 19762 df-mgp 20099 df-rng 20111 df-ur 20140 df-ring 20193 df-oppr 20295 df-dvdsr 20315 df-unit 20316 df-invr 20346 df-drng 20689 df-abv 20767 |
| This theorem is referenced by: abvdiv 20787 |
| Copyright terms: Public domain | W3C validator |