| 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 20232 | . . 3 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Rng) | |
| 2 | isringrng.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 3 | isringrng.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 4 | 2, 3 | ringideu 20201 | . . . 4 ⊢ (𝑅 ∈ Ring → ∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) |
| 5 | reurex 3356 | . . . 4 ⊢ (∃!𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦) → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) | |
| 6 | 4, 5 | syl 17 | . . 3 ⊢ (𝑅 ∈ Ring → ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) |
| 7 | 1, 6 | jca 511 | . 2 ⊢ (𝑅 ∈ Ring → (𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| 8 | rngabl 20102 | . . . . 5 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 9 | ablgrp 19726 | . . . . 5 ⊢ (𝑅 ∈ Abel → 𝑅 ∈ Grp) | |
| 10 | 8, 9 | syl 17 | . . . 4 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) |
| 11 | 10 | adantr 480 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → 𝑅 ∈ Grp) |
| 12 | eqid 2737 | . . . . . 6 ⊢ (mulGrp‘𝑅) = (mulGrp‘𝑅) | |
| 13 | 12 | rngmgp 20103 | . . . . 5 ⊢ (𝑅 ∈ Rng → (mulGrp‘𝑅) ∈ Smgrp) |
| 14 | 13 | anim1i 616 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → ((mulGrp‘𝑅) ∈ Smgrp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| 15 | 12, 2 | mgpbas 20092 | . . . . 5 ⊢ 𝐵 = (Base‘(mulGrp‘𝑅)) |
| 16 | 12, 3 | mgpplusg 20091 | . . . . 5 ⊢ · = (+g‘(mulGrp‘𝑅)) |
| 17 | 15, 16 | ismnddef 18673 | . . . 4 ⊢ ((mulGrp‘𝑅) ∈ Mnd ↔ ((mulGrp‘𝑅) ∈ Smgrp ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦))) |
| 18 | 14, 17 | sylibr 234 | . . 3 ⊢ ((𝑅 ∈ Rng ∧ ∃𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 𝑦 ∧ (𝑦 · 𝑥) = 𝑦)) → (mulGrp‘𝑅) ∈ Mnd) |
| 19 | eqid 2737 | . . . . . 6 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 20 | 2, 12, 19, 3 | isrng 20101 | . . . . 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 20184 | . . 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 3052 ∃wrex 3062 ∃!wreu 3350 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 +gcplusg 17189 .rcmulr 17190 Smgrpcsgrp 18655 Mndcmnd 18671 Grpcgrp 18875 Abelcabl 19722 mulGrpcmgp 20087 Rngcrng 20099 Ringcrg 20180 |
| 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 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-plusg 17202 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-minusg 18879 df-cmn 19723 df-abl 19724 df-mgp 20088 df-rng 20100 df-ur 20129 df-ring 20182 |
| This theorem is referenced by: opprring 20295 rngisomring 20415 pzriprnglem7 21454 pzriprnglem13 21460 zlidlring 48588 uzlidlring 48589 |
| Copyright terms: Public domain | W3C validator |