| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subgcl | GIF version | ||
| Description: A subgroup is closed under group operation. (Contributed by Mario Carneiro, 2-Dec-2014.) |
| Ref | Expression |
|---|---|
| subgcl.p | ⊢ + = (+g‘𝐺) |
| Ref | Expression |
|---|---|
| subgcl | ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2196 | . . 3 ⊢ (Base‘(𝐺 ↾s 𝑆)) = (Base‘(𝐺 ↾s 𝑆)) | |
| 2 | eqid 2196 | . . 3 ⊢ (+g‘(𝐺 ↾s 𝑆)) = (+g‘(𝐺 ↾s 𝑆)) | |
| 3 | eqid 2196 | . . . . 5 ⊢ (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆) | |
| 4 | 3 | subggrp 13383 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) ∈ Grp) |
| 5 | 4 | 3ad2ant1 1020 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝐺 ↾s 𝑆) ∈ Grp) |
| 6 | simp2 1000 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 7 | 3 | subgbas 13384 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
| 8 | 7 | 3ad2ant1 1020 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
| 9 | 6, 8 | eleqtrd 2275 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 10 | simp3 1001 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ 𝑆) | |
| 11 | 10, 8 | eleqtrd 2275 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 12 | 1, 2, 5, 9, 11 | grpcld 13216 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋(+g‘(𝐺 ↾s 𝑆))𝑌) ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 13 | eqidd 2197 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆)) | |
| 14 | subgcl.p | . . . . . 6 ⊢ + = (+g‘𝐺) | |
| 15 | 14 | a1i 9 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → + = (+g‘𝐺)) |
| 16 | id 19 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 17 | subgrcl 13385 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 18 | 13, 15, 16, 17 | ressplusgd 12831 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → + = (+g‘(𝐺 ↾s 𝑆))) |
| 19 | 18 | 3ad2ant1 1020 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → + = (+g‘(𝐺 ↾s 𝑆))) |
| 20 | 19 | oveqd 5942 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) = (𝑋(+g‘(𝐺 ↾s 𝑆))𝑌)) |
| 21 | 12, 20, 8 | 3eltr4d 2280 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 980 = wceq 1364 ∈ wcel 2167 ‘cfv 5259 (class class class)co 5925 Basecbs 12703 ↾s cress 12704 +gcplusg 12780 Grpcgrp 13202 SubGrpcsubg 13373 |
| 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 710 ax-5 1461 ax-7 1462 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-8 1518 ax-10 1519 ax-11 1520 ax-i12 1521 ax-bndl 1523 ax-4 1524 ax-17 1540 ax-i9 1544 ax-ial 1548 ax-i5r 1549 ax-13 2169 ax-14 2170 ax-ext 2178 ax-sep 4152 ax-pow 4208 ax-pr 4243 ax-un 4469 ax-setind 4574 ax-cnex 7987 ax-resscn 7988 ax-1cn 7989 ax-1re 7990 ax-icn 7991 ax-addcl 7992 ax-addrcl 7993 ax-mulcl 7994 ax-addcom 7996 ax-addass 7998 ax-i2m1 8001 ax-0lt1 8002 ax-0id 8004 ax-rnegex 8005 ax-pre-ltirr 8008 ax-pre-ltadd 8012 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1475 df-sb 1777 df-eu 2048 df-mo 2049 df-clab 2183 df-cleq 2189 df-clel 2192 df-nfc 2328 df-ne 2368 df-nel 2463 df-ral 2480 df-rex 2481 df-rab 2484 df-v 2765 df-sbc 2990 df-csb 3085 df-dif 3159 df-un 3161 df-in 3163 df-ss 3170 df-nul 3452 df-pw 3608 df-sn 3629 df-pr 3630 df-op 3632 df-uni 3841 df-int 3876 df-br 4035 df-opab 4096 df-mpt 4097 df-id 4329 df-xp 4670 df-rel 4671 df-cnv 4672 df-co 4673 df-dm 4674 df-rn 4675 df-res 4676 df-ima 4677 df-iota 5220 df-fun 5261 df-fn 5262 df-fv 5267 df-ov 5928 df-oprab 5929 df-mpo 5930 df-pnf 8080 df-mnf 8081 df-ltxr 8083 df-inn 9008 df-2 9066 df-ndx 12706 df-slot 12707 df-base 12709 df-sets 12710 df-iress 12711 df-plusg 12793 df-mgm 13058 df-sgrp 13104 df-mnd 13119 df-grp 13205 df-subg 13376 |
| This theorem is referenced by: subgsubcl 13391 subgmulgcl 13393 issubg2m 13395 subgintm 13404 ssnmz 13417 eqger 13430 eqgcpbl 13434 resghm 13466 ghmpreima 13472 subrngacl 13840 subrgacl 13864 islss4 14014 dflidl2rng 14113 |
| Copyright terms: Public domain | W3C validator |