| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > subrngringnsg | GIF version | ||
| Description: A subring is a normal subgroup. (Contributed by AV, 25-Feb-2025.) |
| Ref | Expression |
|---|---|
| subrngringnsg | ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ∈ (NrmSGrp‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subrngsubg 14341 | . 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ∈ (SubGrp‘𝑅)) | |
| 2 | subrngrcl 14340 | . . . . . . . . 9 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng) | |
| 3 | rngabl 14071 | . . . . . . . . 9 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Abel) | |
| 4 | 2, 3 | syl 14 | . . . . . . . 8 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Abel) |
| 5 | 4 | 3anim1i 1212 | . . . . . . 7 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑅 ∈ Abel ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) |
| 6 | 5 | 3expb 1231 | . . . . . 6 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑅 ∈ Abel ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) |
| 7 | eqid 2232 | . . . . . . 7 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 8 | eqid 2232 | . . . . . . 7 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 9 | 7, 8 | ablcom 14012 | . . . . . 6 ⊢ ((𝑅 ∈ Abel ∧ 𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅)) → (𝑥(+g‘𝑅)𝑦) = (𝑦(+g‘𝑅)𝑥)) |
| 10 | 6, 9 | syl 14 | . . . . 5 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → (𝑥(+g‘𝑅)𝑦) = (𝑦(+g‘𝑅)𝑥)) |
| 11 | 10 | eleq1d 2301 | . . . 4 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → ((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 ↔ (𝑦(+g‘𝑅)𝑥) ∈ 𝐴)) |
| 12 | 11 | biimpd 144 | . . 3 ⊢ ((𝐴 ∈ (SubRng‘𝑅) ∧ (𝑥 ∈ (Base‘𝑅) ∧ 𝑦 ∈ (Base‘𝑅))) → ((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 → (𝑦(+g‘𝑅)𝑥) ∈ 𝐴)) |
| 13 | 12 | ralrimivva 2624 | . 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) → ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 → (𝑦(+g‘𝑅)𝑥) ∈ 𝐴)) |
| 14 | 7, 8 | isnsg2 13912 | . 2 ⊢ (𝐴 ∈ (NrmSGrp‘𝑅) ↔ (𝐴 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ (Base‘𝑅)∀𝑦 ∈ (Base‘𝑅)((𝑥(+g‘𝑅)𝑦) ∈ 𝐴 → (𝑦(+g‘𝑅)𝑥) ∈ 𝐴))) |
| 15 | 1, 13, 14 | sylanbrc 417 | 1 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ∈ (NrmSGrp‘𝑅)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 ∀wral 2520 ‘cfv 5351 (class class class)co 6049 Basecbs 13204 +gcplusg 13282 SubGrpcsubg 13876 NrmSGrpcnsg 13877 Abelcabl 13994 Rngcrng 14068 SubRngcsubrng 14334 |
| 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-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-pow 4286 ax-pr 4321 ax-un 4553 ax-cnex 8217 ax-resscn 8218 ax-1re 8220 ax-addrcl 8223 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-rab 2529 df-v 2814 df-sbc 3042 df-csb 3138 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-int 3949 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-rn 4759 df-res 4760 df-ima 4761 df-iota 5311 df-fun 5353 df-fn 5354 df-fv 5359 df-ov 6052 df-inn 9237 df-2 9295 df-3 9296 df-ndx 13207 df-slot 13208 df-base 13210 df-plusg 13295 df-mulr 13296 df-subg 13879 df-nsg 13880 df-cmn 13995 df-abl 13996 df-rng 14069 df-subrng 14335 |
| This theorem is referenced by: rng2idlnsg 14658 rng2idlsubgnsg 14661 |
| Copyright terms: Public domain | W3C validator |