| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subgsubcl | GIF version | ||
| Description: A subgroup is closed under group subtraction. (Contributed by Mario Carneiro, 18-Jan-2015.) |
| Ref | Expression |
|---|---|
| subgsubcl.p | ⊢ − = (-g‘𝐺) |
| Ref | Expression |
|---|---|
| subgsubcl | ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) ∈ 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2206 | . . . . . 6 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 2 | 1 | subgss 13554 | . . . . 5 ⊢ (𝑆 ∈ (SubGrp‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 3 | 2 | 3ad2ant1 1021 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑆 ⊆ (Base‘𝐺)) |
| 4 | simp2 1001 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 5 | 3, 4 | sseldd 3195 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑋 ∈ (Base‘𝐺)) |
| 6 | simp3 1002 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ 𝑆) | |
| 7 | 3, 6 | sseldd 3195 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → 𝑌 ∈ (Base‘𝐺)) |
| 8 | eqid 2206 | . . . 4 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 9 | eqid 2206 | . . . 4 ⊢ (invg‘𝐺) = (invg‘𝐺) | |
| 10 | subgsubcl.p | . . . 4 ⊢ − = (-g‘𝐺) | |
| 11 | 1, 8, 9, 10 | grpsubval 13422 | . . 3 ⊢ ((𝑋 ∈ (Base‘𝐺) ∧ 𝑌 ∈ (Base‘𝐺)) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 12 | 5, 7, 11 | syl2anc 411 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) = (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌))) |
| 13 | 9 | subginvcl 13563 | . . . 4 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑌 ∈ 𝑆) → ((invg‘𝐺)‘𝑌) ∈ 𝑆) |
| 14 | 13 | 3adant2 1019 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → ((invg‘𝐺)‘𝑌) ∈ 𝑆) |
| 15 | 8 | subgcl 13564 | . . 3 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ ((invg‘𝐺)‘𝑌) ∈ 𝑆) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) ∈ 𝑆) |
| 16 | 14, 15 | syld3an3 1295 | . 2 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋(+g‘𝐺)((invg‘𝐺)‘𝑌)) ∈ 𝑆) |
| 17 | 12, 16 | eqeltrd 2283 | 1 ⊢ ((𝑆 ∈ (SubGrp‘𝐺) ∧ 𝑋 ∈ 𝑆 ∧ 𝑌 ∈ 𝑆) → (𝑋 − 𝑌) ∈ 𝑆) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 981 = wceq 1373 ∈ wcel 2177 ⊆ wss 3167 ‘cfv 5276 (class class class)co 5951 Basecbs 12876 +gcplusg 12953 invgcminusg 13377 -gcsg 13378 SubGrpcsubg 13547 |
| 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 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-10 1529 ax-11 1530 ax-i12 1531 ax-bndl 1533 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-13 2179 ax-14 2180 ax-ext 2188 ax-coll 4163 ax-sep 4166 ax-pow 4222 ax-pr 4257 ax-un 4484 ax-setind 4589 ax-cnex 8023 ax-resscn 8024 ax-1cn 8025 ax-1re 8026 ax-icn 8027 ax-addcl 8028 ax-addrcl 8029 ax-mulcl 8030 ax-addcom 8032 ax-addass 8034 ax-i2m1 8037 ax-0lt1 8038 ax-0id 8040 ax-rnegex 8041 ax-pre-ltirr 8044 ax-pre-ltadd 8048 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1485 df-sb 1787 df-eu 2058 df-mo 2059 df-clab 2193 df-cleq 2199 df-clel 2202 df-nfc 2338 df-ne 2378 df-nel 2473 df-ral 2490 df-rex 2491 df-reu 2492 df-rmo 2493 df-rab 2494 df-v 2775 df-sbc 3000 df-csb 3095 df-dif 3169 df-un 3171 df-in 3173 df-ss 3180 df-nul 3462 df-pw 3619 df-sn 3640 df-pr 3641 df-op 3643 df-uni 3853 df-int 3888 df-iun 3931 df-br 4048 df-opab 4110 df-mpt 4111 df-id 4344 df-xp 4685 df-rel 4686 df-cnv 4687 df-co 4688 df-dm 4689 df-rn 4690 df-res 4691 df-ima 4692 df-iota 5237 df-fun 5278 df-fn 5279 df-f 5280 df-f1 5281 df-fo 5282 df-f1o 5283 df-fv 5284 df-riota 5906 df-ov 5954 df-oprab 5955 df-mpo 5956 df-1st 6233 df-2nd 6234 df-pnf 8116 df-mnf 8117 df-ltxr 8119 df-inn 9044 df-2 9102 df-ndx 12879 df-slot 12880 df-base 12882 df-sets 12883 df-iress 12884 df-plusg 12966 df-0g 13134 df-mgm 13232 df-sgrp 13278 df-mnd 13293 df-grp 13379 df-minusg 13380 df-sbg 13381 df-subg 13550 |
| This theorem is referenced by: issubg4m 13573 ssnmz 13591 lidlsubcl 14293 2idlcpblrng 14329 |
| Copyright terms: Public domain | W3C validator |