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

Theorem issdrg 21038
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 21037 . . . 4 SubDRing = (𝑤 ∈ DivRing ↦ {𝑠 ∈ (SubRing‘𝑤) ∣ (𝑤 ↾s 𝑠) ∈ DivRing})
21mptrcl 7001 . . 3 (𝑆 ∈ (SubDRing‘𝑅) → 𝑅 ∈ DivRing)
3 fveq2 6883 . . . . . . 7 (𝑤 = 𝑅 → (SubRing‘𝑤) = (SubRing‘𝑅))
4 oveq1 7425 . . . . . . . 8 (𝑤 = 𝑅 → (𝑤 ↾s 𝑠) = (𝑅 ↾s 𝑠))
54eleq1d 2846 . . . . . . 7 (𝑤 = 𝑅 → ((𝑤 ↾s 𝑠) ∈ DivRing ↔ (𝑅 ↾s 𝑠) ∈ DivRing))
63, 5rabeqbidv 3430 . . . . . 6 (𝑤 = 𝑅 → {𝑠 ∈ (SubRing‘𝑤) ∣ (𝑤 ↾s 𝑠) ∈ DivRing} = {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing})
7 fvex 6896 . . . . . . 7 (SubRing‘𝑅) ∈ V
87rabex 5300 . . . . . 6 {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing} ∈ V
96, 1, 8fvmpt 6991 . . . . 5 (𝑅 ∈ DivRing → (SubDRing‘𝑅) = {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing})
109eleq2d 2847 . . . 4 (𝑅 ∈ DivRing → (𝑆 ∈ (SubDRing‘𝑅) ↔ 𝑆 ∈ {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing}))
11 oveq2 7426 . . . . . 6 (𝑠 = 𝑆 → (𝑅 ↾s 𝑠) = (𝑅 ↾s 𝑆))
1211eleq1d 2846 . . . . 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 3413  ‘cfv 6537  (class class class)co 7418   ↾s cress 17401  SubRingcsubrg 20814  DivRingcdr 20973  SubDRingcsdrg 21036
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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-sdrg 21037
This theorem is used by:  sdrgrcl  21039  sdrgdrng  21040  sdrgsubrg  21041  sdrgid  21042  sdrgss  21043  issdrg2  21045  fldsdrgfld  21048  sdrgint  21054  primefld  21055  primefld0cl  21056  primefld1cl  21057  subsdrg  33853  sdrgdvcl  33854  sdrginvcl  33855  primefldchr  33856  fldgensdrg  33869  fldgenssp  33873  primefldgen1  33876  1fldgenq  33877  fldextsdrg  34279  fldextrspunlem2  34302  fldextrspundgdvdslem  34305  fldextrspundgdvds  34306  irngnzply1lem  34315  irngnzply1  34316  ply1annig1p  34329  minplycl  34331  ply1annprmidl  34332  algextdeglem1  34342  algextdeglem2  34343  algextdeglem3  34344  algextdeglem4  34345  algextdeglem5  34346  constrextdg2  34374  constrext2chnlem  34375  constrcon  34399  2sqr3minply  34405  cos9thpiminply  34413
  Copyright terms: Public domain W3C validator