| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mndprop | Structured version Visualization version GIF version | ||
| 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.) |
| Ref | Expression |
|---|---|
| mndprop.b | ⊢ (Base‘𝐾) = (Base‘𝐿) |
| mndprop.p | ⊢ (+g‘𝐾) = (+g‘𝐿) |
| Ref | Expression |
|---|---|
| mndprop | ⊢ (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqidd 2764 | . . 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 7423 | . . . 4 ⊢ (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦) |
| 6 | 5 | a1i 11 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦)) |
| 7 | 1, 3, 6 | mndpropd 18812 | . 2 ⊢ (⊤ → (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd)) |
| 8 | 7 | mptru 1577 | 1 ⊢ (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1570 ⊤wtru 1571 ∈ wcel 2143 ‘cfv 6536 (class class class)co 7410 Basecbs 17264 +gcplusg 17305 Mndcmnd 18787 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-ext 2735 ax-nul 5269 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-rab 3417 df-v 3457 df-sbc 3745 df-dif 3908 df-un 3910 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-iota 6492 df-fv 6544 df-ov 7413 df-mgm 18693 df-sgrp 18772 df-mnd 18788 |
| This theorem is referenced by: ring1 20389 opprmndb 43285 |
| Copyright terms: Public domain | W3C validator |