Theorem subrngrng 20660

Description: A subring is a non-unital ring. (Contributed by AV, 14-Feb-2025.)

Hypothesis

Ref	Expression
subrngrng.1	⊢ 𝑆 = (𝑅 ↾s 𝐴)

Assertion

Ref	Expression
subrngrng	⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑆 ∈ Rng)

Proof of Theorem subrngrng

Step	Hyp	Ref	Expression
1		simp2 1154	. 2 ⊢ ((𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ (Base‘𝑅)) → (𝑅 ↾s 𝐴) ∈ Rng)
2		eqid 2762	. . 3 ⊢ (Base‘𝑅) = (Base‘𝑅)
3	2	issubrng 20657	. 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ (Base‘𝑅)))
4		subrngrng.1	. . 3 ⊢ 𝑆 = (𝑅 ↾s 𝐴)
5	4	eleq1i 2853	. 2 ⊢ (𝑆 ∈ Rng ↔ (𝑅 ↾s 𝐴) ∈ Rng)
6	1, 3, 5	3imtr4i 295	1 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑆 ∈ Rng)

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142   ⊆ wss 3904  ‘cfv 6536  (class class class)co 7412  Basecbs 17275   ↾_s cress 17296  Rngcrng 20236  SubRngcsubrng 20655

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fv 6544  df-ov 7415  df-subrng 20656

This theorem is used by:  subrngsubg  20662  subrngmcl  20667  subsubrng  20673  pzriprnglem7  21648