Theorem subrngss 20445

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 20444	. 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵))
3	2	simp3bi 1144	1 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝐴 ⊆ 𝐵)

Syntax hints:   → wi 4   = wceq 1533   ∈ wcel 2098   ⊆ wss 3943  ‘cfv 6536  (class class class)co 7404  Basecbs 17150   ↾_s cress 17179  Rngcrng 20054  SubRngcsubrng 20442

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6488  df-fun 6538  df-fv 6544  df-ov 7407  df-subrng 20443

This theorem is referenced by:  subrngsubg  20449  subrngmre  20459  subsubrng  20460  rhmimasubrnglem  20462  rhmimasubrng  20463