ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  cmnpropd Unicode version

Theorem cmnpropd 14075
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.
StepHypRef 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 ) )
41, 2, 3mndpropd 13730 . . 3  |-  ( ph  ->  ( K  e.  Mnd  <->  L  e.  Mnd ) )
53oveqrspc2v 6102 . . . . . 6  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( u ( +g  `  K ) v )  =  ( u ( +g  `  L ) v ) )
63oveqrspc2v 6102 . . . . . . 7  |-  ( (
ph  /\  ( v  e.  B  /\  u  e.  B ) )  -> 
( v ( +g  `  K ) u )  =  ( v ( +g  `  L ) u ) )
76ancom2s 572 . . . . . 6  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( v ( +g  `  K ) u )  =  ( v ( +g  `  L ) u ) )
85, 7eqeq12d 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 ) ) )
982ralbidva 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 ) ) )
101raleqdv 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 ) ) )
111, 10raleqbidv 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 ) ) )
122raleqdv 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 ) ) )
132, 12raleqbidv 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 ) ) )
149, 11, 133bitr3d 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 ) ) )
154, 14anbi12d 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 )
1816, 17iscmn 14073 . 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 )
2119, 20iscmn 14073 . 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 ) ) )
2215, 18, 213bitr4g 223 1  |-  ( ph  ->  ( K  e. CMnd  <->  L  e. CMnd ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105    = wceq 1402    e. wcel 2209   A.wral 2528   ` cfv 5372  (class class class)co 6075   Basecbs 13330   +g cplusg 13408   Mndcmnd 13706  CMndccmn 14064
This theorem was proved from 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 4244  ax-pow 4306  ax-pr 4341  ax-un 4573  ax-cnex 8260  ax-resscn 8261  ax-1re 8263  ax-addrcl 8266
This theorem 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 3687  df-sn 3711  df-pr 3712  df-op 3714  df-uni 3931  df-int 3966  df-br 4126  df-opab 4188  df-mpt 4189  df-id 4433  df-xp 4775  df-rel 4776  df-cnv 4777  df-co 4778  df-dm 4779  df-rn 4780  df-res 4781  df-iota 5332  df-fun 5374  df-fn 5375  df-fv 5380  df-ov 6078  df-inn 9284  df-2 9342  df-ndx 13333  df-slot 13334  df-base 13336  df-plusg 13421  df-mgm 13653  df-sgrp 13694  df-mnd 13707  df-cmn 14066
This theorem is referenced by:  ablpropd  14076  crngpropd  14317
  Copyright terms: Public domain W3C validator