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

Theorem issubrg2 14487
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 14473 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
2 issubrg2.o . . . 4 1 = (1r𝑅)
32subrg1cl 14475 . . 3 (𝐴 ∈ (SubRing‘𝑅) → 1𝐴)
4 issubrg2.t . . . . . 6 · = (.r𝑅)
54subrgmcl 14479 . . . . 5 ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑥𝐴𝑦𝐴) → (𝑥 · 𝑦) ∈ 𝐴)
653expb 1231 . . . 4 ((𝐴 ∈ (SubRing‘𝑅) ∧ (𝑥𝐴𝑦𝐴)) → (𝑥 · 𝑦) ∈ 𝐴)
76ralrimivva 2626 . . 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 2234 . . . . . . 7 (𝑅s 𝐴) = (𝑅s 𝐴)
1211subgbas 13931 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 = (Base‘(𝑅s 𝐴)))
1310, 12syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴 = (Base‘(𝑅s 𝐴)))
14 eqidd 2235 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → (𝑅s 𝐴) = (𝑅s 𝐴))
15 eqidd 2235 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → (+g𝑅) = (+g𝑅))
16 id 19 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅))
17 subgrcl 13932 . . . . . . 7 (𝐴 ∈ (SubGrp‘𝑅) → 𝑅 ∈ Grp)
1814, 15, 16, 17ressplusgd 13426 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → (+g𝑅) = (+g‘(𝑅s 𝐴)))
1910, 18syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (+g𝑅) = (+g‘(𝑅s 𝐴)))
2011, 4ressmulrg 13442 . . . . . 6 ((𝐴 ∈ (SubGrp‘𝑅) ∧ 𝑅 ∈ Grp) → · = (.r‘(𝑅s 𝐴)))
2110, 17, 20syl2anc2 412 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → · = (.r‘(𝑅s 𝐴)))
2211subggrp 13930 . . . . . 6 (𝐴 ∈ (SubGrp‘𝑅) → (𝑅s 𝐴) ∈ Grp)
2310, 22syl 14 . . . . 5 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅s 𝐴) ∈ Grp)
24 simpr3 1032 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)
25 oveq1 6065 . . . . . . . . 9 (𝑥 = 𝑢 → (𝑥 · 𝑦) = (𝑢 · 𝑦))
2625eleq1d 2303 . . . . . . . 8 (𝑥 = 𝑢 → ((𝑥 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑦) ∈ 𝐴))
27 oveq2 6066 . . . . . . . . 9 (𝑦 = 𝑣 → (𝑢 · 𝑦) = (𝑢 · 𝑣))
2827eleq1d 2303 . . . . . . . 8 (𝑦 = 𝑣 → ((𝑢 · 𝑦) ∈ 𝐴 ↔ (𝑢 · 𝑣) ∈ 𝐴))
2926, 28rspc2v 2937 . . . . . . 7 ((𝑢𝐴𝑣𝐴) → (∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴 → (𝑢 · 𝑣) ∈ 𝐴))
3024, 29syl5com 29 . . . . . 6 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢𝐴𝑣𝐴) → (𝑢 · 𝑣) ∈ 𝐴))
31303impib 1228 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴𝑣𝐴) → (𝑢 · 𝑣) ∈ 𝐴)
32 issubrg2.b . . . . . . . . . . 11 𝐵 = (Base‘𝑅)
3332subgss 13927 . . . . . . . . . 10 (𝐴 ∈ (SubGrp‘𝑅) → 𝐴𝐵)
3410, 33syl 14 . . . . . . . . 9 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → 𝐴𝐵)
3534sseld 3241 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑢𝐴𝑢𝐵))
3634sseld 3241 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑣𝐴𝑣𝐵))
3734sseld 3241 . . . . . . . 8 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑤𝐴𝑤𝐵))
3835, 36, 373anim123d 1356 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → ((𝑢𝐴𝑣𝐴𝑤𝐴) → (𝑢𝐵𝑣𝐵𝑤𝐵)))
3938imp 124 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → (𝑢𝐵𝑣𝐵𝑤𝐵))
4032, 4ringass 14259 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
4140adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
4239, 41syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → ((𝑢 · 𝑣) · 𝑤) = (𝑢 · (𝑣 · 𝑤)))
43 eqid 2234 . . . . . . . 8 (+g𝑅) = (+g𝑅)
4432, 43, 4ringdi 14261 . . . . . . 7 ((𝑅 ∈ Ring ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4544adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐵𝑣𝐵𝑤𝐵)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4639, 45syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ (𝑢𝐴𝑣𝐴𝑤𝐴)) → (𝑢 · (𝑣(+g𝑅)𝑤)) = ((𝑢 · 𝑣)(+g𝑅)(𝑢 · 𝑤)))
4732, 43, 4ringdir 14262 . . . . . . 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 14266 . . . . . . 7 ((𝑅 ∈ Ring ∧ 𝑢𝐵) → ( 1 · 𝑢) = 𝑢)
5352adantlr 477 . . . . . 6 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐵) → ( 1 · 𝑢) = 𝑢)
5451, 53syldan 282 . . . . 5 (((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) ∧ 𝑢𝐴) → ( 1 · 𝑢) = 𝑢)
5532, 4, 2ringridm 14267 . . . . . . 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 14284 . . . 4 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝑅s 𝐴) ∈ Ring)
5934, 50jca 306 . . . 4 ((𝑅 ∈ Ring ∧ (𝐴 ∈ (SubGrp‘𝑅) ∧ 1𝐴 ∧ ∀𝑥𝐴𝑦𝐴 (𝑥 · 𝑦) ∈ 𝐴)) → (𝐴𝐵1𝐴))
6032, 2issubrg 14467 . . . 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 2205  wral 2522  wss 3214  cfv 5357  (class class class)co 6058  Basecbs 13296  s cress 13297  +gcplusg 13374  .rcmulr 13375  Grpcgrp 13755  SubGrpcsubg 13920  1rcur 14202  Ringcrg 14239  SubRingcsubrg 14463
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 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-lttrn 8257  ax-pre-ltadd 8259
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-iress 13304  df-plusg 13387  df-mulr 13388  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-subg 13923  df-mgp 14160  df-ur 14203  df-ring 14241  df-subrg 14465
This theorem is referenced by:  subrgintm  14489  issubrg3  14493  issubrgd  14726  cnsubrglem  14854
  Copyright terms: Public domain W3C validator