| 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 13997 | . . . 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 513 | . . . . 5 ⊢ (((𝐺 ∈ Grp ∧ 𝐻 ∈ Grp) ∧ (𝑆 ⊆ 𝐵 ∧ (+g‘𝐻) = ((+g‘𝐺) ↾ (𝑆 × 𝑆)))) → ((𝐺 ↾s 𝑆) ∈ Grp ↔ ((𝐺 ∈ Grp ∧ 𝑆 ⊆ 𝐵) ∧ (𝐺 ↾s 𝑆) ∈ Grp))) |
| 7 | df-3an 1011 | . . . . 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 13976 | . . . 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 |
| This proof depends on syntax axioms: → wi 4 ∧ wa 104 ↔ wb 105 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ⊆ wss 3220 × cxp 4772 ↾ cres 4776 ‘cfv 5377 (class class class)co 6085 Basecbs 13352 ↾s cress 13353 +gcplusg 13431 Grpcgrp 13805 SubGrpcsubg 13970 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 623 ax-in2 624 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-coll 4246 ax-sep 4249 ax-pow 4311 ax-pr 4346 ax-un 4578 ax-setind 4684 ax-cnex 8270 ax-resscn 8271 ax-1cn 8272 ax-1re 8273 ax-icn 8274 ax-addcl 8275 ax-addrcl 8276 ax-mulcl 8277 ax-addcom 8279 ax-addass 8281 ax-i2m1 8284 ax-0lt1 8285 ax-0id 8287 ax-rnegex 8288 ax-pre-ltirr 8291 ax-pre-ltadd 8295 |
| This proof depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-fal 1408 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ne 2421 df-nel 2516 df-ral 2533 df-rex 2534 df-reu 2535 df-rmo 2536 df-rab 2537 df-v 2823 df-sbc 3052 df-csb 3148 df-dif 3222 df-un 3224 df-in 3226 df-ss 3233 df-nul 3521 df-pw 3690 df-sn 3715 df-pr 3716 df-op 3718 df-uni 3936 df-int 3971 df-iun 4014 df-br 4131 df-opab 4193 df-mpt 4194 df-id 4438 df-xp 4780 df-rel 4781 df-cnv 4782 df-co 4783 df-dm 4784 df-rn 4785 df-res 4786 df-ima 4787 df-iota 5337 df-fun 5379 df-fn 5380 df-f 5381 df-f1 5382 df-fo 5383 df-f1o 5384 df-fv 5385 df-riota 6038 df-ov 6088 df-oprab 6089 df-mpo 6090 df-pnf 8362 df-mnf 8363 df-ltxr 8365 df-inn 9305 df-2 9363 df-ndx 13355 df-slot 13356 df-base 13358 df-sets 13359 df-iress 13360 df-plusg 13444 df-0g 13612 df-mgm 13676 df-sgrp 13717 df-mnd 13730 df-grp 13808 df-minusg 13809 df-subg 13973 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |