Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > subrgdv | Structured version Visualization version GIF version |
Description: A subring always has the same division function, for elements that are invertible. (Contributed by Mario Carneiro, 4-Dec-2014.) |
Ref | Expression |
---|---|
subrgdv.1 | ⊢ 𝑆 = (𝑅 ↾s 𝐴) |
subrgdv.2 | ⊢ / = (/r‘𝑅) |
subrgdv.3 | ⊢ 𝑈 = (Unit‘𝑆) |
subrgdv.4 | ⊢ 𝐸 = (/r‘𝑆) |
Ref | Expression |
---|---|
subrgdv | ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → (𝑋 / 𝑌) = (𝑋𝐸𝑌)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | subrgdv.1 | . . . . . 6 ⊢ 𝑆 = (𝑅 ↾s 𝐴) | |
2 | eqid 2738 | . . . . . 6 ⊢ (invr‘𝑅) = (invr‘𝑅) | |
3 | subrgdv.3 | . . . . . 6 ⊢ 𝑈 = (Unit‘𝑆) | |
4 | eqid 2738 | . . . . . 6 ⊢ (invr‘𝑆) = (invr‘𝑆) | |
5 | 1, 2, 3, 4 | subrginv 19955 | . . . . 5 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑌 ∈ 𝑈) → ((invr‘𝑅)‘𝑌) = ((invr‘𝑆)‘𝑌)) |
6 | 5 | 3adant2 1129 | . . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → ((invr‘𝑅)‘𝑌) = ((invr‘𝑆)‘𝑌)) |
7 | 6 | oveq2d 7271 | . . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌)) = (𝑋(.r‘𝑅)((invr‘𝑆)‘𝑌))) |
8 | eqid 2738 | . . . . . 6 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
9 | 1, 8 | ressmulr 16943 | . . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆)) |
10 | 9 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → (.r‘𝑅) = (.r‘𝑆)) |
11 | 10 | oveqd 7272 | . . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → (𝑋(.r‘𝑅)((invr‘𝑆)‘𝑌)) = (𝑋(.r‘𝑆)((invr‘𝑆)‘𝑌))) |
12 | 7, 11 | eqtrd 2778 | . 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌)) = (𝑋(.r‘𝑆)((invr‘𝑆)‘𝑌))) |
13 | eqid 2738 | . . . . . 6 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
14 | 13 | subrgss 19940 | . . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅)) |
15 | 14 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → 𝐴 ⊆ (Base‘𝑅)) |
16 | simp2 1135 | . . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → 𝑋 ∈ 𝐴) | |
17 | 15, 16 | sseldd 3918 | . . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → 𝑋 ∈ (Base‘𝑅)) |
18 | eqid 2738 | . . . . . 6 ⊢ (Unit‘𝑅) = (Unit‘𝑅) | |
19 | 1, 18, 3 | subrguss 19954 | . . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑈 ⊆ (Unit‘𝑅)) |
20 | 19 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → 𝑈 ⊆ (Unit‘𝑅)) |
21 | simp3 1136 | . . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → 𝑌 ∈ 𝑈) | |
22 | 20, 21 | sseldd 3918 | . . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → 𝑌 ∈ (Unit‘𝑅)) |
23 | subrgdv.2 | . . . 4 ⊢ / = (/r‘𝑅) | |
24 | 13, 8, 18, 2, 23 | dvrval 19842 | . . 3 ⊢ ((𝑋 ∈ (Base‘𝑅) ∧ 𝑌 ∈ (Unit‘𝑅)) → (𝑋 / 𝑌) = (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌))) |
25 | 17, 22, 24 | syl2anc 583 | . 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → (𝑋 / 𝑌) = (𝑋(.r‘𝑅)((invr‘𝑅)‘𝑌))) |
26 | 1 | subrgbas 19948 | . . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆)) |
27 | 26 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → 𝐴 = (Base‘𝑆)) |
28 | 16, 27 | eleqtrd 2841 | . . 3 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → 𝑋 ∈ (Base‘𝑆)) |
29 | eqid 2738 | . . . 4 ⊢ (Base‘𝑆) = (Base‘𝑆) | |
30 | eqid 2738 | . . . 4 ⊢ (.r‘𝑆) = (.r‘𝑆) | |
31 | subrgdv.4 | . . . 4 ⊢ 𝐸 = (/r‘𝑆) | |
32 | 29, 30, 3, 4, 31 | dvrval 19842 | . . 3 ⊢ ((𝑋 ∈ (Base‘𝑆) ∧ 𝑌 ∈ 𝑈) → (𝑋𝐸𝑌) = (𝑋(.r‘𝑆)((invr‘𝑆)‘𝑌))) |
33 | 28, 21, 32 | syl2anc 583 | . 2 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → (𝑋𝐸𝑌) = (𝑋(.r‘𝑆)((invr‘𝑆)‘𝑌))) |
34 | 12, 25, 33 | 3eqtr4d 2788 | 1 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝑈) → (𝑋 / 𝑌) = (𝑋𝐸𝑌)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ⊆ wss 3883 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 ↾s cress 16867 .rcmulr 16889 Unitcui 19796 invrcinvr 19828 /rcdvr 19839 SubRingcsubrg 19935 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-iun 4923 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-tpos 8013 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-er 8456 df-en 8692 df-dom 8693 df-sdom 8694 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-nn 11904 df-2 11966 df-3 11967 df-sets 16793 df-slot 16811 df-ndx 16823 df-base 16841 df-ress 16868 df-plusg 16901 df-mulr 16902 df-0g 17069 df-mgm 18241 df-sgrp 18290 df-mnd 18301 df-grp 18495 df-minusg 18496 df-subg 18667 df-mgp 19636 df-ur 19653 df-ring 19700 df-oppr 19777 df-dvdsr 19798 df-unit 19799 df-invr 19829 df-dvr 19840 df-subrg 19937 |
This theorem is referenced by: qsssubdrg 20569 redvr 20734 cvsdiv 24201 qrngdiv 26677 |
Copyright terms: Public domain | W3C validator |