ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  issubrg2 GIF version

Theorem issubrg2 14245
Description: Characterize the subrings of a ring by closure properties. (Contributed by Mario Carneiro, 3-Dec-2014.)
Hypotheses
Ref Expression
issubrg2.b 𝐵 = (Base‘𝑅)
issubrg2.o 1 = (1r𝑅)
issubrg2.t · = (.r𝑅)
Assertion
Ref Expression
issubrg2 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝑅,𝑦   𝑥, · ,𝑦
Allowed substitution hints:   𝐵(𝑥,𝑦)   1 (𝑥,𝑦)

Proof of Theorem issubrg2
Dummy variables 𝑣 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 subrgsubg 14231 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
2 issubrg2.o . . . 4 1 = (1r𝑅)
32subrg1cl 14233 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 1𝐴)
4 issubrg2.t . . . . . 6 · = (.r𝑅)
54subrgmcl 14237 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝐴𝑦𝐴) → (𝑥 · 𝑦) ∈ 𝐴)
653expb 1228 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑥𝐴𝑦𝐴)) → (𝑥 · 𝑦) ∈ 𝐴)
76ralrimivva 2612 . . 3 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)
81, 3, 73jca 1201 . 2 (𝐴 ∈ (SubRing‘𝑅) → (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴))
9 simpl 109 . . . 4 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝑅 ∈ Ring)
10 simpr1 1027 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 ∈ (SubGrp‘𝑅))
11 eqid 2229 . . . . . . 7 (𝑅s 𝐴) = (𝑅s 𝐴)
1211subgbas 13755 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 = (Base‘(𝑅s 𝐴)))
1310, 12syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 = (Base‘(𝑅s 𝐴)))
14 eqidd 2230 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → (𝑅s 𝐴) = (𝑅s 𝐴))
15 eqidd 2230 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → (+g𝑅) = (+g𝑅))
16 id 19 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
17 subgrcl 13756 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → 𝑅 ∈ Grp)
1814, 15, 16, 17ressplusgd 13202 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → (+g𝑅) = (+g‘(𝑅s 𝐴)))
1910, 18syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (+g𝑅) = (+g‘(𝑅s 𝐴)))
2011, 4ressmulrg 13218 . . . . . 6 ((𝐴 ∈ (SubGrp‘𝑅) ∧ 𝑅 ∈ Grp) → · = (.r‘(𝑅s 𝐴)))
2110, 17, 20syl2anc2 412 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → · = (.r‘(𝑅s 𝐴)))
2211subggrp 13754 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → (𝑅s 𝐴) ∈ Grp)
2310, 22syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅s 𝐴) ∈ Grp)
24 simpr3 1029 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)
25 oveq1 6020 . . . . . . . . 9 (𝑥 = 𝑢 → (𝑥 · 𝑦) = (𝑢 · 𝑦))
2625eleq1d 2298 . . . . . . . 8 (𝑥 = 𝑢 → ((𝑥 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑦) ∈ 𝐴))
27 oveq2 6021 . . . . . . . . 9 (𝑦 = 𝑣 → (𝑢 · 𝑦) = (𝑢 · 𝑣))
2827eleq1d 2298 . . . . . . . 8 (𝑦 = 𝑣 → ((𝑢 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑣) ∈ 𝐴))
2926, 28rspc2v 2921 . . . . . . 7 ((𝑢𝐴𝑣𝐴) → (∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴 → (𝑢 · 𝑣) ∈ 𝐴))
3024, 29syl5com 29 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢𝐴𝑣𝐴) → (𝑢 · 𝑣) ∈ 𝐴))
31303impib 1225 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴𝑣𝐴) → (𝑢 · 𝑣) ∈ 𝐴)
32 issubrg2.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
3332subgss 13751 . . . . . . . . . 10 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴𝐵)
3410, 33syl 14 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴𝐵)
3534sseld 3224 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑢𝐴𝑢𝐵))
3634sseld 3224 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑣𝐴𝑣𝐵))
3734sseld 3224 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑤𝐴𝑤𝐵))
3835, 36, 373anim123d 1353 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢𝐴𝑣𝐴𝑤𝐴) → (𝑢𝐵𝑣𝐵𝑤𝐵)))
3938imp 124 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → (𝑢𝐵𝑣𝐵𝑤𝐵))
4032, 4ringass 14019 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
4140adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
4239, 41syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
43 eqid 2229 . . . . . . . 8 (+g𝑅) = (+g𝑅)
4432, 43, 4ringdi 14021 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4544adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4639, 45syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4732, 43, 4ringdir 14022 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢(+g𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+g𝑅)(𝑣 · 𝑤)))
4847adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢(+g𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+g𝑅)(𝑣 · 𝑤)))
4939, 48syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → ((𝑢(+g𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+g𝑅)(𝑣 · 𝑤)))
50 simpr2 1028 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 1𝐴)
5135imp 124 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴) → 𝑢𝐵)
5232, 4, 2ringlidm 14026 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑢𝐵) → ( 1 · 𝑢) = 𝑢)
5352adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐵) → ( 1 · 𝑢) = 𝑢)
5451, 53syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴) → ( 1 · 𝑢) = 𝑢)
5532, 4, 2ringridm 14027 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑢𝐵) → (𝑢 · 1 ) = 𝑢)
5655adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐵) → (𝑢 · 1 ) = 𝑢)
5751, 56syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴) → (𝑢 · 1 ) = 𝑢)
5813, 19, 21, 23, 31, 42, 46, 49, 50, 54, 57isringd 14044 . . . 4 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅s 𝐴) ∈ Ring)
5934, 50jca 306 . . . 4 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝐴𝐵1𝐴))
6032, 2issubrg 14225 . . . 4 (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)))
619, 58, 59, 60syl21anbrc 1206 . . 3 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 ∈ (SubRing‘𝑅))
6261ex 115 . 2 (𝑅 ∈ Ring → ((𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴) → 𝐴 ∈ (SubRing‘𝑅)))
638, 62impbid2 143 1 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 1002   = wceq 1395  wcel 2200  wral 2508  wss 3198  cfv 5324  (class class class)co 6013  Basecbs 13072  s cress 13073  +gcplusg 13150  .rcmulr 13151  Grpcgrp 13573  SubGrpcsubg 13744  1rcur 13962  Ringcrg 13999  SubRingcsubrg 14221
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-sep 4205  ax-pow 4262  ax-pr 4297  ax-un 4528  ax-setind 4633  ax-cnex 8113  ax-resscn 8114  ax-1cn 8115  ax-1re 8116  ax-icn 8117  ax-addcl 8118  ax-addrcl 8119  ax-mulcl 8120  ax-addcom 8122  ax-addass 8124  ax-i2m1 8127  ax-0lt1 8128  ax-0id 8130  ax-rnegex 8131  ax-pre-ltirr 8134  ax-pre-lttrn 8136  ax-pre-ltadd 8138
This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2802  df-sbc 3030  df-csb 3126  df-dif 3200  df-un 3202  df-in 3204  df-ss 3211  df-nul 3493  df-pw 3652  df-sn 3673  df-pr 3674  df-op 3676  df-uni 3892  df-int 3927  df-br 4087  df-opab 4149  df-mpt 4150  df-id 4388  df-xp 4729  df-rel 4730  df-cnv 4731  df-co 4732  df-dm 4733  df-rn 4734  df-res 4735  df-ima 4736  df-iota 5284  df-fun 5326  df-fn 5327  df-fv 5332  df-riota 5966  df-ov 6016  df-oprab 6017  df-mpo 6018  df-pnf 8206  df-mnf 8207  df-ltxr 8209  df-inn 9134  df-2 9192  df-3 9193  df-ndx 13075  df-slot 13076  df-base 13078  df-sets 13079  df-iress 13080  df-plusg 13163  df-mulr 13164  df-0g 13331  df-mgm 13429  df-sgrp 13475  df-mnd 13490  df-subg 13747  df-mgp 13924  df-ur 13963  df-ring 14001  df-subrg 14223
This theorem is referenced by:  subrgintm  14247  issubrg3  14251  issubrgd  14456  cnsubrglem  14584
  Copyright terms: Public domain W3C validator