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

Theorem issubrg 20736
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 20735 . . 3 SubRing = (𝑟 ∈ Ring ↦ {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠)})
21mptrcl 6997 . 2 (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
3 simpll 779 . 2 (((𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring) ∧ (𝐴𝐵1𝐴)) → 𝑅 ∈ Ring)
4 fveq2 6879 . . . . . . . 8 (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5 issubrg.b . . . . . . . 8 𝐵 = (Base‘𝑅)
64, 5eqtr4di 2813 . . . . . . 7 (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
76pweqd 4574 . . . . . 6 (𝑟 = 𝑅 → 𝒫 (Base‘𝑟) = 𝒫 𝐵)
8 oveq1 7421 . . . . . . . 8 (𝑟 = 𝑅 → (𝑟s 𝑠) = (𝑅s 𝑠))
98eleq1d 2845 . . . . . . 7 (𝑟 = 𝑅 → ((𝑟s 𝑠) ∈ Ring ↔ (𝑅s 𝑠) ∈ Ring))
10 fveq2 6879 . . . . . . . . 9 (𝑟 = 𝑅 → (1r𝑟) = (1r𝑅))
11 issubrg.i . . . . . . . . 9 1 = (1r𝑅)
1210, 11eqtr4di 2813 . . . . . . . 8 (𝑟 = 𝑅 → (1r𝑟) = 1 )
1312eleq1d 2845 . . . . . . 7 (𝑟 = 𝑅 → ((1r𝑟) ∈ 𝑠1𝑠))
149, 13anbi12d 644 . . . . . 6 (𝑟 = 𝑅 → (((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠) ↔ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)))
157, 14rabeqbidv 3429 . . . . 5 (𝑟 = 𝑅 → {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟s 𝑠) ∈ Ring ∧ (1r𝑟) ∈ 𝑠)} = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)})
165fvexi 6893 . . . . . . 7 𝐵 ∈ V
1716pwex 5345 . . . . . 6 𝒫 𝐵 ∈ V
1817rabex 5303 . . . . 5 {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ∈ V
1915, 1, 18fvmpt 6987 . . . 4 (𝑅 ∈ Ring → (SubRing‘𝑅) = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)})
2019eleq2d 2846 . . 3 (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ 𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)}))
21 oveq2 7422 . . . . . . . 8 (𝑠 = 𝐴 → (𝑅s 𝑠) = (𝑅s 𝐴))
2221eleq1d 2845 . . . . . . 7 (𝑠 = 𝐴 → ((𝑅s 𝑠) ∈ Ring ↔ (𝑅s 𝐴) ∈ Ring))
23 eleq2 2849 . . . . . . 7 (𝑠 = 𝐴 → ( 1𝑠1𝐴))
2422, 23anbi12d 644 . . . . . 6 (𝑠 = 𝐴 → (((𝑅s 𝑠) ∈ Ring ∧ 1𝑠) ↔ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
2524elrab 3645 . . . . 5 (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ (𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
2616elpw2 5299 . . . . . 6 (𝐴 ∈ 𝒫 𝐵𝐴𝐵)
2726anbi1i 636 . . . . 5 ((𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)) ↔ (𝐴𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)))
28 an12 658 . . . . 5 ((𝐴𝐵 ∧ ((𝑅s 𝐴) ∈ Ring ∧ 1𝐴)) ↔ ((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)))
2925, 27, 283bitri 300 . . . 4 (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅s 𝑠) ∈ Ring ∧ 1𝑠)} ↔ ((𝑅s 𝐴) ∈ Ring ∧ (𝐴𝐵1𝐴)))
30 ibar 538 . . . . 5 (𝑅 ∈ Ring → ((𝑅s 𝐴) ∈ Ring ↔ (𝑅 ∈ Ring ∧ (𝑅s 𝐴) ∈ Ring)))
3130anbi1d 643 . . . 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
This proof depends on syntax axioms:  wb 209  wa 401   = wceq 1570  wcel 2145  {crab 3412  wss 3899  𝒫 cpw 4557  cfv 6533  (class class class)co 7414  Basecbs 17304  s cress 17325  1rcur 20323  Ringcrg 20375  SubRingcsubrg 20734
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7417  df-subrg 20735
This theorem is used by:  subrgss  20737  subrgid  20738  subrgring  20739  subrgrcl  20741  subrgsubrng  20743  subrg1cl  20745  issubrg2  20757  subsubrg  20763  subrgpropd  20773  issubassa  22085  subrgpsr  22195  cphsubrglem  25408  fldgensdrg  33758  fldgenfldext  34181  fldextrspundgdvdslem  34193  fldextrspundgdvds  34194
  Copyright terms: Public domain W3C validator