Theorem cmnpropd 14098

Description: If two structures have the same group components (properties), one is a commutative monoid iff the other one is. (Contributed by Mario Carneiro, 6-Jan-2015.)

Hypotheses

Ref	Expression
ablpropd.1	|- ( ph -> B = ( Base ` K ) )
ablpropd.2	|- ( ph -> B = ( Base ` L ) )
ablpropd.3	|- ( ( ph /\ ( x e. B /\ y e. B ) ) -> ( x ( +g ` K ) y ) = ( x ( +g ` L ) y ) )

Assertion

Ref	Expression
cmnpropd	|- ( ph -> ( K e. CMnd <-> L e. CMnd ) )

Distinct variable groups:   x, y, B   x, K, y   x, L, y   ph, x, y

Proof of Theorem cmnpropd

Dummy variables v u are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ablpropd.1	. . . 4 |- ( ph -> B = ( Base ` K ) )
2		ablpropd.2	. . . 4 |- ( ph -> B = ( Base ` L ) )
3		ablpropd.3	. . . 4 |- ( ( ph /\ ( x e. B /\ y e. B ) ) -> ( x ( +g ` K ) y ) = ( x ( +g ` L ) y ) )
4	1, 2, 3	mndpropd 13753	. . 3 |- ( ph -> ( K e. Mnd <-> L e. Mnd ) )
5	3	oveqrspc2v 6112	. . . . . 6 |- ( ( ph /\ ( u e. B /\ v e. B ) ) -> ( u ( +g ` K ) v ) = ( u ( +g ` L ) v ) )
6	3	oveqrspc2v 6112	. . . . . . 7 |- ( ( ph /\ ( v e. B /\ u e. B ) ) -> ( v ( +g ` K ) u ) = ( v ( +g ` L ) u ) )
7	6	ancom2s 572	. . . . . 6 |- ( ( ph /\ ( u e. B /\ v e. B ) ) -> ( v ( +g ` K ) u ) = ( v ( +g ` L ) u ) )
8	5, 7	eqeq12d 2253	. . . . 5 |- ( ( ph /\ ( u e. B /\ v e. B ) ) -> ( ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) <-> ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) ) )
9	8	2ralbidva 2572	. . . 4 |- ( ph -> ( A. u e. B A. v e. B ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) <-> A. u e. B A. v e. B ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) ) )
10	1	raleqdv 2755	. . . . 5 |- ( ph -> ( A. v e. B ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) <-> A. v e. ( Base ` K ) ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) ) )
11	1, 10	raleqbidv 2765	. . . 4 |- ( ph -> ( A. u e. B A. v e. B ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) <-> A. u e. ( Base ` K ) A. v e. ( Base ` K ) ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) ) )
12	2	raleqdv 2755	. . . . 5 |- ( ph -> ( A. v e. B ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) <-> A. v e. ( Base ` L ) ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) ) )
13	2, 12	raleqbidv 2765	. . . 4 |- ( ph -> ( A. u e. B A. v e. B ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) <-> A. u e. ( Base ` L ) A. v e. ( Base ` L ) ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) ) )
14	9, 11, 13	3bitr3d 218	. . 3 |- ( ph -> ( A. u e. ( Base ` K ) A. v e. ( Base ` K ) ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) <-> A. u e. ( Base ` L ) A. v e. ( Base ` L ) ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) ) )
15	4, 14	anbi12d 477	. 2 |- ( ph -> ( ( K e. Mnd /\ A. u e. ( Base ` K ) A. v e. ( Base ` K ) ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) ) <-> ( L e. Mnd /\ A. u e. ( Base ` L ) A. v e. ( Base ` L ) ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) ) ) )
16		eqid 2238	. . 3 |- ( Base ` K ) = ( Base ` K )
17		eqid 2238	. . 3 |- ( +g ` K ) = ( +g ` K )
18	16, 17	iscmn 14096	. 2 |- ( K e. CMnd <-> ( K e. Mnd /\ A. u e. ( Base ` K ) A. v e. ( Base ` K ) ( u ( +g ` K ) v ) = ( v ( +g ` K ) u ) ) )
19		eqid 2238	. . 3 |- ( Base ` L ) = ( Base ` L )
20		eqid 2238	. . 3 |- ( +g ` L ) = ( +g ` L )
21	19, 20	iscmn 14096	. 2 |- ( L e. CMnd <-> ( L e. Mnd /\ A. u e. ( Base ` L ) A. v e. ( Base ` L ) ( u ( +g ` L ) v ) = ( v ( +g ` L ) u ) ) )
22	15, 18, 21	3bitr4g 223	1 |- ( ph -> ( K e. CMnd <-> L e. CMnd ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   <-> wb 105   = wceq 1402   e. wcel 2209   A.wral 2528   ` cfv 5377  (class class class)co 6085   Basecbs 13352   +g cplusg 13431   Mndcmnd 13729  CMndccmn 14087

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8270  ax-resscn 8271  ax-1re 8273  ax-addrcl 8276

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9305  df-2 9363  df-ndx 13355  df-slot 13356  df-base 13358  df-plusg 13444  df-mgm 13676  df-sgrp 13717  df-mnd 13730  df-cmn 14089

This theorem is used by:  ablpropd  14099  crngpropd  14344