| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > resgrpisgrp | GIF version | ||
| Description: If the base set of a group is contained in the base set of another group, and the group operation of the group is the restriction of the group operation of the other group to its base set, then the other group restricted to the base set of the group is a group. (Contributed by AV, 14-Mar-2019.) |
| Ref | Expression |
|---|---|
| grpissubg.b | ⊢ 𝐵 = (Base‘𝐺) |
| grpissubg.s | ⊢ 𝑆 = (Base‘𝐻) |
| Ref | Expression |
|---|---|
| resgrpisgrp | ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) → ((𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆))) → (𝐺 ↾s 𝑆) ∈ Grp)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | grpissubg.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐺) | |
| 2 | grpissubg.s | . . . . 5 ⊢ 𝑆 = (Base‘𝐻) | |
| 3 | 1, 2 | grpissubg 13530 | . . . 4 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) → ((𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆))) → 𝑆 ∈ (SubGrp‘𝐺))) |
| 4 | 3 | imp 124 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → 𝑆 ∈ (SubGrp‘𝐺)) |
| 5 | ibar 301 | . . . . . 6 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) → ((𝐺 ↾s 𝑆) ∈ Grp ↔ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) ∧ (𝐺 ↾s 𝑆) ∈ Grp))) | |
| 6 | 5 | ad2ant2r 509 | . . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → ((𝐺 ↾s 𝑆) ∈ Grp ↔ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) ∧ (𝐺 ↾s 𝑆) ∈ Grp))) |
| 7 | df-3an 983 | . . . . 5 ⊢ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵 ∧ (𝐺 ↾s 𝑆) ∈ Grp) ↔ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) ∧ (𝐺 ↾s 𝑆) ∈ Grp)) | |
| 8 | 6, 7 | bitr4di 198 | . . . 4 ⊢ (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → ((𝐺 ↾s 𝑆) ∈ Grp ↔ (𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵 ∧ (𝐺 ↾s 𝑆) ∈ Grp))) |
| 9 | 1 | issubg 13509 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) ↔ (𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵 ∧ (𝐺 ↾s 𝑆) ∈ Grp)) |
| 10 | 8, 9 | bitr4di 198 | . . 3 ⊢ (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → ((𝐺 ↾s 𝑆) ∈ Grp ↔ 𝑆 ∈ (SubGrp‘𝐺))) |
| 11 | 4, 10 | mpbird 167 | . 2 ⊢ (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → (𝐺 ↾s 𝑆) ∈ Grp) |
| 12 | 11 | ex 115 | 1 ⊢ ((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) → ((𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆))) → (𝐺 ↾s 𝑆) ∈ Grp)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 981 = wceq 1373 ∈ wcel 2176 ⊆ wss 3166 × cxp 4673 ↾ cres 4677 ‘cfv 5271 (class class class)co 5944 Basecbs 12832 ↾s cress 12833 +gcplusg 12909 Grpcgrp 13332 SubGrpcsubg 13503 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-coll 4159 ax-sep 4162 ax-pow 4218 ax-pr 4253 ax-un 4480 ax-setind 4585 ax-cnex 8016 ax-resscn 8017 ax-1cn 8018 ax-1re 8019 ax-icn 8020 ax-addcl 8021 ax-addrcl 8022 ax-mulcl 8023 ax-addcom 8025 ax-addass 8027 ax-i2m1 8030 ax-0lt1 8031 ax-0id 8033 ax-rnegex 8034 ax-pre-ltirr 8037 ax-pre-ltadd 8041 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-nel 2472 df-ral 2489 df-rex 2490 df-reu 2491 df-rmo 2492 df-rab 2493 df-v 2774 df-sbc 2999 df-csb 3094 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-nul 3461 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-int 3886 df-iun 3929 df-br 4045 df-opab 4106 df-mpt 4107 df-id 4340 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-rn 4686 df-res 4687 df-ima 4688 df-iota 5232 df-fun 5273 df-fn 5274 df-f 5275 df-f1 5276 df-fo 5277 df-f1o 5278 df-fv 5279 df-riota 5899 df-ov 5947 df-oprab 5948 df-mpo 5949 df-pnf 8109 df-mnf 8110 df-ltxr 8112 df-inn 9037 df-2 9095 df-ndx 12835 df-slot 12836 df-base 12838 df-sets 12839 df-iress 12840 df-plusg 12922 df-0g 13090 df-mgm 13188 df-sgrp 13234 df-mnd 13249 df-grp 13335 df-minusg 13336 df-subg 13506 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |