![]() |
Mathbox for Alexander van der Vekens |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > invginvrid | Structured version Visualization version GIF version |
Description: Identity for a multiplication with additive and multiplicative inverses in a ring. (Contributed by AV, 18-May-2018.) |
Ref | Expression |
---|---|
invginvrid.b | ⊢ 𝐵 = (Base‘𝑅) |
invginvrid.u | ⊢ 𝑈 = (Unit‘𝑅) |
invginvrid.n | ⊢ 𝑁 = (invg‘𝑅) |
invginvrid.i | ⊢ 𝐼 = (invr‘𝑅) |
invginvrid.t | ⊢ · = (.r‘𝑅) |
Ref | Expression |
---|---|
invginvrid | ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → ((𝑁‘𝑌) · ((𝐼‘(𝑁‘𝑌)) · 𝑋)) = 𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2735 | . . . . 5 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
2 | 1 | ringmgp 20257 | . . . 4 ⊢ (𝑅 ∈ Ring → (mulGrp‘𝑅) ∈ Mnd) |
3 | 2 | 3ad2ant1 1132 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (mulGrp‘𝑅) ∈ Mnd) |
4 | ringgrp 20256 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
5 | invginvrid.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
6 | invginvrid.u | . . . . . 6 ⊢ 𝑈 = (Unit‘𝑅) | |
7 | 5, 6 | unitcl 20392 | . . . . 5 ⊢ (𝑌 ∈ 𝑈 → 𝑌 ∈ 𝐵) |
8 | invginvrid.n | . . . . . 6 ⊢ 𝑁 = (invg‘𝑅) | |
9 | 5, 8 | grpinvcl 19018 | . . . . 5 ⊢ ((𝑅 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
10 | 4, 7, 9 | syl2an 596 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑈) → (𝑁‘𝑌) ∈ 𝐵) |
11 | 10 | 3adant2 1130 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑁‘𝑌) ∈ 𝐵) |
12 | 6, 8 | unitnegcl 20414 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑈) → (𝑁‘𝑌) ∈ 𝑈) |
13 | invginvrid.i | . . . . . 6 ⊢ 𝐼 = (invr‘𝑅) | |
14 | 6, 13, 5 | ringinvcl 20409 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑌) ∈ 𝑈) → (𝐼‘(𝑁‘𝑌)) ∈ 𝐵) |
15 | 12, 14 | syldan 591 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝑈) → (𝐼‘(𝑁‘𝑌)) ∈ 𝐵) |
16 | 15 | 3adant2 1130 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝐼‘(𝑁‘𝑌)) ∈ 𝐵) |
17 | simp2 1136 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → 𝑋 ∈ 𝐵) | |
18 | 1, 5 | mgpbas 20158 | . . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅)) |
19 | invginvrid.t | . . . . . 6 ⊢ · = (.r‘𝑅) | |
20 | 1, 19 | mgpplusg 20156 | . . . . 5 ⊢ · = (+g‘(mulGrp‘𝑅)) |
21 | 18, 20 | mndass 18769 | . . . 4 ⊢ (((mulGrp‘𝑅) ∈ Mnd ∧ ((𝑁‘𝑌) ∈ 𝐵 ∧ (𝐼‘(𝑁‘𝑌)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → (((𝑁‘𝑌) · (𝐼‘(𝑁‘𝑌))) · 𝑋) = ((𝑁‘𝑌) · ((𝐼‘(𝑁‘𝑌)) · 𝑋))) |
22 | 21 | eqcomd 2741 | . . 3 ⊢ (((mulGrp‘𝑅) ∈ Mnd ∧ ((𝑁‘𝑌) ∈ 𝐵 ∧ (𝐼‘(𝑁‘𝑌)) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑁‘𝑌) · ((𝐼‘(𝑁‘𝑌)) · 𝑋)) = (((𝑁‘𝑌) · (𝐼‘(𝑁‘𝑌))) · 𝑋)) |
23 | 3, 11, 16, 17, 22 | syl13anc 1371 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → ((𝑁‘𝑌) · ((𝐼‘(𝑁‘𝑌)) · 𝑋)) = (((𝑁‘𝑌) · (𝐼‘(𝑁‘𝑌))) · 𝑋)) |
24 | simp1 1135 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → 𝑅 ∈ Ring) | |
25 | 12 | 3adant2 1130 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (𝑁‘𝑌) ∈ 𝑈) |
26 | eqid 2735 | . . . . 5 ⊢ (1r‘𝑅) = (1r‘𝑅) | |
27 | 6, 13, 19, 26 | unitrinv 20411 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝑁‘𝑌) ∈ 𝑈) → ((𝑁‘𝑌) · (𝐼‘(𝑁‘𝑌))) = (1r‘𝑅)) |
28 | 24, 25, 27 | syl2anc 584 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → ((𝑁‘𝑌) · (𝐼‘(𝑁‘𝑌))) = (1r‘𝑅)) |
29 | 28 | oveq1d 7446 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → (((𝑁‘𝑌) · (𝐼‘(𝑁‘𝑌))) · 𝑋) = ((1r‘𝑅) · 𝑋)) |
30 | 5, 19, 26 | ringlidm 20283 | . . 3 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → ((1r‘𝑅) · 𝑋) = 𝑋) |
31 | 30 | 3adant3 1131 | . 2 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → ((1r‘𝑅) · 𝑋) = 𝑋) |
32 | 23, 29, 31 | 3eqtrd 2779 | 1 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝑈) → ((𝑁‘𝑌) · ((𝐼‘(𝑁‘𝑌)) · 𝑋)) = 𝑋) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∈ wcel 2106 ‘cfv 6563 (class class class)co 7431 Basecbs 17245 .rcmulr 17299 Mndcmnd 18760 Grpcgrp 18964 invgcminusg 18965 mulGrpcmgp 20152 1rcur 20199 Ringcrg 20251 Unitcui 20372 invrcinvr 20404 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3378 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-2nd 8014 df-tpos 8250 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-3 12328 df-sets 17198 df-slot 17216 df-ndx 17228 df-base 17246 df-ress 17275 df-plusg 17311 df-mulr 17312 df-0g 17488 df-mgm 18666 df-sgrp 18745 df-mnd 18761 df-grp 18967 df-minusg 18968 df-cmn 19815 df-abl 19816 df-mgp 20153 df-rng 20171 df-ur 20200 df-ring 20253 df-oppr 20351 df-dvdsr 20374 df-unit 20375 df-invr 20405 |
This theorem is referenced by: lincresunit3lem1 48325 |
Copyright terms: Public domain | W3C validator |