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

Theorem issubrg2 14386
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 14372 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
2 issubrg2.o . . . 4 1 = (1r𝑅)
32subrg1cl 14374 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 1𝐴)
4 issubrg2.t . . . . . 6 · = (.r𝑅)
54subrgmcl 14378 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝐴𝑦𝐴) → (𝑥 · 𝑦) ∈ 𝐴)
653expb 1231 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑥𝐴𝑦𝐴)) → (𝑥 · 𝑦) ∈ 𝐴)
76ralrimivva 2624 . . 3 (𝐴 ∈ (SubRing‘𝑅) → ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)
81, 3, 73jca 1204 . 2 (𝐴 ∈ (SubRing‘𝑅) → (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴))
9 simpl 109 . . . 4 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝑅 ∈ Ring)
10 simpr1 1030 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 ∈ (SubGrp‘𝑅))
11 eqid 2232 . . . . . . 7 (𝑅s 𝐴) = (𝑅s 𝐴)
1211subgbas 13895 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 = (Base‘(𝑅s 𝐴)))
1310, 12syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 = (Base‘(𝑅s 𝐴)))
14 eqidd 2233 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → (𝑅s 𝐴) = (𝑅s 𝐴))
15 eqidd 2233 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → (+g𝑅) = (+g𝑅))
16 id 19 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
17 subgrcl 13896 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → 𝑅 ∈ Grp)
1814, 15, 16, 17ressplusgd 13342 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → (+g𝑅) = (+g‘(𝑅s 𝐴)))
1910, 18syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (+g𝑅) = (+g‘(𝑅s 𝐴)))
2011, 4ressmulrg 13358 . . . . . 6 ((𝐴 ∈ (SubGrp‘𝑅) ∧ 𝑅 ∈ Grp) → · = (.r‘(𝑅s 𝐴)))
2110, 17, 20syl2anc2 412 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → · = (.r‘(𝑅s 𝐴)))
2211subggrp 13894 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → (𝑅s 𝐴) ∈ Grp)
2310, 22syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅s 𝐴) ∈ Grp)
24 simpr3 1032 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)
25 oveq1 6057 . . . . . . . . 9 (𝑥 = 𝑢 → (𝑥 · 𝑦) = (𝑢 · 𝑦))
2625eleq1d 2301 . . . . . . . 8 (𝑥 = 𝑢 → ((𝑥 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑦) ∈ 𝐴))
27 oveq2 6058 . . . . . . . . 9 (𝑦 = 𝑣 → (𝑢 · 𝑦) = (𝑢 · 𝑣))
2827eleq1d 2301 . . . . . . . 8 (𝑦 = 𝑣 → ((𝑢 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑣) ∈ 𝐴))
2926, 28rspc2v 2934 . . . . . . 7 ((𝑢𝐴𝑣𝐴) → (∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴 → (𝑢 · 𝑣) ∈ 𝐴))
3024, 29syl5com 29 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢𝐴𝑣𝐴) → (𝑢 · 𝑣) ∈ 𝐴))
31303impib 1228 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴𝑣𝐴) → (𝑢 · 𝑣) ∈ 𝐴)
32 issubrg2.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
3332subgss 13891 . . . . . . . . . 10 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴𝐵)
3410, 33syl 14 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴𝐵)
3534sseld 3237 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑢𝐴𝑢𝐵))
3634sseld 3237 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑣𝐴𝑣𝐵))
3734sseld 3237 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑤𝐴𝑤𝐵))
3835, 36, 373anim123d 1356 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢𝐴𝑣𝐴𝑤𝐴) → (𝑢𝐵𝑣𝐵𝑤𝐵)))
3938imp 124 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → (𝑢𝐵𝑣𝐵𝑤𝐵))
4032, 4ringass 14160 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
4140adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
4239, 41syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
43 eqid 2232 . . . . . . . 8 (+g𝑅) = (+g𝑅)
4432, 43, 4ringdi 14162 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4544adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4639, 45syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4732, 43, 4ringdir 14163 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢(+g𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+g𝑅)(𝑣 · 𝑤)))
4847adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢(+g𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+g𝑅)(𝑣 · 𝑤)))
4939, 48syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → ((𝑢(+g𝑅)𝑣) · 𝑤) = ((𝑢 · 𝑤)(+g𝑅)(𝑣 · 𝑤)))
50 simpr2 1031 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 1𝐴)
5135imp 124 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴) → 𝑢𝐵)
5232, 4, 2ringlidm 14167 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑢𝐵) → ( 1 · 𝑢) = 𝑢)
5352adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐵) → ( 1 · 𝑢) = 𝑢)
5451, 53syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴) → ( 1 · 𝑢) = 𝑢)
5532, 4, 2ringridm 14168 . . . . . . 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 14185 . . . 4 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅s 𝐴) ∈ Ring)
5934, 50jca 306 . . . 4 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝐴𝐵1𝐴))
6032, 2issubrg 14366 . . . 4 (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)))
619, 58, 59, 60syl21anbrc 1209 . . 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 1005   = wceq 1398  wcel 2203  wral 2520  wss 3211  cfv 5352  (class class class)co 6050  Basecbs 13212  s cress 13213  +gcplusg 13290  .rcmulr 13291  Grpcgrp 13713  SubGrpcsubg 13884  1rcur 14103  Ringcrg 14140  SubRingcsubrg 14362
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-sep 4228  ax-pow 4287  ax-pr 4322  ax-un 4554  ax-setind 4659  ax-cnex 8218  ax-resscn 8219  ax-1cn 8220  ax-1re 8221  ax-icn 8222  ax-addcl 8223  ax-addrcl 8224  ax-mulcl 8225  ax-addcom 8227  ax-addass 8229  ax-i2m1 8232  ax-0lt1 8233  ax-0id 8235  ax-rnegex 8236  ax-pre-ltirr 8239  ax-pre-lttrn 8241  ax-pre-ltadd 8243
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rmo 2528  df-rab 2529  df-v 2815  df-sbc 3043  df-csb 3139  df-dif 3213  df-un 3215  df-in 3217  df-ss 3224  df-nul 3509  df-pw 3671  df-sn 3695  df-pr 3696  df-op 3698  df-uni 3915  df-int 3950  df-br 4110  df-opab 4172  df-mpt 4173  df-id 4414  df-xp 4755  df-rel 4756  df-cnv 4757  df-co 4758  df-dm 4759  df-rn 4760  df-res 4761  df-ima 4762  df-iota 5312  df-fun 5354  df-fn 5355  df-fv 5360  df-riota 6003  df-ov 6053  df-oprab 6054  df-mpo 6055  df-pnf 8310  df-mnf 8311  df-ltxr 8313  df-inn 9238  df-2 9296  df-3 9297  df-ndx 13215  df-slot 13216  df-base 13218  df-sets 13219  df-iress 13220  df-plusg 13303  df-mulr 13304  df-0g 13471  df-mgm 13569  df-sgrp 13615  df-mnd 13630  df-subg 13887  df-mgp 14065  df-ur 14104  df-ring 14142  df-subrg 14364
This theorem is referenced by:  subrgintm  14388  issubrg3  14392  issubrgd  14600  cnsubrglem  14728
  Copyright terms: Public domain W3C validator