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

Theorem cmnpropd 14048
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 13701 . . 3  |-  ( ph  ->  ( K  e.  Mnd  <->  L  e.  Mnd ) )
53oveqrspc2v 6085 . . . . . 6  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( u ( +g  `  K ) v )  =  ( u ( +g  `  L ) v ) )
63oveqrspc2v 6085 . . . . . . 7  |-  ( (
ph  /\  ( v  e.  B  /\  u  e.  B ) )  -> 
( v ( +g  `  K ) u )  =  ( v ( +g  `  L ) u ) )
76ancom2s 568 . . . . . 6  |-  ( (
ph  /\  ( u  e.  B  /\  v  e.  B ) )  -> 
( v ( +g  `  K ) u )  =  ( v ( +g  `  L ) u ) )
85, 7eqeq12d 2249 . . . . 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 2566 . . . 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 2749 . . . . 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 2759 . . . 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 2749 . . . . 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 2759 . . . 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 2234 . . 3  |-  ( Base `  K )  =  (
Base `  K )
17 eqid 2234 . . 3  |-  ( +g  `  K )  =  ( +g  `  K )
1816, 17iscmn 14046 . 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 2234 . . 3  |-  ( Base `  L )  =  (
Base `  L )
20 eqid 2234 . . 3  |-  ( +g  `  L )  =  ( +g  `  L )
2119, 20iscmn 14046 . 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 1398    e. wcel 2205   A.wral 2522   ` cfv 5357  (class class class)co 6058   Basecbs 13296   +g cplusg 13374   Mndcmnd 13677  CMndccmn 14037
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-cnex 8234  ax-resscn 8235  ax-1re 8237  ax-addrcl 8240
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ral 2527  df-rex 2528  df-rab 2531  df-v 2817  df-sbc 3046  df-un 3218  df-in 3220  df-ss 3227  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-iota 5317  df-fun 5359  df-fn 5360  df-fv 5365  df-ov 6061  df-inn 9255  df-2 9313  df-ndx 13299  df-slot 13300  df-base 13302  df-plusg 13387  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-cmn 14039
This theorem is referenced by:  ablpropd  14049  crngpropd  14282
  Copyright terms: Public domain W3C validator