Theorem subrngss 20508

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

Hypothesis

Ref	Expression
subrngss.1	⊢ 𝐵 = (Base‘𝑅)

Assertion

Ref	Expression
subrngss	⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ⊆ 𝐵)

Proof of Theorem subrngss

Step	Hyp	Ref	Expression
1		subrngss.1	. . 3 ⊢ 𝐵 = (Base‘𝑅)
2	1	issubrng 20507	. 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵))
3	2	simp3bi 1147	1 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ⊆ 𝐵)

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2108   ⊆ wss 3926  ‘cfv 6531  (class class class)co 7405  Basecbs 17228   ↾_s cress 17251  Rngcrng 20112  SubRngcsubrng 20505

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rab 3416  df-v 3461  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fv 6539  df-ov 7408  df-subrng 20506

This theorem is referenced by:  subrngsubg  20512  subrngmre  20522  subsubrng  20523  rhmimasubrnglem  20525  rhmimasubrng  20526