| 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 769 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝐹 ∈ 𝐴) | |
| 2 | simprl 771 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑋 ∈ 𝐵) | |
| 3 | abv0.a | . . . . 5 ⊢ 𝐴 = (AbsVal‘𝑅) | |
| 4 | abvneg.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 3, 4 | abvcl 20793 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ ℝ) |
| 6 | 1, 2, 5 | syl2anc 585 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ∈ ℝ) |
| 7 | 6 | recnd 11173 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ∈ ℂ) |
| 8 | simpll 767 | . . . . 5 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑅 ∈ DivRing) | |
| 9 | simprr 773 | . . . . 5 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑋 ≠ 0 ) | |
| 10 | abvrec.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 11 | abvrec.p | . . . . . 6 ⊢ 𝐼 = (invr‘𝑅) | |
| 12 | 4, 10, 11 | drnginvrcl 20730 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐼‘𝑋) ∈ 𝐵) |
| 13 | 8, 2, 9, 12 | syl3anc 1374 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐼‘𝑋) ∈ 𝐵) |
| 14 | 3, 4 | abvcl 20793 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 15 | 1, 13, 14 | syl2anc 585 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 16 | 15 | recnd 11173 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℂ) |
| 17 | 3, 4, 10 | abvne0 20796 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐹‘𝑋) ≠ 0) |
| 18 | 1, 2, 9, 17 | syl3anc 1374 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ≠ 0) |
| 19 | eqid 2736 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 20 | eqid 2736 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 21 | 4, 10, 19, 20, 11 | drnginvrr 20734 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 22 | 8, 2, 9, 21 | syl3anc 1374 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 23 | 22 | fveq2d 6844 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = (𝐹‘(1r‘𝑅))) |
| 24 | 3, 4, 19 | abvmul 20798 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 25 | 1, 2, 13, 24 | syl3anc 1374 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 26 | 3, 20 | abv1 20802 | . . . 4 ⊢ ((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) → (𝐹‘(1r‘𝑅)) = 1) |
| 27 | 26 | adantr 480 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(1r‘𝑅)) = 1) |
| 28 | 23, 25, 27 | 3eqtr3d 2779 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋))) = 1) |
| 29 | 7, 16, 18, 28 | mvllmuld 11987 | 1 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) = (1 / (𝐹‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ≠ wne 2932 ‘cfv 6498 (class class class)co 7367 ℝcr 11037 0cc0 11038 1c1 11039 · cmul 11043 / cdiv 11807 Basecbs 17179 .rcmulr 17221 0gc0g 17402 1rcur 20162 invrcinvr 20367 DivRingcdr 20706 AbsValcabv 20785 |
| 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 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-tpos 8176 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-nn 12175 df-2 12244 df-3 12245 df-ico 13304 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-cmn 19757 df-abl 19758 df-mgp 20122 df-rng 20134 df-ur 20163 df-ring 20216 df-oppr 20317 df-dvdsr 20337 df-unit 20338 df-invr 20368 df-drng 20708 df-abv 20786 |
| This theorem is referenced by: abvdiv 20806 |
| Copyright terms: Public domain | W3C validator |