| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subrngrng | Structured version Visualization version GIF version | ||
| Description: A subring is a non-unital ring. (Contributed by AV, 14-Feb-2025.) |
| Ref | Expression |
|---|---|
| subrngrng.1 | ⊢ 𝑆 = (𝑅 ↾s 𝐴) |
| Ref | Expression |
|---|---|
| subrngrng | ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑆 ∈ Rng) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp2 1151 | . 2 ⊢ ((𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ (Base‘𝑅)) → (𝑅 ↾s 𝐴) ∈ Rng) | |
| 2 | eqid 2764 | . . 3 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 3 | 2 | issubrng 20599 | . 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ (Base‘𝑅))) |
| 4 | subrngrng.1 | . . 3 ⊢ 𝑆 = (𝑅 ↾s 𝐴) | |
| 5 | 4 | eleq1i 2855 | . 2 ⊢ (𝑆 ∈ Rng ↔ (𝑅 ↾s 𝐴) ∈ Rng) |
| 6 | 1, 3, 5 | 3imtr4i 294 | 1 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑆 ∈ Rng) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1099 = wceq 1562 ∈ wcel 2144 ⊆ wss 3906 ‘cfv 6523 (class class class)co 7398 Basecbs 17247 ↾s cress 17268 Rngcrng 20200 SubRngcsubrng 20597 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2214 ax-ext 2736 ax-sep 5248 ax-nul 5258 ax-pow 5324 ax-pr 5392 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1565 df-fal 1575 df-ex 1802 df-nf 1806 df-sb 2093 df-mo 2568 df-eu 2598 df-clab 2743 df-cleq 2756 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3079 df-rex 3089 df-rab 3417 df-v 3458 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4288 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5544 df-xp 5655 df-rel 5656 df-cnv 5657 df-co 5658 df-dm 5659 df-rn 5660 df-res 5661 df-ima 5662 df-iota 6479 df-fun 6525 df-fv 6531 df-ov 7401 df-subrng 20598 |
| This theorem is referenced by: subrngsubg 20604 subrngmcl 20609 subsubrng 20615 pzriprnglem7 21541 |
| Copyright terms: Public domain | W3C validator |