| 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 2235 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (.r‘𝑅) = (.r‘𝑅)) | |
| 4 | dvrcl.o | . . . 4 ⊢ 𝑈 = (Unit‘𝑅) | |
| 5 | 4 | a1i 9 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → 𝑈 = (Unit‘𝑅)) |
| 6 | eqidd 2235 | . . 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 14364 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑋 / 𝑌) = (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌))) |
| 13 | eqid 2234 | . . . . 5 ⊢ (invr‘𝑅) = (invr‘𝑅) | |
| 14 | 4, 13, 1 | ringinvcl 14355 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑈) → ((invr‘𝑅)‘𝑌) ∈ 𝐵) |
| 15 | 14 | 3adant2 1043 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → ((invr‘𝑅)‘𝑌) ∈ 𝐵) |
| 16 | eqid 2234 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 17 | 1, 16 | ringcl 14241 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ ((invr‘𝑅)‘𝑌) ∈ 𝐵) → (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌)) ∈ 𝐵) |
| 18 | 15, 17 | syld3an3 1319 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌)) ∈ 𝐵) |
| 19 | 12, 18 | eqeltrd 2311 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑋 / 𝑌) ∈ 𝐵) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1005 = wceq 1398 ∈ wcel 2205 ‘cfv 5357 (class class class)co 6058 Basecbs 13296 .rcmulr 13375 Ringcrg 14224 Unitcui 14316 invrcinvr 14350 /rcdvr 14361 |
| 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 2207 ax-14 2208 ax-ext 2216 ax-coll 4230 ax-sep 4233 ax-nul 4241 ax-pow 4292 ax-pr 4327 ax-un 4559 ax-setind 4664 ax-cnex 8234 ax-resscn 8235 ax-1cn 8236 ax-1re 8237 ax-icn 8238 ax-addcl 8239 ax-addrcl 8240 ax-mulcl 8241 ax-addcom 8243 ax-addass 8245 ax-i2m1 8248 ax-0lt1 8249 ax-0id 8251 ax-rnegex 8252 ax-pre-ltirr 8255 ax-pre-lttrn 8257 ax-pre-ltadd 8259 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2085 df-mo 2086 df-clab 2221 df-cleq 2227 df-clel 2230 df-nfc 2375 df-ne 2415 df-nel 2510 df-ral 2527 df-rex 2528 df-reu 2529 df-rmo 2530 df-rab 2531 df-v 2817 df-sbc 3046 df-csb 3142 df-dif 3216 df-un 3218 df-in 3220 df-ss 3227 df-nul 3513 df-pw 3676 df-sn 3700 df-pr 3701 df-op 3703 df-uni 3920 df-int 3955 df-iun 3998 df-br 4115 df-opab 4177 df-mpt 4178 df-id 4419 df-xp 4760 df-rel 4761 df-cnv 4762 df-co 4763 df-dm 4764 df-rn 4765 df-res 4766 df-ima 4767 df-iota 5317 df-fun 5359 df-fn 5360 df-f 5361 df-f1 5362 df-fo 5363 df-f1o 5364 df-fv 5365 df-riota 6011 df-ov 6061 df-oprab 6062 df-mpo 6063 df-1st 6347 df-2nd 6348 df-tpos 6489 df-pnf 8326 df-mnf 8327 df-ltxr 8329 df-inn 9255 df-2 9313 df-3 9314 df-ndx 13299 df-slot 13300 df-base 13302 df-sets 13303 df-iress 13304 df-plusg 13387 df-mulr 13388 df-0g 13555 df-mgm 13653 df-sgrp 13699 df-mnd 13714 df-grp 13800 df-minusg 13801 df-cmn 14087 df-abl 14088 df-mgp 14149 df-ur 14188 df-srg 14192 df-ring 14226 df-oppr 14296 df-dvdsr 14318 df-unit 14319 df-invr 14351 df-dvr 14362 |
| This theorem is referenced by: rdivmuldivd 14374 lringuplu 14426 |
| Copyright terms: Public domain | W3C validator |