Metamath Proof Explorer


Theorem drngprmrng

Description: A division ring is a prime ring. (Contributed by Jeff Madsen, 6-Jan-2011) (Revised by AV, 18-Jun-2026)

Ref Expression
Assertion drngprmrng Could not format assertion : No typesetting found for |- ( R e. DivRing -> R e. PrmRing ) with typecode |-

Proof

Step Hyp Ref Expression
1 drngnzr ⊢ R ∈ DivRing → R ∈ NzRing
2 eqid ⊢ Base R = Base R
3 eqid ⊢ 0 R = 0 R
4 eqid ⊢ LIdeal ⁡ R = LIdeal ⁡ R
5 2 3 4 drngnidl ⊢ R ∈ DivRing → LIdeal ⁡ R = 0 R Base R
6 2 3 4 smprngprmrng Could not format ( ( R e. NzRing /\ ( LIdeal ` R ) = { { ( 0g ` R ) } , ( Base ` R ) } ) -> R e. PrmRing ) : No typesetting found for |- ( ( R e. NzRing /\ ( LIdeal ` R ) = { { ( 0g ` R ) } , ( Base ` R ) } ) -> R e. PrmRing ) with typecode |-
7 1 5 6 syl2anc Could not format ( R e. DivRing -> R e. PrmRing ) : No typesetting found for |- ( R e. DivRing -> R e. PrmRing ) with typecode |-