| 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 1027 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑋 ∈ 𝐵) | |
| 3 | simpr2 1028 | . . 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 14050 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing) | |
| 9 | 8 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑅 ∈ SRing) |
| 10 | simpr3 1029 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑍 ∈ 𝑈) | |
| 11 | eqid 2229 | . . . . . 6 ⊢ (invr‘𝑅) = (invr‘𝑅) | |
| 12 | 6, 11 | unitinvcl 14127 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑍 ∈ 𝑈) → ((invr‘𝑅)‘𝑍) ∈ 𝑈) |
| 13 | 10, 12 | syldan 282 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((invr‘𝑅)‘𝑍) ∈ 𝑈) |
| 14 | 5, 7, 9, 13 | unitcld 14112 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((invr‘𝑅)‘𝑍) ∈ 𝐵) |
| 15 | dvrdir.p | . . . 4 ⊢ + = (+g‘𝑅) | |
| 16 | eqid 2229 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 17 | 4, 15, 16 | ringdir 14022 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ ((invr‘𝑅)‘𝑍) ∈ 𝐵)) → ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
| 18 | 1, 2, 3, 14, 17 | syl13anc 1273 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
| 19 | eqidd 2230 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (.r‘𝑅) = (.r‘𝑅)) | |
| 20 | eqidd 2230 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (invr‘𝑅) = (invr‘𝑅)) | |
| 21 | dvrdir.t | . . . 4 ⊢ / = (/r‘𝑅) | |
| 22 | 21 | a1i 9 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → / = (/r‘𝑅)) |
| 23 | ringgrp 14004 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 24 | 23 | adantr 276 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → 𝑅 ∈ Grp) |
| 25 | 4, 15, 24, 2, 3 | grpcld 13587 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑋 + 𝑌) ∈ 𝐵) |
| 26 | 5, 19, 7, 20, 22, 1, 25, 10 | dvrvald 14138 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌) / 𝑍) = ((𝑋 + 𝑌)(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
| 27 | 5, 19, 7, 20, 22, 1, 2, 10 | dvrvald 14138 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑋 / 𝑍) = (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
| 28 | 5, 19, 7, 20, 22, 1, 3, 10 | dvrvald 14138 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → (𝑌 / 𝑍) = (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍))) |
| 29 | 27, 28 | oveq12d 6031 | . 2 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 / 𝑍) + (𝑌 / 𝑍)) = ((𝑋(.r‘𝑅)((invr‘𝑅)‘𝑍)) + (𝑌(.r‘𝑅)((invr‘𝑅)‘𝑍)))) |
| 30 | 18, 26, 29 | 3eqtr4d 2272 | 1 ⊢ ((𝑅 ∈ Ring ∧ (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵 ∧ 𝑍 ∈ 𝑈)) → ((𝑋 + 𝑌) / 𝑍) = ((𝑋 / 𝑍) + (𝑌 / 𝑍))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ‘cfv 5324 (class class class)co 6013 Basecbs 13072 +gcplusg 13150 .rcmulr 13151 Grpcgrp 13573 SRingcsrg 13966 Ringcrg 13999 Unitcui 14090 invrcinvr 14124 /rcdvr 14135 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-pre-ltirr 8134 ax-pre-lttrn 8136 ax-pre-ltadd 8138 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-reu 2515 df-rmo 2516 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-tpos 6406 df-pnf 8206 df-mnf 8207 df-ltxr 8209 df-inn 9134 df-2 9192 df-3 9193 df-ndx 13075 df-slot 13076 df-base 13078 df-sets 13079 df-iress 13080 df-plusg 13163 df-mulr 13164 df-0g 13331 df-mgm 13429 df-sgrp 13475 df-mnd 13490 df-grp 13576 df-minusg 13577 df-cmn 13863 df-abl 13864 df-mgp 13924 df-ur 13963 df-srg 13967 df-ring 14001 df-oppr 14071 df-dvdsr 14092 df-unit 14093 df-invr 14125 df-dvr 14136 |
| This theorem is referenced by: lringuplu 14200 |
| Copyright terms: Public domain | W3C validator |