Description: Define the class of prime ideals of a ring R . A proper ideal I
of R is prime if whenever A B C_ I for ideals A and B ,
either A C_ I or B C_ I . The more familiar definition using
elements rather than ideals is equivalent provided R is commutative;
see prmidl2 and isprmidlc . (Contributed by Jeff Madsen, 10-Jun-2010)(Revised by Thierry Arnoux, 14-Jan-2024)
Could not format assertion : No typesetting found for |- PrmIdeal = ( r e. Ring |-> { i e. ( LIdeal ` r ) | ( i =/= ( Base ` r ) /\ A. a e. ( LIdeal ` r ) A. b e. ( LIdeal ` r ) ( A. x e. a A. y e. b ( x ( .r ` r ) y ) e. i -> ( a C_ i \/ b C_ i ) ) ) } ) with typecode |-
Could not format PrmIdeal = ( r e. Ring |-> { i e. ( LIdeal ` r ) | ( i =/= ( Base ` r ) /\ A. a e. ( LIdeal ` r ) A. b e. ( LIdeal ` r ) ( A. x e. a A. y e. b ( x ( .r ` r ) y ) e. i -> ( a C_ i \/ b C_ i ) ) ) } ) : No typesetting found for wff PrmIdeal = ( r e. Ring |-> { i e. ( LIdeal ` r ) | ( i =/= ( Base ` r ) /\ A. a e. ( LIdeal ` r ) A. b e. ( LIdeal ` r ) ( A. x e. a A. y e. b ( x ( .r ` r ) y ) e. i -> ( a C_ i \/ b C_ i ) ) ) } ) with typecode wff