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 2825 | . . 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 7172 | . . . 4 ⊢ (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦) |
6 | 5 | a1i 11 | . . 3 ⊢ ((⊤ ∧ (𝑥 ∈ (Base‘𝐾) ∧ 𝑦 ∈ (Base‘𝐾))) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦)) |
7 | 1, 3, 6 | mndpropd 17939 | . 2 ⊢ (⊤ → (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd)) |
8 | 7 | mptru 1543 | 1 ⊢ (𝐾 ∈ Mnd ↔ 𝐿 ∈ Mnd) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 = wceq 1536 ⊤wtru 1537 ∈ wcel 2113 ‘cfv 6358 (class class class)co 7159 Basecbs 16486 +gcplusg 16568 Mndcmnd 17914 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-nul 5213 ax-pow 5269 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-rab 3150 df-v 3499 df-sbc 3776 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-nul 4295 df-if 4471 df-sn 4571 df-pr 4573 df-op 4577 df-uni 4842 df-br 5070 df-iota 6317 df-fv 6366 df-ov 7162 df-mgm 17855 df-sgrp 17904 df-mnd 17915 |
This theorem is referenced by: ring1 19355 |
Copyright terms: Public domain | W3C validator |