| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > submmulgcl | GIF version | ||
| Description: Closure of the group multiple (exponentiation) operation in a submonoid. (Contributed by Mario Carneiro, 13-Jan-2015.) |
| Ref | Expression |
|---|---|
| submmulgcl.t | ⊢ ∙ = (.g‘𝐺) |
| Ref | Expression |
|---|---|
| submmulgcl | ⊢ ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝑆) → (𝑁 ∙ 𝑋) ∈ 𝑆) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2229 | . 2 ⊢ (Base‘𝐺) = (Base‘𝐺) | |
| 2 | submmulgcl.t | . 2 ⊢ ∙ = (.g‘𝐺) | |
| 3 | eqid 2229 | . 2 ⊢ (+g‘𝐺) = (+g‘𝐺) | |
| 4 | submrcl 13544 | . 2 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝐺 ∈ Mnd) | |
| 5 | 1 | submss 13549 | . 2 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → 𝑆 ⊆ (Base‘𝐺)) |
| 6 | 3 | submcl 13552 | . 2 ⊢ ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆) → (𝑥(+g‘𝐺)𝑦) ∈ 𝑆) |
| 7 | eqid 2229 | . 2 ⊢ (0g‘𝐺) = (0g‘𝐺) | |
| 8 | 7 | subm0cl 13551 | . 2 ⊢ (𝑆 ∈ (SubMnd‘𝐺) → (0g‘𝐺) ∈ 𝑆) |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | mulgnn0subcl 13712 | 1 ⊢ ((𝑆 ∈ (SubMnd‘𝐺) ∧ 𝑁 ∈ ℕ0 ∧ 𝑋 ∈ 𝑆) → (𝑁 ∙ 𝑋) ∈ 𝑆) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ‘cfv 5324 (class class class)co 6013 ℕ0cn0 9392 Basecbs 13072 +gcplusg 13150 0gc0g 13329 Mndcmnd 13489 SubMndcsubmnd 13531 .gcmg 13696 |
| 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-coll 4202 ax-sep 4205 ax-nul 4213 ax-pow 4262 ax-pr 4297 ax-un 4528 ax-setind 4633 ax-iinf 4684 ax-cnex 8113 ax-resscn 8114 ax-1cn 8115 ax-1re 8116 ax-icn 8117 ax-addcl 8118 ax-addrcl 8119 ax-mulcl 8120 ax-addcom 8122 ax-addass 8124 ax-distr 8126 ax-i2m1 8127 ax-0lt1 8128 ax-0id 8130 ax-rnegex 8131 ax-cnre 8133 ax-pre-ltirr 8134 ax-pre-ltwlin 8135 ax-pre-lttrn 8136 ax-pre-ltadd 8138 |
| This theorem depends on definitions: df-bi 117 df-dc 840 df-3or 1003 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-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-dif 3200 df-un 3202 df-in 3204 df-ss 3211 df-nul 3493 df-if 3604 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-int 3927 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-tr 4186 df-id 4388 df-iord 4461 df-on 4463 df-ilim 4464 df-suc 4466 df-iom 4687 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-riota 5966 df-ov 6016 df-oprab 6017 df-mpo 6018 df-1st 6298 df-2nd 6299 df-recs 6466 df-frec 6552 df-pnf 8206 df-mnf 8207 df-xr 8208 df-ltxr 8209 df-le 8210 df-sub 8342 df-neg 8343 df-inn 9134 df-2 9192 df-n0 9393 df-z 9470 df-uz 9746 df-seqfrec 10700 df-ndx 13075 df-slot 13076 df-base 13078 df-plusg 13163 df-0g 13331 df-submnd 13533 df-minusg 13577 df-mulg 13697 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |