Theorem rngen1zr

Description: The only (unital) ring with one element is the zero ring (at least if its operations are internal binary operations). Note: The assumption R e. Ring could be weakened if a definition of a non-unital ring ("Rng") was available (it would be sufficient that the multiplication is closed). (Contributed by FL, 14-Feb-2010) (Revised by AV, 25-Jan-2020)

	Ref	Expression
Hypotheses	ring1zr.b	|- B = ( Base ` R )
	ring1zr.p	|- .+ = ( +g ` R )
	ring1zr.t	|- .* = ( .r ` R )
Assertion	rngen1zr	|- ( ( ( R e. Ring /\ .+ Fn ( B X. B ) /\ .* Fn ( B X. B ) ) /\ Z e. B ) -> ( B ~~ 1o <-> ( .+ = { <. <. Z , Z >. , Z >. } /\ .* = { <. <. Z , Z >. , Z >. } ) ) )

Proof

Step	Hyp	Ref	Expression
1		ring1zr.b	|- B = ( Base ` R )
2		ring1zr.p	|- .+ = ( +g ` R )
3		ring1zr.t	|- .* = ( .r ` R )
4		en1eqsnbi	|- ( Z e. B -> ( B ~~ 1o <-> B = { Z } ) )
5	4	adantl	|- ( ( ( R e. Ring /\ .+ Fn ( B X. B ) /\ .* Fn ( B X. B ) ) /\ Z e. B ) -> ( B ~~ 1o <-> B = { Z } ) )
6	1 2 3	ring1zr	|- ( ( ( R e. Ring /\ .+ Fn ( B X. B ) /\ .* Fn ( B X. B ) ) /\ Z e. B ) -> ( B = { Z } <-> ( .+ = { <. <. Z , Z >. , Z >. } /\ .* = { <. <. Z , Z >. , Z >. } ) ) )
7	5 6	bitrd	|- ( ( ( R e. Ring /\ .+ Fn ( B X. B ) /\ .* Fn ( B X. B ) ) /\ Z e. B ) -> ( B ~~ 1o <-> ( .+ = { <. <. Z , Z >. , Z >. } /\ .* = { <. <. Z , Z >. , Z >. } ) ) )