| 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 1006 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑋 ∈ 𝐵) | |
| 3 | simpr2 1007 | . . 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 13884 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing) | |
| 9 | 8 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑅 ∈ SRing) |
| 10 | simpr3 1008 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑍 ∈ 𝑈) | |
| 11 | eqid 2206 | . . . . . 6 ⊢ (invr‘𝑅) = (invr‘𝑅) | |
| 12 | 6, 11 | unitinvcl 13960 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑍 ∈ 𝑈) → ((invr‘𝑅)‘𝑍) ∈ 𝑈) |
| 13 | 10, 12 | syldan 282 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((invr‘𝑅)‘𝑍) ∈ 𝑈) |
| 14 | 5, 7, 9, 13 | unitcld 13945 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((invr‘𝑅)‘𝑍) ∈ 𝐵) |
| 15 | dvrdir.p | . . . 4 ⊢ + = (+g‘𝑅) | |
| 16 | eqid 2206 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 17 | 4, 15, 16 | ringdir 13856 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ ((invr‘𝑅)‘𝑍) ∈ 𝐵)) → ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
| 18 | 1, 2, 3, 14, 17 | syl13anc 1252 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
| 19 | eqidd 2207 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (.r‘𝑅) = (.r‘𝑅)) | |
| 20 | eqidd 2207 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (invr‘𝑅) = (invr‘𝑅)) | |
| 21 | dvrdir.t | . . . 4 ⊢ / = (/r‘𝑅) | |
| 22 | 21 | a1i 9 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → / = (/r‘𝑅)) |
| 23 | ringgrp 13838 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 24 | 23 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑅 ∈ Grp) |
| 25 | 4, 15, 24, 2, 3 | grpcld 13421 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑋 + 𝑌) ∈ 𝐵) |
| 26 | 5, 19, 7, 20, 22, 1, 25, 10 | dvrvald 13971 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌) / 𝑍) = ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
| 27 | 5, 19, 7, 20, 22, 1, 2, 10 | dvrvald 13971 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑋 / 𝑍) = (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
| 28 | 5, 19, 7, 20, 22, 1, 3, 10 | dvrvald 13971 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑌 / 𝑍) = (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
| 29 | 27, 28 | oveq12d 5975 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 / 𝑍) + (𝑌 / 𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
| 30 | 18, 26, 29 | 3eqtr4d 2249 | 1 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌) / 𝑍) = ((𝑋 / 𝑍) + (𝑌 / 𝑍))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 981 = wceq 1373 ∈ wcel 2177 ‘cfv 5280 (class class class)co 5957 Basecbs 12907 +gcplusg 12984 .rcmulr 12985 Grpcgrp 13407 SRingcsrg 13800 Ringcrg 13833 Unitcui 13924 invrcinvr 13957 /rcdvr 13968 |
| 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 711 ax-5 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4167 ax-sep 4170 ax-nul 4178 ax-pow 4226 ax-pr 4261 ax-un 4488 ax-setind 4593 ax-cnex 8036 ax-resscn 8037 ax-1cn 8038 ax-1re 8039 ax-icn 8040 ax-addcl 8041 ax-addrcl 8042 ax-mulcl 8043 ax-addcom 8045 ax-addass 8047 ax-i2m1 8050 ax-0lt1 8051 ax-0id 8053 ax-rnegex 8054 ax-pre-ltirr 8057 ax-pre-lttrn 8059 ax-pre-ltadd 8061 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3003 df-csb 3098 df-dif 3172 df-un 3174 df-in 3176 df-ss 3183 df-nul 3465 df-pw 3623 df-sn 3644 df-pr 3645 df-op 3647 df-uni 3857 df-int 3892 df-iun 3935 df-br 4052 df-opab 4114 df-mpt 4115 df-id 4348 df-xp 4689 df-rel 4690 df-cnv 4691 df-co 4692 df-dm 4693 df-rn 4694 df-res 4695 df-ima 4696 df-iota 5241 df-fun 5282 df-fn 5283 df-f 5284 df-f1 5285 df-fo 5286 df-f1o 5287 df-fv 5288 df-riota 5912 df-ov 5960 df-oprab 5961 df-mpo 5962 df-1st 6239 df-2nd 6240 df-tpos 6344 df-pnf 8129 df-mnf 8130 df-ltxr 8132 df-inn 9057 df-2 9115 df-3 9116 df-ndx 12910 df-slot 12911 df-base 12913 df-sets 12914 df-iress 12915 df-plusg 12997 df-mulr 12998 df-0g 13165 df-mgm 13263 df-sgrp 13309 df-mnd 13324 df-grp 13410 df-minusg 13411 df-cmn 13697 df-abl 13698 df-mgp 13758 df-ur 13797 df-srg 13801 df-ring 13835 df-oppr 13905 df-dvdsr 13926 df-unit 13927 df-invr 13958 df-dvr 13969 |
| This theorem is referenced by: lringuplu 14033 |
| Copyright terms: Public domain | W3C validator |