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

Theorem issdrg 21096
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 21095 . . . 4 SubDRing = (𝑤 ∈ DivRing ↦ {𝑠 ∈ (SubRing‘𝑤) ∣ (𝑤 ↾s 𝑠) ∈ DivRing})
21mptrcl 7034 . . 3 (𝑆 ∈ (SubDRing‘𝑅) → 𝑅 ∈ DivRing)
3 fveq2 6916 . . . . . . 7 (𝑤 = 𝑅 → (SubRing‘𝑤) = (SubRing‘𝑅))
4 oveq1 7458 . . . . . . . 8 (𝑤 = 𝑅 → (𝑤 ↾s 𝑠) = (𝑅 ↾s 𝑠))
54eleq1d 2849 . . . . . . 7 (𝑤 = 𝑅 → ((𝑤 ↾s 𝑠) ∈ DivRing ↔ (𝑅 ↾s 𝑠) ∈ DivRing))
63, 5rabeqbidv 3433 . . . . . 6 (𝑤 = 𝑅 → {𝑠 ∈ (SubRing‘𝑤) ∣ (𝑤 ↾s 𝑠) ∈ DivRing} = {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing})
7 fvex 6929 . . . . . . 7 (SubRing‘𝑅) ∈ V
87rabex 5307 . . . . . 6 {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing} ∈ V
96, 1, 8fvmpt 7024 . . . . 5 (𝑅 ∈ DivRing → (SubDRing‘𝑅) = {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing})
109eleq2d 2850 . . . 4 (𝑅 ∈ DivRing → (𝑆 ∈ (SubDRing‘𝑅) ↔ 𝑆 ∈ {𝑠 ∈ (SubRing‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ DivRing}))
11 oveq2 7459 . . . . . 6 (𝑠 = 𝑆 → (𝑅 ↾s 𝑠) = (𝑅 ↾s 𝑆))
1211eleq1d 2849 . . . . 5 (𝑠 = 𝑆 → ((𝑅 ↾s 𝑠) ∈ DivRing ↔ (𝑅 ↾s 𝑆) ∈ DivRing))
1312elrab 3648 . . . 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 2147  {crab 3416  ‘cfv 6566  (class class class)co 7451   ↾s cress 17452  SubRingcsubrg 20872  DivRingcdr 21031  SubDRingcsdrg 21094
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-sdrg 21095
This theorem is used by:  sdrgrcl  21097  sdrgdrng  21098  sdrgsubrg  21099  sdrgid  21100  sdrgss  21101  issdrg2  21103  fldsdrgfld  21106  sdrgint  21112  primefld  21113  primefld0cl  21114  primefld1cl  21115  subsdrg  33964  sdrgdvcl  33965  sdrginvcl  33966  primefldchr  33967  fldgensdrg  33980  fldgenssp  33984  primefldgen1  33987  1fldgenq  33988  fldextsdrg  34397  fldextrspunlem2  34420  fldextrspundgdvdslem  34423  fldextrspundgdvds  34424  irngnzply1lem  34433  irngnzply1  34434  ply1annig1p  34447  minplycl  34449  ply1annprmidl  34450  algextdeglem1  34460  algextdeglem2  34461  algextdeglem3  34462  algextdeglem4  34463  algextdeglem5  34464  constrextdg2  34492  constrext2chnlem  34493  constrcon  34517  2sqr3minply  34523  cos9thpiminply  34531
  Copyright terms: Public domain W3C validator