| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > isringrng | Structured version Visualization version GIF version | ||
| Description: The predicate "is a unital ring" as extension of the predicate "is a non-unital ring". (Contributed by AV, 17-Feb-2020.) |
| Ref | Expression |
|---|---|
| isringrng.b | ⊢ 𝐵 = (Base‘𝑅) |
| isringrng.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| isringrng | ⊢ (𝑅 ∈ Ring ↔ (𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ringrng 20220 | . . 3 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Rng) | |
| 2 | isringrng.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 3 | isringrng.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 4 | 2, 3 | ringideu 20189 | . . . 4 ⊢ (𝑅 ∈ Ring → ∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) |
| 5 | reurex 3354 | . . . 4 ⊢ (∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) | |
| 6 | 4, 5 | syl 17 | . . 3 ⊢ (𝑅 ∈ Ring → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) |
| 7 | 1, 6 | jca 511 | . 2 ⊢ (𝑅 ∈ Ring → (𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| 8 | rngabl 20090 | . . . . 5 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 9 | ablgrp 19714 | . . . . 5 ⊢ (𝑅 ∈ Abel → 𝑅 ∈ Grp) | |
| 10 | 8, 9 | syl 17 | . . . 4 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) |
| 11 | 10 | adantr 480 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → 𝑅 ∈ Grp) |
| 12 | eqid 2736 | . . . . . 6 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 13 | 12 | rngmgp 20091 | . . . . 5 ⊢ (𝑅 ∈ Rng → (mulGrp‘𝑅) ∈ Smgrp) |
| 14 | 13 | anim1i 615 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → ((mulGrp‘𝑅) ∈ Smgrp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| 15 | 12, 2 | mgpbas 20080 | . . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅)) |
| 16 | 12, 3 | mgpplusg 20079 | . . . . 5 ⊢ · = (+g‘(mulGrp‘𝑅)) |
| 17 | 15, 16 | ismnddef 18661 | . . . 4 ⊢ ((mulGrp‘𝑅) ∈ Mnd ↔ ((mulGrp‘𝑅) ∈ Smgrp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| 18 | 14, 17 | sylibr 234 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → (mulGrp‘𝑅) ∈ Mnd) |
| 19 | eqid 2736 | . . . . . 6 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 20 | 2, 12, 19, 3 | isrng 20089 | . . . . 5 ⊢ (𝑅 ∈ Rng ↔ (𝑅 ∈ Abel ∧ (mulGrp‘𝑅) ∈ Smgrp ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))))) |
| 21 | 20 | simp3bi 1147 | . . . 4 ⊢ (𝑅 ∈ Rng → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧)))) |
| 22 | 21 | adantr 480 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧)))) |
| 23 | 2, 12, 19, 3 | isring 20172 | . . 3 ⊢ (𝑅 ∈ Ring ↔ (𝑅 ∈ Grp ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))))) |
| 24 | 11, 18, 22, 23 | syl3anbrc 1344 | . 2 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → 𝑅 ∈ Ring) |
| 25 | 7, 24 | impbii 209 | 1 ⊢ (𝑅 ∈ Ring ↔ (𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ∀wral 3051 ∃wrex 3060 ∃!wreu 3348 ‘cfv 6492 (class class class)co 7358 Basecbs 17136 +gcplusg 17177 .rcmulr 17178 Smgrpcsgrp 18643 Mndcmnd 18659 Grpcgrp 18863 Abelcabl 19710 mulGrpcmgp 20075 Rngcrng 20087 Ringcrg 20168 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-iun 4948 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-om 7809 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-er 8635 df-en 8884 df-dom 8885 df-sdom 8886 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-nn 12146 df-2 12208 df-sets 17091 df-slot 17109 df-ndx 17121 df-base 17137 df-plusg 17190 df-0g 17361 df-mgm 18565 df-sgrp 18644 df-mnd 18660 df-grp 18866 df-minusg 18867 df-cmn 19711 df-abl 19712 df-mgp 20076 df-rng 20088 df-ur 20117 df-ring 20170 |
| This theorem is referenced by: opprring 20283 rngisomring 20403 pzriprnglem7 21442 pzriprnglem13 21448 zlidlring 48476 uzlidlring 48477 |
| Copyright terms: Public domain | W3C validator |