![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > subrngmcl | GIF version |
Description: A subgroup is closed under multiplication. (Contributed by Mario Carneiro, 2-Dec-2014.) Generalization of subrgmcl 13729. (Revised by AV, 14-Feb-2025.) |
Ref | Expression |
---|---|
subrngmcl.p | ⊢ · = (.r‘𝑅) |
Ref | Expression |
---|---|
subrngmcl | ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝑋 · 𝑌) ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2193 | . . . . 5 ⊢ (𝑅 ↾s 𝐴) = (𝑅 ↾s 𝐴) | |
2 | 1 | subrngrng 13698 | . . . 4 ⊢ (𝐴 ∈ (SubRng‘𝑅) → (𝑅 ↾s 𝐴) ∈ Rng) |
3 | 2 | 3ad2ant1 1020 | . . 3 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝑅 ↾s 𝐴) ∈ Rng) |
4 | simp2 1000 | . . . 4 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → 𝑋 ∈ 𝐴) | |
5 | 1 | subrngbas 13702 | . . . . 5 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 = (Base‘(𝑅 ↾s 𝐴))) |
6 | 5 | 3ad2ant1 1020 | . . . 4 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → 𝐴 = (Base‘(𝑅 ↾s 𝐴))) |
7 | 4, 6 | eleqtrd 2272 | . . 3 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → 𝑋 ∈ (Base‘(𝑅 ↾s 𝐴))) |
8 | simp3 1001 | . . . 4 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → 𝑌 ∈ 𝐴) | |
9 | 8, 6 | eleqtrd 2272 | . . 3 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → 𝑌 ∈ (Base‘(𝑅 ↾s 𝐴))) |
10 | eqid 2193 | . . . 4 ⊢ (Base‘(𝑅 ↾s 𝐴)) = (Base‘(𝑅 ↾s 𝐴)) | |
11 | eqid 2193 | . . . 4 ⊢ (.r‘(𝑅 ↾s 𝐴)) = (.r‘(𝑅 ↾s 𝐴)) | |
12 | 10, 11 | rngcl 13440 | . . 3 ⊢ (((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝑋 ∈ (Base‘(𝑅 ↾s 𝐴)) ∧ 𝑌 ∈ (Base‘(𝑅 ↾s 𝐴))) → (𝑋(.r‘(𝑅 ↾s 𝐴))𝑌) ∈ (Base‘(𝑅 ↾s 𝐴))) |
13 | 3, 7, 9, 12 | syl3anc 1249 | . 2 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝑋(.r‘(𝑅 ↾s 𝐴))𝑌) ∈ (Base‘(𝑅 ↾s 𝐴))) |
14 | subrngrcl 13699 | . . . . 5 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng) | |
15 | subrngmcl.p | . . . . . 6 ⊢ · = (.r‘𝑅) | |
16 | 1, 15 | ressmulrg 12762 | . . . . 5 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑅 ∈ Rng) → · = (.r‘(𝑅 ↾s 𝐴))) |
17 | 14, 16 | mpdan 421 | . . . 4 ⊢ (𝐴 ∈ (SubRng‘𝑅) → · = (.r‘(𝑅 ↾s 𝐴))) |
18 | 17 | 3ad2ant1 1020 | . . 3 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → · = (.r‘(𝑅 ↾s 𝐴))) |
19 | 18 | oveqd 5935 | . 2 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝑋 · 𝑌) = (𝑋(.r‘(𝑅 ↾s 𝐴))𝑌)) |
20 | 13, 19, 6 | 3eltr4d 2277 | 1 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑋 ∈ 𝐴 ∧ 𝑌 ∈ 𝐴) → (𝑋 · 𝑌) ∈ 𝐴) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ w3a 980 = wceq 1364 ∈ wcel 2164 ‘cfv 5254 (class class class)co 5918 Basecbs 12618 ↾s cress 12619 .rcmulr 12696 Rngcrng 13428 SubRngcsubrng 13693 |
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 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-bndl 1520 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 ax-13 2166 ax-14 2167 ax-ext 2175 ax-sep 4147 ax-pow 4203 ax-pr 4238 ax-un 4464 ax-setind 4569 ax-cnex 7963 ax-resscn 7964 ax-1cn 7965 ax-1re 7966 ax-icn 7967 ax-addcl 7968 ax-addrcl 7969 ax-mulcl 7970 ax-addcom 7972 ax-addass 7974 ax-i2m1 7977 ax-0lt1 7978 ax-0id 7980 ax-rnegex 7981 ax-pre-ltirr 7984 ax-pre-lttrn 7986 ax-pre-ltadd 7988 |
This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 df-eu 2045 df-mo 2046 df-clab 2180 df-cleq 2186 df-clel 2189 df-nfc 2325 df-ne 2365 df-nel 2460 df-ral 2477 df-rex 2478 df-rab 2481 df-v 2762 df-sbc 2986 df-csb 3081 df-dif 3155 df-un 3157 df-in 3159 df-ss 3166 df-nul 3447 df-pw 3603 df-sn 3624 df-pr 3625 df-op 3627 df-uni 3836 df-int 3871 df-br 4030 df-opab 4091 df-mpt 4092 df-id 4324 df-xp 4665 df-rel 4666 df-cnv 4667 df-co 4668 df-dm 4669 df-rn 4670 df-res 4671 df-ima 4672 df-iota 5215 df-fun 5256 df-fn 5257 df-fv 5262 df-ov 5921 df-oprab 5922 df-mpo 5923 df-pnf 8056 df-mnf 8057 df-ltxr 8059 df-inn 8983 df-2 9041 df-3 9042 df-ndx 12621 df-slot 12622 df-base 12624 df-sets 12625 df-iress 12626 df-plusg 12708 df-mulr 12709 df-mgm 12939 df-sgrp 12985 df-subg 13240 df-abl 13357 df-mgp 13417 df-rng 13429 df-subrng 13694 |
This theorem is referenced by: issubrng2 13706 subrngintm 13708 |
Copyright terms: Public domain | W3C validator |