MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  mndprop Structured version   Visualization version   GIF version

Theorem mndprop 18587
Description: If two structures have the same group components (properties), one is a monoid iff the other one is. (Contributed by Mario Carneiro, 11-Oct-2013.)
Hypotheses
Ref Expression
mndprop.b (Base‘𝐾) = (Base‘𝐿)
mndprop.p (+g𝐾) = (+g𝐿)
Assertion
Ref Expression
mndprop (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd)

Proof of Theorem mndprop
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 eqidd 2734 . . 3 (⊤ → (Base‘𝐾) = (Base‘𝐾))
2 mndprop.b . . . 4 (Base‘𝐾) = (Base‘𝐿)
32a1i 11 . . 3 (⊤ → (Base‘𝐾) = (Base‘𝐿))
4 mndprop.p . . . . 5 (+g𝐾) = (+g𝐿)
54oveqi 7371 . . . 4 (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦)
65a1i 11 . . 3 ((⊤ ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
71, 3, 6mndpropd 18586 . 2 (⊤ → (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd))
87mptru 1549 1 (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd)
Colors of variables: wff setvar class
Syntax hints:  wb 205  wa 397   = wceq 1542  wtru 1543  wcel 2107  cfv 6497  (class class class)co 7358  Basecbs 17088  +gcplusg 17138  Mndcmnd 18561
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-nul 5264  ax-pr 5385
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3407  df-v 3446  df-sbc 3741  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-br 5107  df-iota 6449  df-fv 6505  df-ov 7361  df-mgm 18502  df-sgrp 18551  df-mnd 18562
This theorem is referenced by:  ring1  20031
  Copyright terms: Public domain W3C validator