| 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 21085 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ ℝ) |
| 6 | 1, 2, 5 | syl2anc 596 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ∈ ℝ) |
| 7 | 6 | recnd 11347 | . 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 21023 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐼‘𝑋) ∈ 𝐵) |
| 13 | 8, 2, 9, 12 | syl3anc 1398 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐼‘𝑋) ∈ 𝐵) |
| 14 | 3, 4 | abvcl 21085 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 15 | 1, 13, 14 | syl2anc 596 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℝ) |
| 16 | 15 | recnd 11347 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) ∈ ℂ) |
| 17 | 3, 4, 10 | abvne0 21088 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐹‘𝑋) ≠ 0) |
| 18 | 1, 2, 9, 17 | syl3anc 1398 | . 2 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘𝑋) ≠ 0) |
| 19 | eqid 2763 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 20 | eqid 2763 | . . . . . 6 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
| 21 | 4, 10, 19, 20, 11 | drnginvrr 21027 | . . . . 5 ⊢ ((𝑅 ∈ DivRing ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 22 | 8, 2, 9, 21 | syl3anc 1398 | . . . 4 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝑋(.r‘𝑅)(𝐼‘𝑋)) = (1r‘𝑅)) |
| 23 | 22 | fveq2d 6897 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = (𝐹‘(1r‘𝑅))) |
| 24 | 3, 4, 19 | abvmul 21090 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ (𝐼‘𝑋) ∈ 𝐵) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 25 | 1, 2, 13, 24 | syl3anc 1398 | . . 3 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝑋(.r‘𝑅)(𝐼‘𝑋))) = ((𝐹‘𝑋) · (𝐹‘(𝐼‘𝑋)))) |
| 26 | 3, 20 | abv1 21094 | . . . 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 12159 | 1 ⊢ (((𝑅 ∈ DivRing ∧ 𝐹 ∈ 𝐴) ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 )) → (𝐹‘(𝐼‘𝑋)) = (1 / (𝐹‘𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∈ wcel 2146 ≠ wne 2958 ‘cfv 6546 (class class class)co 7427 ℝcr 11209 0cc0 11210 1c1 11211 · cmul 11215 / cdiv 11983 Basecbs 17399 .rcmulr 17441 0gc0g 17622 1rcur 20419 invrcinvr 20629 DivRingcdr 20992 AbsValcabv 21077 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1944 ax-6 2001 ax-7 2042 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2196 ax-12 2215 ax-ext 2735 ax-rep 5234 ax-sep 5251 ax-nul 5262 ax-pow 5330 ax-pr 5394 ax-un 7758 ax-cnex 11266 ax-resscn 11267 ax-1cn 11268 ax-icn 11269 ax-addcl 11270 ax-addrcl 11271 ax-mulcl 11272 ax-mulrcl 11273 ax-mulcom 11274 ax-addass 11275 ax-mulass 11276 ax-distr 11277 ax-i2m1 11278 ax-1ne0 11279 ax-1rid 11280 ax-rnegex 11281 ax-rrecex 11282 ax-cnre 11283 ax-pre-lttri 11284 ax-pre-lttrn 11285 ax-pre-ltadd 11286 ax-pre-mulgt0 11287 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2101 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-nel 3065 df-ral 3080 df-rex 3090 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-pss 4016 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4838 df-uni 4870 df-iun 4955 df-br 5106 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5549 df-eprel 5554 df-po 5562 df-so 5563 df-fr 5607 df-we 5609 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 6310 df-ord 6371 df-on 6372 df-lim 6373 df-suc 6374 df-iota 6500 df-fun 6548 df-fn 6549 df-f 6550 df-f1 6551 df-fo 6552 df-f1o 6553 df-fv 6554 df-riota 7384 df-ov 7430 df-oprab 7431 df-mpo 7432 df-om 7885 df-2nd 8009 df-tpos 8254 df-frecs 8310 df-wrecs 8341 df-recs 8390 df-rdg 8429 df-er 8728 df-map 8860 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11355 df-mnf 11356 df-xr 11357 df-ltxr 11358 df-le 11359 df-sub 11553 df-neg 11554 df-div 11984 df-nn 12346 df-2 12415 df-3 12416 df-ico 13492 df-sets 17354 df-slot 17372 df-ndx 17384 df-base 17400 df-ress 17421 df-plusg 17453 df-mulr 17454 df-0g 17624 df-mgm 18828 df-sgrp 18920 df-mnd 18936 df-grp 19159 df-minusg 19160 df-cmn 20008 df-abl 20009 df-mgp 20373 df-rng 20387 df-ur 20420 df-ring 20473 df-oppr 20579 df-dvdsr 20599 df-unit 20600 df-invr 20630 df-drng 20994 df-abv 21078 |
| This theorem is used by: abvdiv 21098 |
| Copyright terms: Public domain | W3C validator |