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

Theorem issubrg 20502
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 20501 . . 3 SubRing = (𝑟 ∈ Ring ↦ {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠)})
21mptrcl 6948 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
3 simpll 766 . 2 (((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)) → 𝑅 ∈ Ring)
4 fveq2 6832 . . . . . . . 8 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5 issubrg.b . . . . . . . 8 𝐵 = (Base‘𝑅)
64, 5eqtr4di 2787 . . . . . . 7 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
76pweqd 4569 . . . . . 6 (𝑟 = 𝑅 → 𝒫 (Base‘𝑟) = 𝒫 𝐵)
8 oveq1 7363 . . . . . . . 8 (𝑟 = 𝑅 → (𝑟s 𝑠) = (𝑅s 𝑠))
98eleq1d 2819 . . . . . . 7 (𝑟 = 𝑅 → ((𝑟s 𝑠) ∈ Ring ↔ (𝑅s 𝑠) ∈ Ring))
10 fveq2 6832 . . . . . . . . 9 (𝑟 = 𝑅 → (1r𝑟) = (1r𝑅))
11 issubrg.i . . . . . . . . 9 1 = (1r𝑅)
1210, 11eqtr4di 2787 . . . . . . . 8 (𝑟 = 𝑅 → (1r𝑟) = 1 )
1312eleq1d 2819 . . . . . . 7 (𝑟 = 𝑅 → ((1r𝑟) ∈ 𝑠1𝑠))
149, 13anbi12d 632 . . . . . 6 (𝑟 = 𝑅 → (((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠) ↔ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)))
157, 14rabeqbidv 3415 . . . . 5 (𝑟 = 𝑅 → {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠)} = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)})
165fvexi 6846 . . . . . . 7 𝐵 ∈ V
1716pwex 5323 . . . . . 6 𝒫 𝐵 ∈ V
1817rabex 5282 . . . . 5 {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ∈ V
1915, 1, 18fvmpt 6939 . . . 4 (𝑅 ∈ Ring → (SubRing‘𝑅) = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)})
2019eleq2d 2820 . . 3 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ 𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)}))
21 oveq2 7364 . . . . . . . 8 (𝑠 = 𝐴 → (𝑅s 𝑠) = (𝑅s 𝐴))
2221eleq1d 2819 . . . . . . 7 (𝑠 = 𝐴 → ((𝑅s 𝑠) ∈ Ring ↔ (𝑅s 𝐴) ∈ Ring))
23 eleq2 2823 . . . . . . 7 (𝑠 = 𝐴 → ( 1𝑠1𝐴))
2422, 23anbi12d 632 . . . . . 6 (𝑠 = 𝐴 → (((𝑅s 𝑠) ∈ Ring ∧ 1𝑠) ↔ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
2524elrab 3644 . . . . 5 (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ (𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
2616elpw2 5277 . . . . . 6 (𝐴 ∈ 𝒫 𝐵𝐴𝐵)
2726anbi1i 624 . . . . 5 ((𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)) ↔ (𝐴𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
28 an12 645 . . . . 5 ((𝐴𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)) ↔ ((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)))
2925, 27, 283bitri 297 . . . 4 (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ ((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)))
30 ibar 528 . . . . 5 (𝑅 ∈ Ring → ((𝑅s 𝐴) ∈ Ring ↔ (𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring)))
3130anbi1d 631 . . . 4 (𝑅 ∈ Ring → (((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
3229, 31bitrid 283 . . 3 (𝑅 ∈ Ring → (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
3320, 32bitrd 279 . 2 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
342, 3, 33pm5.21nii 378 1 (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541  wcel 2113  {crab 3397  wss 3899  𝒫 cpw 4552  cfv 6490  (class class class)co 7356  Basecbs 17134  s cress 17155  1rcur 20114  Ringcrg 20166  SubRingcsubrg 20500
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fv 6498  df-ov 7359  df-subrg 20501
This theorem is referenced by:  subrgss  20503  subrgid  20504  subrgring  20505  subrgrcl  20507  subrgsubrng  20509  subrg1cl  20511  issubrg2  20523  subsubrg  20529  subrgpropd  20539  issubassa  21820  subrgpsr  21931  cphsubrglem  25131  fldgensdrg  33345  fldgenfldext  33774  fldextrspundgdvdslem  33786  fldextrspundgdvds  33787
  Copyright terms: Public domain W3C validator