![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > resgrpplusfrn | Structured version Visualization version GIF version |
Description: The underlying set of a group operation which is a restriction of a structure. (Contributed by Paul Chapman, 25-Mar-2008.) (Revised by AV, 30-Aug-2021.) |
Ref | Expression |
---|---|
resgrpplusfrn.b | ⊢ 𝐵 = (Base‘𝐺) |
resgrpplusfrn.h | ⊢ 𝐻 = (𝐺 ↾s 𝑆) |
resgrpplusfrn.o | ⊢ 𝐹 = (+𝑓‘𝐻) |
Ref | Expression |
---|---|
resgrpplusfrn | ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 = ran 𝐹) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2798 | . . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
2 | resgrpplusfrn.o | . . . . 5 ⊢ 𝐹 = (+𝑓‘𝐻) | |
3 | 1, 2 | grpplusfo 18108 | . . . 4 ⊢ (𝐻 ∈ Grp → 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻)) |
4 | 3 | adantr 484 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻)) |
5 | eqidd 2799 | . . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹 = 𝐹) | |
6 | resgrpplusfrn.h | . . . . . . 7 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
7 | resgrpplusfrn.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
8 | 6, 7 | ressbas2 16547 | . . . . . 6 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 = (Base‘𝐻)) |
9 | 8 | adantl 485 | . . . . 5 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 = (Base‘𝐻)) |
10 | 9 | sqxpeqd 5551 | . . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → (𝑆 × 𝑆) = ((Base‘𝐻) × (Base‘𝐻))) |
11 | 5, 10, 9 | foeq123d 6584 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → (𝐹:(𝑆 × 𝑆)–onto→𝑆 ↔ 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻))) |
12 | 4, 11 | mpbird 260 | . 2 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹:(𝑆 × 𝑆)–onto→𝑆) |
13 | forn 6568 | . . 3 ⊢ (𝐹:(𝑆 × 𝑆)–onto→𝑆 → ran 𝐹 = 𝑆) | |
14 | 13 | eqcomd 2804 | . 2 ⊢ (𝐹:(𝑆 × 𝑆)–onto→𝑆 → 𝑆 = ran 𝐹) |
15 | 12, 14 | syl 17 | 1 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 = ran 𝐹) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1538 ∈ wcel 2111 ⊆ wss 3881 × cxp 5517 ran crn 5520 –onto→wfo 6322 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 ↾s cress 16476 +𝑓cplusf 17841 Grpcgrp 18095 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 ax-cnex 10582 ax-1cn 10584 ax-addcl 10586 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3or 1085 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rmo 3114 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-pss 3900 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-tp 4530 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5425 df-eprel 5430 df-po 5438 df-so 5439 df-fr 5478 df-we 5480 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-pred 6116 df-ord 6162 df-on 6163 df-lim 6164 df-suc 6165 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-mpo 7140 df-om 7561 df-1st 7671 df-2nd 7672 df-wrecs 7930 df-recs 7991 df-rdg 8029 df-nn 11626 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-0g 16707 df-plusf 17843 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |