| 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 2229 | . . 3 ⊢ (Base‘(𝐺 ↾s 𝑆)) = (Base‘(𝐺 ↾s 𝑆)) | |
| 2 | eqid 2229 | . . 3 ⊢ (+g‘(𝐺 ↾s 𝑆)) = (+g‘(𝐺 ↾s 𝑆)) | |
| 3 | eqid 2229 | . . . . 5 ⊢ (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆) | |
| 4 | 3 | subggrp 13735 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) ∈ Grp) |
| 5 | 4 | 3ad2ant1 1042 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝐺 ↾s 𝑆) ∈ Grp) |
| 6 | simp2 1022 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 7 | 3 | subgbas 13736 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
| 8 | 7 | 3ad2ant1 1042 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
| 9 | 6, 8 | eleqtrd 2308 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 10 | simp3 1023 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ 𝑆) | |
| 11 | 10, 8 | eleqtrd 2308 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 12 | 1, 2, 5, 9, 11 | grpcld 13568 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋(+g‘(𝐺 ↾s 𝑆))𝑌) ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 13 | eqidd 2230 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆)) | |
| 14 | subgcl.p | . . . . . 6 ⊢ + = (+g‘𝐺) | |
| 15 | 14 | a1i 9 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → + = (+g‘𝐺)) |
| 16 | id 19 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 17 | subgrcl 13737 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 18 | 13, 15, 16, 17 | ressplusgd 13183 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → + = (+g‘(𝐺 ↾s 𝑆))) |
| 19 | 18 | 3ad2ant1 1042 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → + = (+g‘(𝐺 ↾s 𝑆))) |
| 20 | 19 | oveqd 6027 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) = (𝑋(+g‘(𝐺 ↾s 𝑆))𝑌)) |
| 21 | 12, 20, 8 | 3eltr4d 2313 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ‘cfv 5321 (class class class)co 6010 Basecbs 13053 ↾s cress 13054 +gcplusg 13131 Grpcgrp 13554 SubGrpcsubg 13725 |
| 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 617 ax-in2 618 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-13 2202 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4259 ax-pr 4294 ax-un 4525 ax-setind 4630 ax-cnex 8106 ax-resscn 8107 ax-1cn 8108 ax-1re 8109 ax-icn 8110 ax-addcl 8111 ax-addrcl 8112 ax-mulcl 8113 ax-addcom 8115 ax-addass 8117 ax-i2m1 8120 ax-0lt1 8121 ax-0id 8123 ax-rnegex 8124 ax-pre-ltirr 8127 ax-pre-ltadd 8131 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-fal 1401 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ne 2401 df-nel 2496 df-ral 2513 df-rex 2514 df-rab 2517 df-v 2801 df-sbc 3029 df-csb 3125 df-dif 3199 df-un 3201 df-in 3203 df-ss 3210 df-nul 3492 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3889 df-int 3924 df-br 4084 df-opab 4146 df-mpt 4147 df-id 4385 df-xp 4726 df-rel 4727 df-cnv 4728 df-co 4729 df-dm 4730 df-rn 4731 df-res 4732 df-ima 4733 df-iota 5281 df-fun 5323 df-fn 5324 df-fv 5329 df-ov 6013 df-oprab 6014 df-mpo 6015 df-pnf 8199 df-mnf 8200 df-ltxr 8202 df-inn 9127 df-2 9185 df-ndx 13056 df-slot 13057 df-base 13059 df-sets 13060 df-iress 13061 df-plusg 13144 df-mgm 13410 df-sgrp 13456 df-mnd 13471 df-grp 13557 df-subg 13728 |
| This theorem is referenced by: subgsubcl 13743 subgmulgcl 13745 issubg2m 13747 subgintm 13756 ssnmz 13769 eqger 13782 eqgcpbl 13786 resghm 13818 ghmpreima 13824 subrngacl 14193 subrgacl 14217 islss4 14367 dflidl2rng 14466 |
| Copyright terms: Public domain | W3C validator |