MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  issubrg Structured version   Visualization version   GIF version

Theorem issubrg 20024
Description: The subring predicate. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Proof shortened by AV, 12-Oct-2020.)
Hypotheses
Ref Expression
issubrg.b 𝐵 = (Base‘𝑅)
issubrg.i 1 = (1r𝑅)
Assertion
Ref Expression
issubrg (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)))

Proof of Theorem issubrg
Dummy variables 𝑠 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-subrg 20022 . . 3 SubRing = (𝑟 ∈ Ring ↦ {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠)})
21mptrcl 6884 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
3 simpll 764 . 2 (((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)) → 𝑅 ∈ Ring)
4 fveq2 6774 . . . . . . . 8 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5 issubrg.b . . . . . . . 8 𝐵 = (Base‘𝑅)
64, 5eqtr4di 2796 . . . . . . 7 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
76pweqd 4552 . . . . . 6 (𝑟 = 𝑅 → 𝒫 (Base‘𝑟) = 𝒫 𝐵)
8 oveq1 7282 . . . . . . . 8 (𝑟 = 𝑅 → (𝑟s 𝑠) = (𝑅s 𝑠))
98eleq1d 2823 . . . . . . 7 (𝑟 = 𝑅 → ((𝑟s 𝑠) ∈ Ring ↔ (𝑅s 𝑠) ∈ Ring))
10 fveq2 6774 . . . . . . . . 9 (𝑟 = 𝑅 → (1r𝑟) = (1r𝑅))
11 issubrg.i . . . . . . . . 9 1 = (1r𝑅)
1210, 11eqtr4di 2796 . . . . . . . 8 (𝑟 = 𝑅 → (1r𝑟) = 1 )
1312eleq1d 2823 . . . . . . 7 (𝑟 = 𝑅 → ((1r𝑟) ∈ 𝑠1𝑠))
149, 13anbi12d 631 . . . . . 6 (𝑟 = 𝑅 → (((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠) ↔ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)))
157, 14rabeqbidv 3420 . . . . 5 (𝑟 = 𝑅 → {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠)} = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)})
165fvexi 6788 . . . . . . 7 𝐵 ∈ V
1716pwex 5303 . . . . . 6 𝒫 𝐵 ∈ V
1817rabex 5256 . . . . 5 {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ∈ V
1915, 1, 18fvmpt 6875 . . . 4 (𝑅 ∈ Ring → (SubRing‘𝑅) = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)})
2019eleq2d 2824 . . 3 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ 𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)}))
21 oveq2 7283 . . . . . . . 8 (𝑠 = 𝐴 → (𝑅s 𝑠) = (𝑅s 𝐴))
2221eleq1d 2823 . . . . . . 7 (𝑠 = 𝐴 → ((𝑅s 𝑠) ∈ Ring ↔ (𝑅s 𝐴) ∈ Ring))
23 eleq2 2827 . . . . . . 7 (𝑠 = 𝐴 → ( 1𝑠1𝐴))
2422, 23anbi12d 631 . . . . . 6 (𝑠 = 𝐴 → (((𝑅s 𝑠) ∈ Ring ∧ 1𝑠) ↔ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
2524elrab 3624 . . . . 5 (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ (𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
2616elpw2 5269 . . . . . 6 (𝐴 ∈ 𝒫 𝐵𝐴𝐵)
2726anbi1i 624 . . . . 5 ((𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)) ↔ (𝐴𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
28 an12 642 . . . . 5 ((𝐴𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)) ↔ ((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)))
2925, 27, 283bitri 297 . . . 4 (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ ((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)))
30 ibar 529 . . . . 5 (𝑅 ∈ Ring → ((𝑅s 𝐴) ∈ Ring ↔ (𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring)))
3130anbi1d 630 . . . 4 (𝑅 ∈ Ring → (((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
3229, 31bitrid 282 . . 3 (𝑅 ∈ Ring → (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
3320, 32bitrd 278 . 2 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
342, 3, 33pm5.21nii 380 1 (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 396   = wceq 1539  wcel 2106  {crab 3068  wss 3887  𝒫 cpw 4533  cfv 6433  (class class class)co 7275  Basecbs 16912  s cress 16941  1rcur 19737  Ringcrg 19783  SubRingcsubrg 20020
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-iota 6391  df-fun 6435  df-fv 6441  df-ov 7278  df-subrg 20022
This theorem is referenced by:  subrgss  20025  subrgid  20026  subrgring  20027  subrgrcl  20029  subrg1cl  20032  issubrg2  20044  subsubrg  20050  subrgpropd  20059  issubassa  21073  subrgpsr  21188  cphsubrglem  24341
  Copyright terms: Public domain W3C validator