| 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 2770 | . . 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 7424 | . . . 4 ⊢ (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦) |
| 6 | 5 | a1i 11 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦)) |
| 7 | 1, 3, 6 | mndpropd 18816 | . 2 ⊢ (⊤ → (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd)) |
| 8 | 7 | mptru 1574 | 1 ⊢ (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1567 ⊤wtru 1568 ∈ wcel 2149 ‘cfv 6537 (class class class)co 7411 Basecbs 17268 +gcplusg 17309 Mndcmnd 18791 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-sbc 3754 df-dif 3916 df-un 3918 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-iota 6493 df-fv 6545 df-ov 7414 df-mgm 18697 df-sgrp 18776 df-mnd 18792 |
| This theorem is referenced by: ring1 20392 opprmndb 43174 |
| Copyright terms: Public domain | W3C validator |