Theorem mndprop 18481

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.

Step	Hyp	Ref	Expression
1		eqidd 2738	. . 3 ⊢ (⊤ → (Base‘𝐾) = (Base‘𝐾))
2		mndprop.b	. . . 4 ⊢ (Base‘𝐾) = (Base‘𝐿)
3	2	a1i 11	. . 3 ⊢ (⊤ → (Base‘𝐾) = (Base‘𝐿))
4		mndprop.p	. . . . 5 ⊢ (+g‘𝐾) = (+g‘𝐿)
5	4	oveqi 7328	. . . 4 ⊢ (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦)
6	5	a1i 11	. . 3 ⊢ ((⊤ ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
7	1, 3, 6	mndpropd 18480	. 2 ⊢ (⊤ → (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd))
8	7	mptru 1547	1 ⊢ (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd)

Syntax hints:   ↔ wb 205   ∧ wa 396   = wceq 1540  ⊤wtru 1541   ∈ wcel 2105  ‘cfv 6465  (class class class)co 7315  Basecbs 16982  +_gcplusg 17032  Mndcmnd 18455

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1912  ax-6 1970  ax-7 2010  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2153  ax-12 2170  ax-ext 2708  ax-nul 5245  ax-pr 5367

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1781  df-nf 1785  df-sb 2067  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2815  df-ne 2942  df-ral 3063  df-rex 3072  df-rab 3405  df-v 3443  df-sbc 3727  df-dif 3900  df-un 3902  df-in 3904  df-ss 3914  df-nul 4268  df-if 4472  df-sn 4572  df-pr 4574  df-op 4578  df-uni 4851  df-br 5088  df-iota 6417  df-fv 6473  df-ov 7318  df-mgm 18396  df-sgrp 18445  df-mnd 18456

This theorem is referenced by:  ring1  19909