| 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 2238 | . . 3 ⊢ (Base‘(𝐺 ↾s 𝑆)) = (Base‘(𝐺 ↾s 𝑆)) | |
| 2 | eqid 2238 | . . 3 ⊢ (+g‘(𝐺 ↾s 𝑆)) = (+g‘(𝐺 ↾s 𝑆)) | |
| 3 | eqid 2238 | . . . . 5 ⊢ (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆) | |
| 4 | 3 | subggrp 14040 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) ∈ Grp) |
| 5 | 4 | 3ad2ant1 1049 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝐺 ↾s 𝑆) ∈ Grp) |
| 6 | simp2 1029 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 7 | 3 | subgbas 14041 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
| 8 | 7 | 3ad2ant1 1049 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑆 = (Base‘(𝐺 ↾s 𝑆))) |
| 9 | 6, 8 | eleqtrd 2317 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 10 | simp3 1030 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ 𝑆) | |
| 11 | 10, 8 | eleqtrd 2317 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 12 | 1, 2, 5, 9, 11 | grpcld 13879 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋(+g‘(𝐺 ↾s 𝑆))𝑌) ∈ (Base‘(𝐺 ↾s 𝑆))) |
| 13 | eqidd 2239 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → (𝐺 ↾s 𝑆) = (𝐺 ↾s 𝑆)) | |
| 14 | subgcl.p | . . . . . 6 ⊢ + = (+g‘𝐺) | |
| 15 | 14 | a1i 9 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → + = (+g‘𝐺)) |
| 16 | id 19 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ∈ (SubGrp‘𝐺)) | |
| 17 | subgrcl 14042 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝐺 ∈ Grp) | |
| 18 | 13, 15, 16, 17 | ressplusgd 13543 | . . . 4 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → + = (+g‘(𝐺 ↾s 𝑆))) |
| 19 | 18 | 3ad2ant1 1049 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → + = (+g‘(𝐺 ↾s 𝑆))) |
| 20 | 19 | oveqd 6105 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) = (𝑋(+g‘(𝐺 ↾s 𝑆))𝑌)) |
| 21 | 12, 20, 8 | 3eltr4d 2322 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 + 𝑌) ∈ 𝑆) |
| Colors of variables: wff set class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1009 = wceq 1402 ∈ wcel 2209 ‘cfv 5380 (class class class)co 6088 Basecbs 13411 ↾s cress 13412 +gcplusg 13491 Grpcgrp 13865 SubGrpcsubg 14030 |
| 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-sep 4251 ax-pow 4313 ax-pr 4348 ax-un 4580 ax-setind 4686 ax-cnex 8277 ax-resscn 8278 ax-1cn 8279 ax-1re 8280 ax-icn 8281 ax-addcl 8282 ax-addrcl 8283 ax-mulcl 8284 ax-addcom 8286 ax-addass 8288 ax-i2m1 8291 ax-0lt1 8292 ax-0id 8294 ax-rnegex 8295 ax-pre-ltirr 8298 ax-pre-ltadd 8302 |
| 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-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-br 4132 df-opab 4194 df-mpt 4195 df-id 4440 df-xp 4782 df-rel 4783 df-cnv 4784 df-co 4785 df-dm 4786 df-rn 4787 df-res 4788 df-ima 4789 df-iota 5340 df-fun 5382 df-fn 5383 df-fv 5388 df-ov 6091 df-oprab 6092 df-mpo 6093 df-pnf 8369 df-mnf 8370 df-ltxr 8372 df-inn 9315 df-2 9373 df-ndx 13414 df-slot 13415 df-base 13417 df-sets 13418 df-iress 13419 df-plusg 13504 df-mgm 13736 df-sgrp 13777 df-mnd 13790 df-grp 13868 df-subg 14033 |
| This theorem is used by: subgsubcl 14048 subgmulgcl 14050 issubg2m 14052 subgintm 14061 ssnmz 14074 eqger 14087 eqgcpbl 14091 resghm 14123 ghmpreima 14129 subrngacl 14626 subrgacl 14650 islss4 14829 dflidl2rng 14928 |
| Copyright terms: Public domain | W3C validator |