![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > dvrdir | GIF version |
Description: Distributive law for the division operation of a ring. (Contributed by Thierry Arnoux, 30-Oct-2017.) |
Ref | Expression |
---|---|
dvrdir.b | ⊢ 𝐵 = (Base‘𝑅) |
dvrdir.u | ⊢ 𝑈 = (Unit‘𝑅) |
dvrdir.p | ⊢ + = (+g‘𝑅) |
dvrdir.t | ⊢ / = (/r‘𝑅) |
Ref | Expression |
---|---|
dvrdir | ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌) / 𝑍) = ((𝑋 / 𝑍) + (𝑌 / 𝑍))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl 109 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑅 ∈ Ring) | |
2 | simpr1 1005 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑋 ∈ 𝐵) | |
3 | simpr2 1006 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑌 ∈ 𝐵) | |
4 | dvrdir.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
5 | 4 | a1i 9 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝐵 = (Base‘𝑅)) |
6 | dvrdir.u | . . . . 5 ⊢ 𝑈 = (Unit‘𝑅) | |
7 | 6 | a1i 9 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑈 = (Unit‘𝑅)) |
8 | ringsrg 13546 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing) | |
9 | 8 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑅 ∈ SRing) |
10 | simpr3 1007 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑍 ∈ 𝑈) | |
11 | eqid 2193 | . . . . . 6 ⊢ (invr‘𝑅) = (invr‘𝑅) | |
12 | 6, 11 | unitinvcl 13622 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑍 ∈ 𝑈) → ((invr‘𝑅)‘𝑍) ∈ 𝑈) |
13 | 10, 12 | syldan 282 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((invr‘𝑅)‘𝑍) ∈ 𝑈) |
14 | 5, 7, 9, 13 | unitcld 13607 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((invr‘𝑅)‘𝑍) ∈ 𝐵) |
15 | dvrdir.p | . . . 4 ⊢ + = (+g‘𝑅) | |
16 | eqid 2193 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
17 | 4, 15, 16 | ringdir 13518 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ ((invr‘𝑅)‘𝑍) ∈ 𝐵)) → ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
18 | 1, 2, 3, 14, 17 | syl13anc 1251 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
19 | eqidd 2194 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (.r‘𝑅) = (.r‘𝑅)) | |
20 | eqidd 2194 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (invr‘𝑅) = (invr‘𝑅)) | |
21 | dvrdir.t | . . . 4 ⊢ / = (/r‘𝑅) | |
22 | 21 | a1i 9 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → / = (/r‘𝑅)) |
23 | ringgrp 13500 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
24 | 23 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑅 ∈ Grp) |
25 | 4, 15, 24, 2, 3 | grpcld 13089 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑋 + 𝑌) ∈ 𝐵) |
26 | 5, 19, 7, 20, 22, 1, 25, 10 | dvrvald 13633 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌) / 𝑍) = ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
27 | 5, 19, 7, 20, 22, 1, 2, 10 | dvrvald 13633 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑋 / 𝑍) = (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
28 | 5, 19, 7, 20, 22, 1, 3, 10 | dvrvald 13633 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑌 / 𝑍) = (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
29 | 27, 28 | oveq12d 5937 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 / 𝑍) + (𝑌 / 𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
30 | 18, 26, 29 | 3eqtr4d 2236 | 1 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌) / 𝑍) = ((𝑋 / 𝑍) + (𝑌 / 𝑍))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ‘cfv 5255 (class class class)co 5919 Basecbs 12621 +gcplusg 12698 .rcmulr 12699 Grpcgrp 13075 SRingcsrg 13462 Ringcrg 13495 Unitcui 13586 invrcinvr 13619 /rcdvr 13630 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-coll 4145 ax-sep 4148 ax-nul 4156 ax-pow 4204 ax-pr 4239 ax-un 4465 ax-setind 4570 ax-cnex 7965 ax-resscn 7966 ax-1cn 7967 ax-1re 7968 ax-icn 7969 ax-addcl 7970 ax-addrcl 7971 ax-mulcl 7972 ax-addcom 7974 ax-addass 7976 ax-i2m1 7979 ax-0lt1 7980 ax-0id 7982 ax-rnegex 7983 ax-pre-ltirr 7986 ax-pre-lttrn 7988 ax-pre-ltadd 7990 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-reu 2479 df-rmo 2480 df-rab 2481 df-v 2762 df-sbc 2987 df-csb 3082 df-dif 3156 df-un 3158 df-in 3160 df-ss 3167 df-nul 3448 df-pw 3604 df-sn 3625 df-pr 3626 df-op 3628 df-uni 3837 df-int 3872 df-iun 3915 df-br 4031 df-opab 4092 df-mpt 4093 df-id 4325 df-xp 4666 df-rel 4667 df-cnv 4668 df-co 4669 df-dm 4670 df-rn 4671 df-res 4672 df-ima 4673 df-iota 5216 df-fun 5257 df-fn 5258 df-f 5259 df-f1 5260 df-fo 5261 df-f1o 5262 df-fv 5263 df-riota 5874 df-ov 5922 df-oprab 5923 df-mpo 5924 df-1st 6195 df-2nd 6196 df-tpos 6300 df-pnf 8058 df-mnf 8059 df-ltxr 8061 df-inn 8985 df-2 9043 df-3 9044 df-ndx 12624 df-slot 12625 df-base 12627 df-sets 12628 df-iress 12629 df-plusg 12711 df-mulr 12712 df-0g 12872 df-mgm 12942 df-sgrp 12988 df-mnd 13001 df-grp 13078 df-minusg 13079 df-cmn 13359 df-abl 13360 df-mgp 13420 df-ur 13459 df-srg 13463 df-ring 13497 df-oppr 13567 df-dvdsr 13588 df-unit 13589 df-invr 13620 df-dvr 13631 |
This theorem is referenced by: lringuplu 13695 |
Copyright terms: Public domain | W3C validator |