| 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 20266 | . . 3 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Rng) | |
| 2 | isringrng.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 3 | isringrng.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 4 | 2, 3 | ringideu 20235 | . . . 4 ⊢ (𝑅 ∈ Ring → ∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) |
| 5 | reurex 3346 | . . . 4 ⊢ (∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) | |
| 6 | 4, 5 | syl 17 | . . 3 ⊢ (𝑅 ∈ Ring → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) |
| 7 | 1, 6 | jca 511 | . 2 ⊢ (𝑅 ∈ Ring → (𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| 8 | rngabl 20136 | . . . . 5 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 9 | ablgrp 19760 | . . . . 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 20137 | . . . . 5 ⊢ (𝑅 ∈ Rng → (mulGrp‘𝑅) ∈ Smgrp) |
| 14 | 13 | anim1i 616 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → ((mulGrp‘𝑅) ∈ Smgrp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| 15 | 12, 2 | mgpbas 20126 | . . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅)) |
| 16 | 12, 3 | mgpplusg 20125 | . . . . 5 ⊢ · = (+g‘(mulGrp‘𝑅)) |
| 17 | 15, 16 | ismnddef 18704 | . . . 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 20135 | . . . . 5 ⊢ (𝑅 ∈ Rng ↔ (𝑅 ∈ Abel ∧ (mulGrp‘𝑅) ∈ Smgrp ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))))) |
| 21 | 20 | simp3bi 1148 | . . . 4 ⊢ (𝑅 ∈ Rng → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧)))) |
| 22 | 21 | adantr 480 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧)))) |
| 23 | 2, 12, 19, 3 | isring 20218 | . . 3 ⊢ (𝑅 ∈ Ring ↔ (𝑅 ∈ Grp ∧ (mulGrp‘𝑅) ∈ Mnd ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∀𝑧 ∈ 𝐵 ((𝑥 · (𝑦(+g‘𝑅)𝑧)) = ((𝑥 · 𝑦)(+g‘𝑅)(𝑥 · 𝑧)) ∧ ((𝑥(+g‘𝑅)𝑦) · 𝑧) = ((𝑥 · 𝑧)(+g‘𝑅)(𝑦 · 𝑧))))) |
| 24 | 11, 18, 22, 23 | syl3anbrc 1345 | . 2 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → 𝑅 ∈ Ring) |
| 25 | 7, 24 | impbii 209 | 1 ⊢ (𝑅 ∈ Ring ↔ (𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3051 ∃wrex 3061 ∃!wreu 3340 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 +gcplusg 17220 .rcmulr 17221 Smgrpcsgrp 18686 Mndcmnd 18702 Grpcgrp 18909 Abelcabl 19756 mulGrpcmgp 20121 Rngcrng 20133 Ringcrg 20214 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 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 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-cmn 19757 df-abl 19758 df-mgp 20122 df-rng 20134 df-ur 20163 df-ring 20216 |
| This theorem is referenced by: opprring 20327 rngisomring 20447 pzriprnglem7 21467 pzriprnglem13 21473 zlidlring 48710 uzlidlring 48711 |
| Copyright terms: Public domain | W3C validator |