| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > grpss | Structured version Visualization version GIF version | ||
| Description: Show that a structure extending a constructed group (e.g., a ring) is also a group. This allows to prove that a constructed potential ring 𝑅 is a group before we know that it is also a ring. (Theorem ringgrp 20383, on the other hand, requires that we know in advance that 𝑅 is a ring.) (Contributed by NM, 11-Oct-2013.) |
| Ref | Expression |
|---|---|
| grpss.g | ⊢ 𝐺 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} |
| grpss.r | ⊢ 𝑅 ∈ V |
| grpss.s | ⊢ 𝐺 ⊆ 𝑅 |
| grpss.f | ⊢ Fun 𝑅 |
| Ref | Expression |
|---|---|
| grpss | ⊢ (𝐺 ∈ Grp ↔ 𝑅 ∈ Grp) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpss.r | . . . 4 ⊢ 𝑅 ∈ V | |
| 2 | grpss.f | . . . 4 ⊢ Fun 𝑅 | |
| 3 | grpss.s | . . . 4 ⊢ 𝐺 ⊆ 𝑅 | |
| 4 | baseid 17310 | . . . 4 ⊢ Base = Slot (Base‘ndx) | |
| 5 | opex 5443 | . . . . . 6 ⊢ 〈(Base‘ndx), 𝐵〉 ∈ V | |
| 6 | 5 | prid1 4726 | . . . . 5 ⊢ 〈(Base‘ndx), 𝐵〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} |
| 7 | grpss.g | . . . . 5 ⊢ 𝐺 = {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} | |
| 8 | 6, 7 | eleqtrri 2861 | . . . 4 ⊢ 〈(Base‘ndx), 𝐵〉 ∈ 𝐺 |
| 9 | 1, 2, 3, 4, 8 | strss 17304 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝐺) |
| 10 | plusgid 17375 | . . . 4 ⊢ +g = Slot (+g‘ndx) | |
| 11 | opex 5443 | . . . . . 6 ⊢ 〈(+g‘ndx), + 〉 ∈ V | |
| 12 | 11 | prid2 4727 | . . . . 5 ⊢ 〈(+g‘ndx), + 〉 ∈ {〈(Base‘ndx), 𝐵〉, 〈(+g‘ndx), + 〉} |
| 13 | 12, 7 | eleqtrri 2861 | . . . 4 ⊢ 〈(+g‘ndx), + 〉 ∈ 𝐺 |
| 14 | 1, 2, 3, 10, 13 | strss 17304 | . . 3 ⊢ (+g‘𝑅) = (+g‘𝐺) |
| 15 | 9, 14 | grpprop 19082 | . 2 ⊢ (𝑅 ∈ Grp ↔ 𝐺 ∈ Grp) |
| 16 | 15 | bicomi 227 | 1 ⊢ (𝐺 ∈ Grp ↔ 𝑅 ∈ Grp) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 = wceq 1570 ∈ wcel 2145 Vcvv 3453 ⊆ wss 3902 {cpr 4589 〈cop 4593 Fun wfun 6531 ‘cfv 6537 ndxcnx 17291 Basecbs 17307 +gcplusg 17348 Grpcgrp 19063 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-cnex 11184 ax-1cn 11186 ax-addcl 11188 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-iun 4956 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7420 df-om 7867 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-nn 12262 df-2 12331 df-slot 17280 df-ndx 17292 df-base 17308 df-plusg 17361 df-0g 17532 df-mgm 18736 df-sgrp 18827 df-mnd 18843 df-grp 19066 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |