| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > dvrcl | GIF version | ||
| Description: Closure of division operation. (Contributed by Mario Carneiro, 2-Jul-2014.) |
| Ref | Expression |
|---|---|
| dvrcl.b | ⊢ 𝐵 = (Base‘𝑅) |
| dvrcl.o | ⊢ 𝑈 = (Unit‘𝑅) |
| dvrcl.d | ⊢ / = (/r‘𝑅) |
| Ref | Expression |
|---|---|
| dvrcl | ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑋 / 𝑌) ∈ 𝐵) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dvrcl.b | . . . 4 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | 1 | a1i 9 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → 𝐵 = (Base‘𝑅)) |
| 3 | eqidd 2232 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (.r‘𝑅) = (.r‘𝑅)) | |
| 4 | dvrcl.o | . . . 4 ⊢ 𝑈 = (Unit‘𝑅) | |
| 5 | 4 | a1i 9 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → 𝑈 = (Unit‘𝑅)) |
| 6 | eqidd 2232 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (invr‘𝑅) = (invr‘𝑅)) | |
| 7 | dvrcl.d | . . . 4 ⊢ / = (/r‘𝑅) | |
| 8 | 7 | a1i 9 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → / = (/r‘𝑅)) |
| 9 | simp1 1024 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → 𝑅 ∈ Ring) | |
| 10 | simp2 1025 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → 𝑋 ∈ 𝐵) | |
| 11 | simp3 1026 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → 𝑌 ∈ 𝑈) | |
| 12 | 2, 3, 5, 6, 8, 9, 10, 11 | dvrvald 14210 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑋 / 𝑌) = (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌))) |
| 13 | eqid 2231 | . . . . 5 ⊢ (invr‘𝑅) = (invr‘𝑅) | |
| 14 | 4, 13, 1 | ringinvcl 14201 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑈) → ((invr‘𝑅)‘𝑌) ∈ 𝐵) |
| 15 | 14 | 3adant2 1043 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → ((invr‘𝑅)‘𝑌) ∈ 𝐵) |
| 16 | eqid 2231 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 17 | 1, 16 | ringcl 14088 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ ((invr‘𝑅)‘𝑌) ∈ 𝐵) → (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌)) ∈ 𝐵) |
| 18 | 15, 17 | syld3an3 1319 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌)) ∈ 𝐵) |
| 19 | 12, 18 | eqeltrd 2308 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑋 / 𝑌) ∈ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1005 = wceq 1398 ∈ wcel 2202 ‘cfv 5333 (class class class)co 6028 Basecbs 13143 .rcmulr 13222 Ringcrg 14071 Unitcui 14162 invrcinvr 14196 /rcdvr 14207 |
| 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 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-nul 4220 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-pre-ltirr 8187 ax-pre-lttrn 8189 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-1st 6312 df-2nd 6313 df-tpos 6454 df-pnf 8259 df-mnf 8260 df-ltxr 8262 df-inn 9187 df-2 9245 df-3 9246 df-ndx 13146 df-slot 13147 df-base 13149 df-sets 13150 df-iress 13151 df-plusg 13234 df-mulr 13235 df-0g 13402 df-mgm 13500 df-sgrp 13546 df-mnd 13561 df-grp 13647 df-minusg 13648 df-cmn 13934 df-abl 13935 df-mgp 13996 df-ur 14035 df-srg 14039 df-ring 14073 df-oppr 14143 df-dvdsr 14164 df-unit 14165 df-invr 14197 df-dvr 14208 |
| This theorem is referenced by: rdivmuldivd 14220 lringuplu 14272 |
| Copyright terms: Public domain | W3C validator |