| 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 2765 | . . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 2 | resgrpplusfrn.o | . . . . 5 ⊢ 𝐹 = (+𝑓‘𝐻) | |
| 3 | 1, 2 | grpplusfo 19062 | . . . 4 ⊢ (𝐻 ∈ Grp → 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻)) |
| 4 | 3 | adantr 486 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻)) |
| 5 | eqidd 2766 | . . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹 = 𝐹) | |
| 6 | resgrpplusfrn.h | . . . . . . 7 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
| 7 | resgrpplusfrn.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 8 | 6, 7 | ressbas2 17322 | . . . . . 6 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 = (Base‘𝐻)) |
| 9 | 8 | adantl 487 | . . . . 5 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 = (Base‘𝐻)) |
| 10 | 9 | sqxpeqd 5695 | . . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → (𝑆 × 𝑆) = ((Base‘𝐻) × (Base‘𝐻))) |
| 11 | 5, 10, 9 | foeq123d 6817 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → (𝐹:(𝑆 × 𝑆)–onto→𝑆 ↔ 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻))) |
| 12 | 4, 11 | mpbird 260 | . 2 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹:(𝑆 × 𝑆)–onto→𝑆) |
| 13 | forn 6799 | . . 3 ⊢ (𝐹:(𝑆 × 𝑆)–onto→𝑆 → ran 𝐹 = 𝑆) | |
| 14 | 13 | eqcomd 2771 | . 2 ⊢ (𝐹:(𝑆 × 𝑆)–onto→𝑆 → 𝑆 = ran 𝐹) |
| 15 | 12, 14 | syl 18 | 1 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 = ran 𝐹) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ⊆ wss 3906 × cxp 5661 ran crn 5664 –onto→wfo 6538 ‘cfv 6540 (class class class)co 7419 Basecbs 17293 ↾s cress 17314 +𝑓cplusf 18719 Grpcgrp 19046 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7742 ax-cnex 11173 ax-1cn 11175 ax-addcl 11177 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-ov 7422 df-oprab 7423 df-mpo 7424 df-om 7869 df-1st 7992 df-2nd 7993 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-nn 12251 df-sets 17248 df-slot 17266 df-ndx 17278 df-base 17294 df-ress 17315 df-plusf 18721 df-mgm 18722 df-sgrp 18811 df-mnd 18827 df-grp 19049 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |