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

Theorem issdrg 20954
Description: Property of a division subring. (Contributed by Stefan O'Rear, 3-Oct-2015.)
Assertion
Ref Expression
issdrg (𝑆 ∈ (SubDRing‘𝑅) ↔ (𝑅 ∈ DivRing ∧ 𝑆 ∈ (SubRing‘𝑅) ∧ (𝑅s 𝑆) ∈ DivRing))

Proof of Theorem issdrg
Dummy variables 𝑤 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-sdrg 20953 . . . 4 SubDRing = (𝑤 ∈ DivRing ↦ {𝑠 ∈ (SubRing‘𝑤) ∣ (𝑤s 𝑠) ∈ DivRing})
21mptrcl 6996 . . 3 (𝑆 ∈ (SubDRing‘𝑅) → 𝑅 ∈ DivRing)
3 fveq2 6878 . . . . . . 7 (𝑤 = 𝑅 → (SubRing‘𝑤) = (SubRing‘𝑅))
4 oveq1 7420 . . . . . . . 8 (𝑤 = 𝑅 → (𝑤s 𝑠) = (𝑅s 𝑠))
54eleq1d 2845 . . . . . . 7 (𝑤 = 𝑅 → ((𝑤s 𝑠) ∈ DivRing ↔ (𝑅s 𝑠) ∈ DivRing))
63, 5rabeqbidv 3429 . . . . . 6 (𝑤 = 𝑅 → {𝑠 ∈ (SubRing‘𝑤) ∣ (𝑤s 𝑠) ∈ DivRing} = {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅s 𝑠) ∈ DivRing})
7 fvex 6891 . . . . . . 7 (SubRing‘𝑅) ∈ V
87rabex 5303 . . . . . 6 {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅s 𝑠) ∈ DivRing} ∈ V
96, 1, 8fvmpt 6986 . . . . 5 (𝑅 ∈ DivRing → (SubDRing‘𝑅) = {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅s 𝑠) ∈ DivRing})
109eleq2d 2846 . . . 4 (𝑅 ∈ DivRing → (𝑆 ∈ (SubDRing‘𝑅) ↔ 𝑆 ∈ {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅s 𝑠) ∈ DivRing}))
11 oveq2 7421 . . . . . 6 (𝑠 = 𝑆 → (𝑅s 𝑠) = (𝑅s 𝑆))
1211eleq1d 2845 . . . . 5 (𝑠 = 𝑆 → ((𝑅s 𝑠) ∈ DivRing ↔ (𝑅s 𝑆) ∈ DivRing))
1312elrab 3645 . . . 4 (𝑆 ∈ {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅s 𝑠) ∈ DivRing} ↔ (𝑆 ∈ (SubRing‘𝑅) ∧ (𝑅s 𝑆) ∈ DivRing))
1410, 13bitrdi 290 . . 3 (𝑅 ∈ DivRing → (𝑆 ∈ (SubDRing‘𝑅) ↔ (𝑆 ∈ (SubRing‘𝑅) ∧ (𝑅s 𝑆) ∈ DivRing)))
152, 14biadanii 834 . 2 (𝑆 ∈ (SubDRing‘𝑅) ↔ (𝑅 ∈ DivRing ∧ (𝑆 ∈ (SubRing‘𝑅) ∧ (𝑅s 𝑆) ∈ DivRing)))
16 3anass 1111 . 2 ((𝑅 ∈ DivRing ∧ 𝑆 ∈ (SubRing‘𝑅) ∧ (𝑅s 𝑆) ∈ DivRing) ↔ (𝑅 ∈ DivRing ∧ (𝑆 ∈ (SubRing‘𝑅) ∧ (𝑅s 𝑆) ∈ DivRing)))
1715, 16bitr4i 281 1 (𝑆 ∈ (SubDRing‘𝑅) ↔ (𝑅 ∈ DivRing ∧ 𝑆 ∈ (SubRing‘𝑅) ∧ (𝑅s 𝑆) ∈ DivRing))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2145  {crab 3412  cfv 6533  (class class class)co 7413  s cress 17322  SubRingcsubrg 20731  DivRingcdr 20890  SubDRingcsdrg 20952
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-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 7416  df-sdrg 20953
This theorem is used by:  sdrgrcl  20955  sdrgdrng  20956  sdrgsubrg  20957  sdrgid  20958  sdrgss  20959  issdrg2  20961  fldsdrgfld  20964  sdrgint  20970  primefld  20971  primefld0cl  20972  primefld1cl  20973  subsdrg  33739  sdrgdvcl  33740  sdrginvcl  33741  primefldchr  33742  fldgensdrg  33755  fldgenssp  33759  primefldgen1  33762  1fldgenq  33763  fldextsdrg  34164  fldextrspunlem2  34187  fldextrspundgdvdslem  34190  fldextrspundgdvds  34191  irngnzply1lem  34200  irngnzply1  34201  ply1annig1p  34214  minplycl  34216  ply1annprmidl  34217  algextdeglem1  34227  algextdeglem2  34228  algextdeglem3  34229  algextdeglem4  34230  algextdeglem5  34231  constrextdg2  34259  constrext2chnlem  34260  constrcon  34284  2sqr3minply  34290  cos9thpiminply  34298
  Copyright terms: Public domain W3C validator