| 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 781 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝐹 ∈ 𝐴) | |
| 2 | simprl 783 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑋 ∈ 𝐵) | |
| 3 | abv0.a | . . . . 5 ⊢ 𝐴 = (AbsVal‘𝑅) | |
| 4 | abvneg.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 5 | 3, 4 | abvcl 21124 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ ℝ) |
| 6 | 1, 2, 5 | syl2anc 596 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ∈ ℝ) |
| 7 | 6 | recnd 11376 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ∈ ℂ) |
| 8 | simpll 779 | . . . . 5 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑅 ∈ DivRing) | |
| 9 | simprr 785 | . . . . 5 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → 𝑋 ≠ 0 ) | |
| 10 | abvrec.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 11 | abvrec.p | . . . . . 6 ⊢ 𝐼 = (invr‘𝑅) | |
| 12 | 4, 10, 11 | drnginvrcl 21062 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐼‘𝑋) ∈ 𝐵) |
| 13 | 8, 2, 9, 12 | syl3anc 1399 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐼‘𝑋) ∈ 𝐵) |
| 14 | 3, 4 | abvcl 21124 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 15 | 1, 13, 14 | syl2anc 596 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 16 | 15 | recnd 11376 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℂ) |
| 17 | 3, 4, 10 | abvne0 21127 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐹‘𝑋) ≠ 0) |
| 18 | 1, 2, 9, 17 | syl3anc 1399 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ≠ 0) |
| 19 | eqid 2763 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 20 | eqid 2763 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 21 | 4, 10, 19, 20, 11 | drnginvrr 21066 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 22 | 8, 2, 9, 21 | syl3anc 1399 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 23 | 22 | fveq2d 6920 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = (𝐹‘(1r‘𝑅))) |
| 24 | 3, 4, 19 | abvmul 21129 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 25 | 1, 2, 13, 24 | syl3anc 1399 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 26 | 3, 20 | abv1 21133 | . . . 4 ⊢ ((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) → (𝐹‘(1r‘𝑅)) = 1) |
| 27 | 26 | adantr 486 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(1r‘𝑅)) = 1) |
| 28 | 23, 25, 27 | 3eqtr3d 2806 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋))) = 1) |
| 29 | 7, 16, 18, 28 | mvllmuld 12189 | 1 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) = (1 / (𝐹‘𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ‘cfv 6566 (class class class)co 7451 ℝcr 11238 0cc0 11239 1c1 11240 · cmul 11244 / cdiv 12013 Basecbs 17431 .rcmulr 17473 0gc0g 17660 1rcur 20458 invrcinvr 20668 DivRingcdr 21031 AbsValcabv 21116 |
| 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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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-pss 4017 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 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-tpos 8281 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-map 8887 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-ico 13522 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-ur 20459 df-ring 20512 df-oppr 20618 df-dvdsr 20638 df-unit 20639 df-invr 20669 df-drng 21033 df-abv 21117 |
| This theorem is used by: abvdiv 21137 |
| Copyright terms: Public domain | W3C validator |