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

Theorem issubrg 20656
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 20655 . . 3 SubRing = (𝑟 ∈ Ring ↦ {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠)})
21mptrcl 7000 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
3 simpll 778 . 2 (((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)) → 𝑅 ∈ Ring)
4 fveq2 6882 . . . . . . . 8 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5 issubrg.b . . . . . . . 8 𝐵 = (Base‘𝑅)
64, 5eqtr4di 2822 . . . . . . 7 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
76pweqd 4584 . . . . . 6 (𝑟 = 𝑅 → 𝒫 (Base‘𝑟) = 𝒫 𝐵)
8 oveq1 7418 . . . . . . . 8 (𝑟 = 𝑅 → (𝑟s 𝑠) = (𝑅s 𝑠))
98eleq1d 2854 . . . . . . 7 (𝑟 = 𝑅 → ((𝑟s 𝑠) ∈ Ring ↔ (𝑅s 𝑠) ∈ Ring))
10 fveq2 6882 . . . . . . . . 9 (𝑟 = 𝑅 → (1r𝑟) = (1r𝑅))
11 issubrg.i . . . . . . . . 9 1 = (1r𝑅)
1210, 11eqtr4di 2822 . . . . . . . 8 (𝑟 = 𝑅 → (1r𝑟) = 1 )
1312eleq1d 2854 . . . . . . 7 (𝑟 = 𝑅 → ((1r𝑟) ∈ 𝑠1𝑠))
149, 13anbi12d 643 . . . . . 6 (𝑟 = 𝑅 → (((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠) ↔ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)))
157, 14rabeqbidv 3441 . . . . 5 (𝑟 = 𝑅 → {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠)} = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)})
165fvexi 6896 . . . . . . 7 𝐵 ∈ V
1716pwex 5352 . . . . . 6 𝒫 𝐵 ∈ V
1817rabex 5310 . . . . 5 {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ∈ V
1915, 1, 18fvmpt 6990 . . . 4 (𝑅 ∈ Ring → (SubRing‘𝑅) = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)})
2019eleq2d 2855 . . 3 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ 𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)}))
21 oveq2 7419 . . . . . . . 8 (𝑠 = 𝐴 → (𝑅s 𝑠) = (𝑅s 𝐴))
2221eleq1d 2854 . . . . . . 7 (𝑠 = 𝐴 → ((𝑅s 𝑠) ∈ Ring ↔ (𝑅s 𝐴) ∈ Ring))
23 eleq2 2858 . . . . . . 7 (𝑠 = 𝐴 → ( 1𝑠1𝐴))
2422, 23anbi12d 643 . . . . . 6 (𝑠 = 𝐴 → (((𝑅s 𝑠) ∈ Ring ∧ 1𝑠) ↔ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
2524elrab 3659 . . . . 5 (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ (𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
2616elpw2 5305 . . . . . 6 (𝐴 ∈ 𝒫 𝐵𝐴𝐵)
2726anbi1i 635 . . . . 5 ((𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)) ↔ (𝐴𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
28 an12 657 . . . . 5 ((𝐴𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)) ↔ ((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)))
2925, 27, 283bitri 300 . . . 4 (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ ((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)))
30 ibar 537 . . . . 5 (𝑅 ∈ Ring → ((𝑅s 𝐴) ∈ Ring ↔ (𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring)))
3130anbi1d 642 . . . 4 (𝑅 ∈ Ring → (((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
3229, 31bitrid 286 . . 3 (𝑅 ∈ Ring → (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
3320, 32bitrd 282 . 2 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴))))
342, 3, 33pm5.21nii 381 1 (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wb 209  wa 400   = wceq 1567  wcel 2149  {crab 3423  wss 3913  𝒫 cpw 4567  cfv 6537  (class class class)co 7411  Basecbs 17269  s cress 17290  1rcur 20263  Ringcrg 20315  SubRingcsubrg 20654
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7414  df-subrg 20655
This theorem is referenced by:  subrgss  20657  subrgid  20658  subrgring  20659  subrgrcl  20661  subrgsubrng  20663  subrg1cl  20665  issubrg2  20677  subsubrg  20683  subrgpropd  20693  issubassa  21986  subrgpsr  22096  cphsubrglem  25305  fldgensdrg  33578  fldgenfldext  34003  fldextrspundgdvdslem  34015  fldextrspundgdvds  34016
  Copyright terms: Public domain W3C validator