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

Theorem cmnpropd 13365
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 13021 . . 3  |-  ( ph  ->  ( K  e.  Mnd  <->  L  e.  Mnd ) )
53oveqrspc2v 5945 . . . . . 6  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( u ( +g  `  K ) v )  =  ( u ( +g  `  L ) v ) )
63oveqrspc2v 5945 . . . . . . 7  |-  ( (
ph  /\  ( v  e.  B  /\  u  e.  B ) )  -> 
( v ( +g  `  K ) u )  =  ( v ( +g  `  L ) u ) )
76ancom2s 566 . . . . . 6  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( v ( +g  `  K ) u )  =  ( v ( +g  `  L ) u ) )
85, 7eqeq12d 2208 . . . . 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 2516 . . . 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 2696 . . . . 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 2706 . . . 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 2696 . . . . 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 2706 . . . 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 473 . 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 2193 . . 3  |-  ( Base `  K )  =  (
Base `  K )
17 eqid 2193 . . 3  |-  ( +g  `  K )  =  ( +g  `  K )
1816, 17iscmn 13363 . 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 2193 . . 3  |-  ( Base `  L )  =  (
Base `  L )
20 eqid 2193 . . 3  |-  ( +g  `  L )  =  ( +g  `  L )
2119, 20iscmn 13363 . 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 1364    e. wcel 2164   A.wral 2472   ` cfv 5254  (class class class)co 5918   Basecbs 12618   +g cplusg 12695   Mndcmnd 12997  CMndccmn 13354
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 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-cnex 7963  ax-resscn 7964  ax-1re 7966  ax-addrcl 7969
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-rab 2481  df-v 2762  df-sbc 2986  df-un 3157  df-in 3159  df-ss 3166  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-iota 5215  df-fun 5256  df-fn 5257  df-fv 5262  df-ov 5921  df-inn 8983  df-2 9041  df-ndx 12621  df-slot 12622  df-base 12624  df-plusg 12708  df-mgm 12939  df-sgrp 12985  df-mnd 12998  df-cmn 13356
This theorem is referenced by:  ablpropd  13366  crngpropd  13535
  Copyright terms: Public domain W3C validator