Theorem mndfoOLD

Description: Obsolete version of mndfo as of 17-Aug-2026. The addition operation of a monoid is an onto function (assuming it is a function). (Contributed by Mario Carneiro, 11-Oct-2013) (Proof shortened by AV, 23-Jan-2020) (Proof modification is discouraged.) (New usage is discouraged.)

	Ref	Expression
Hypotheses	mndfoOLD.b	|- B = ( Base ` G )
	mndfoOLD.p	|- .+ = ( +g ` G )
Assertion	mndfoOLD	|- ( ( G e. Mnd /\ .+ Fn ( B X. B ) ) -> .+ : ( B X. B ) -onto-> B )

Proof

Step	Hyp	Ref	Expression
1		mndfoOLD.b	|- B = ( Base ` G )
2		mndfoOLD.p	|- .+ = ( +g ` G )
3		eqid	|- ( +f ` G ) = ( +f ` G )
4	1 3	mndpfo	|- ( G e. Mnd -> ( +f ` G ) : ( B X. B ) -onto-> B )
5	4	adantr	|- ( ( G e. Mnd /\ .+ Fn ( B X. B ) ) -> ( +f ` G ) : ( B X. B ) -onto-> B )
6	1 2 3	plusfeq	|- ( .+ Fn ( B X. B ) -> ( +f ` G ) = .+ )
7	6	eqcomd	|- ( .+ Fn ( B X. B ) -> .+ = ( +f ` G ) )
8	7	adantl	|- ( ( G e. Mnd /\ .+ Fn ( B X. B ) ) -> .+ = ( +f ` G ) )
9		foeq1	|- ( .+ = ( +f ` G ) -> ( .+ : ( B X. B ) -onto-> B <-> ( +f ` G ) : ( B X. B ) -onto-> B ) )
10	8 9	syl	|- ( ( G e. Mnd /\ .+ Fn ( B X. B ) ) -> ( .+ : ( B X. B ) -onto-> B <-> ( +f ` G ) : ( B X. B ) -onto-> B ) )
11	5 10	mpbird	|- ( ( G e. Mnd /\ .+ Fn ( B X. B ) ) -> .+ : ( B X. B ) -onto-> B )