| 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 20747 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ ℝ) |
| 6 | 1, 2, 5 | syl2anc 584 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ∈ ℝ) |
| 7 | 6 | recnd 11158 | . 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 20684 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐼‘𝑋) ∈ 𝐵) |
| 13 | 8, 2, 9, 12 | syl3anc 1373 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐼‘𝑋) ∈ 𝐵) |
| 14 | 3, 4 | abvcl 20747 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 15 | 1, 13, 14 | syl2anc 584 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 16 | 15 | recnd 11158 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℂ) |
| 17 | 3, 4, 10 | abvne0 20750 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐹‘𝑋) ≠ 0) |
| 18 | 1, 2, 9, 17 | syl3anc 1373 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ≠ 0) |
| 19 | eqid 2734 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 20 | eqid 2734 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 21 | 4, 10, 19, 20, 11 | drnginvrr 20688 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 22 | 8, 2, 9, 21 | syl3anc 1373 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 23 | 22 | fveq2d 6836 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = (𝐹‘(1r‘𝑅))) |
| 24 | 3, 4, 19 | abvmul 20752 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 25 | 1, 2, 13, 24 | syl3anc 1373 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 26 | 3, 20 | abv1 20756 | . . . 4 ⊢ ((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) → (𝐹‘(1r‘𝑅)) = 1) |
| 27 | 26 | adantr 480 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(1r‘𝑅)) = 1) |
| 28 | 23, 25, 27 | 3eqtr3d 2777 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋))) = 1) |
| 29 | 7, 16, 18, 28 | mvllmuld 11971 | 1 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) = (1 / (𝐹‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ‘cfv 6490 (class class class)co 7356 ℝcr 11023 0cc0 11024 1c1 11025 · cmul 11029 / cdiv 11792 Basecbs 17134 .rcmulr 17176 0gc0g 17357 1rcur 20114 invrcinvr 20321 DivRingcdr 20660 AbsValcabv 20739 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-rep 5222 ax-sep 5239 ax-nul 5249 ax-pow 5308 ax-pr 5375 ax-un 7678 ax-cnex 11080 ax-resscn 11081 ax-1cn 11082 ax-icn 11083 ax-addcl 11084 ax-addrcl 11085 ax-mulcl 11086 ax-mulrcl 11087 ax-mulcom 11088 ax-addass 11089 ax-mulass 11090 ax-distr 11091 ax-i2m1 11092 ax-1ne0 11093 ax-1rid 11094 ax-rnegex 11095 ax-rrecex 11096 ax-cnre 11097 ax-pre-lttri 11098 ax-pre-lttrn 11099 ax-pre-ltadd 11100 ax-pre-mulgt0 11101 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-iun 4946 df-br 5097 df-opab 5159 df-mpt 5178 df-tr 5204 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 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-2nd 7932 df-tpos 8166 df-frecs 8221 df-wrecs 8252 df-recs 8301 df-rdg 8339 df-er 8633 df-map 8763 df-en 8882 df-dom 8883 df-sdom 8884 df-pnf 11166 df-mnf 11167 df-xr 11168 df-ltxr 11169 df-le 11170 df-sub 11364 df-neg 11365 df-div 11793 df-nn 12144 df-2 12206 df-3 12207 df-ico 13265 df-sets 17089 df-slot 17107 df-ndx 17119 df-base 17135 df-ress 17156 df-plusg 17188 df-mulr 17189 df-0g 17359 df-mgm 18563 df-sgrp 18642 df-mnd 18658 df-grp 18864 df-minusg 18865 df-cmn 19709 df-abl 19710 df-mgp 20074 df-rng 20086 df-ur 20115 df-ring 20168 df-oppr 20271 df-dvdsr 20291 df-unit 20292 df-invr 20322 df-drng 20662 df-abv 20740 |
| This theorem is referenced by: abvdiv 20760 |
| Copyright terms: Public domain | W3C validator |