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

Theorem issdrg 21052
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 21051 . . . 4 SubDRing = (𝑤 ∈ DivRing ↦ {𝑠 ∈ (SubRing‘𝑤) ∣ (𝑤 ↾s 𝑠) ∈ DivRing})
21mptrcl 7006 . . 3 (𝑆 ∈ (SubDRing‘𝑅) → 𝑅 ∈ DivRing)
3 fveq2 6888 . . . . . . 7 (𝑤 = 𝑅 → (SubRing‘𝑤) = (SubRing‘𝑅))
4 oveq1 7429 . . . . . . . 8 (𝑤 = 𝑅 → (𝑤 ↾s 𝑠) = (𝑅 ↾s 𝑠))
54eleq1d 2845 . . . . . . 7 (𝑤 = 𝑅 → ((𝑤 ↾s 𝑠) ∈ DivRing ↔ (𝑅 ↾s 𝑠) ∈ DivRing))
63, 5rabeqbidv 3429 . . . . . 6 (𝑤 = 𝑅 → {𝑠 ∈ (SubRing‘𝑤) ∣ (𝑤 ↾s 𝑠) ∈ DivRing} = {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing})
7 fvex 6901 . . . . . . 7 (SubRing‘𝑅) ∈ V
87rabex 5299 . . . . . 6 {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing} ∈ V
96, 1, 8fvmpt 6996 . . . . 5 (𝑅 ∈ DivRing → (SubDRing‘𝑅) = {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing})
109eleq2d 2846 . . . 4 (𝑅 ∈ DivRing → (𝑆 ∈ (SubDRing‘𝑅) ↔ 𝑆 ∈ {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing}))
11 oveq2 7430 . . . . . 6 (𝑠 = 𝑆 → (𝑅 ↾s 𝑠) = (𝑅 ↾s 𝑆))
1211eleq1d 2845 . . . . 5 (𝑠 = 𝑆 → ((𝑅 ↾s 𝑠) ∈ DivRing ↔ (𝑅 ↾s 𝑆) ∈ DivRing))
1312elrab 3644 . . . 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 1569   ∈ wcel 2144  {crab 3412  ‘cfv 6541  (class class class)co 7422   ↾s cress 17415  SubRingcsubrg 20828  DivRingcdr 20987  SubDRingcsdrg 21050
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6496  df-fun 6543  df-fv 6549  df-ov 7425  df-sdrg 21051
This theorem is used by:  sdrgrcl  21053  sdrgdrng  21054  sdrgsubrg  21055  sdrgid  21056  sdrgss  21057  issdrg2  21059  fldsdrgfld  21062  sdrgint  21068  primefld  21069  primefld0cl  21070  primefld1cl  21071  subsdrg  33908  sdrgdvcl  33909  sdrginvcl  33910  primefldchr  33911  fldgensdrg  33924  fldgenssp  33928  primefldgen1  33931  1fldgenq  33932  fldextsdrg  34334  fldextrspunlem2  34357  fldextrspundgdvdslem  34360  fldextrspundgdvds  34361  irngnzply1lem  34370  irngnzply1  34371  ply1annig1p  34384  minplycl  34386  ply1annprmidl  34387  algextdeglem1  34397  algextdeglem2  34398  algextdeglem3  34399  algextdeglem4  34400  algextdeglem5  34401  constrextdg2  34429  constrext2chnlem  34430  constrcon  34454  2sqr3minply  34460  cos9thpiminply  34468
  Copyright terms: Public domain W3C validator