| 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 2760 | . . . . 5 ⊢ (Base‘𝐻) = (Base‘𝐻) | |
| 2 | resgrpplusfrn.o | . . . . 5 ⊢ 𝐹 = (+𝑓‘𝐻) | |
| 3 | 1, 2 | grpplusfo 19076 | . . . 4 ⊢ (𝐻 ∈ Grp → 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻)) |
| 4 | 3 | adantr 486 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻)) |
| 5 | eqidd 2761 | . . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹 = 𝐹) | |
| 6 | resgrpplusfrn.h | . . . . . . 7 ⊢ 𝐻 = (𝐺 ↾s 𝑆) | |
| 7 | resgrpplusfrn.b | . . . . . . 7 ⊢ 𝐵 = (Base‘𝐺) | |
| 8 | 6, 7 | ressbas2 17333 | . . . . . 6 ⊢ (𝑆 ⊆ 𝐵 → 𝑆 = (Base‘𝐻)) |
| 9 | 8 | adantl 487 | . . . . 5 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝑆 = (Base‘𝐻)) |
| 10 | 9 | sqxpeqd 5687 | . . . 4 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → (𝑆 × 𝑆) = ((Base‘𝐻) × (Base‘𝐻))) |
| 11 | 5, 10, 9 | foeq123d 6811 | . . 3 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → (𝐹:(𝑆 × 𝑆)–onto→𝑆 ↔ 𝐹:((Base‘𝐻) × (Base‘𝐻))–onto→(Base‘𝐻))) |
| 12 | 4, 11 | mpbird 260 | . 2 ⊢ ((𝐻 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → 𝐹:(𝑆 × 𝑆)–onto→𝑆) |
| 13 | forn 6793 | . . 3 ⊢ (𝐹:(𝑆 × 𝑆)–onto→𝑆 → ran 𝐹 = 𝑆) | |
| 14 | 13 | eqcomd 2766 | . 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 2145 ⊆ wss 3899 × cxp 5653 ran crn 5656 –onto→wfo 6531 ‘cfv 6533 (class class class)co 7414 Basecbs 17304 ↾s cress 17325 +𝑓cplusf 18730 Grpcgrp 19060 |
| 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 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-1cn 11185 ax-addcl 11187 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-nn 12261 df-sets 17259 df-slot 17277 df-ndx 17289 df-base 17305 df-ress 17326 df-plusf 18732 df-mgm 18733 df-sgrp 18824 df-mnd 18840 df-grp 19063 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |