Theorem issubrng 20492

Description: The subring of non-unital ring predicate. (Contributed by AV, 14-Feb-2025.)

Hypothesis

Ref	Expression
issubrng.b	⊢ 𝐵 = (Base‘𝑅)

Assertion

Ref	Expression
issubrng	⊢ (𝐴 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵))

Proof of Theorem issubrng

Dummy variables 𝑤 𝑠 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-subrng 20491	. . 3 ⊢ SubRng = (𝑤 ∈ Rng ↦ {𝑠 ∈ 𝒫 (Base‘𝑤) ∣ (𝑤 ↾s 𝑠) ∈ Rng})
2	1	mptrcl 6959	. 2 ⊢ (𝐴 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng)
3		simp1 1137	. 2 ⊢ ((𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵) → 𝑅 ∈ Rng)
4		fveq2 6842	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5	4	pweqd 4573	. . . . . 6 ⊢ (𝑟 = 𝑅 → 𝒫 (Base‘𝑟) = 𝒫 (Base‘𝑅))
6		oveq1 7375	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (𝑟 ↾s 𝑠) = (𝑅 ↾s 𝑠))
7	6	eleq1d 2822	. . . . . 6 ⊢ (𝑟 = 𝑅 → ((𝑟 ↾s 𝑠) ∈ Rng ↔ (𝑅 ↾s 𝑠) ∈ Rng))
8	5, 7	rabeqbidv 3419	. . . . 5 ⊢ (𝑟 = 𝑅 → {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ (𝑟 ↾s 𝑠) ∈ Rng} = {𝑠 ∈ 𝒫 (Base‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ Rng})
9		df-subrng 20491	. . . . 5 ⊢ SubRng = (𝑟 ∈ Rng ↦ {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ (𝑟 ↾s 𝑠) ∈ Rng})
10		fvex 6855	. . . . . . 7 ⊢ (Base‘𝑅) ∈ V
11	10	pwex 5327	. . . . . 6 ⊢ 𝒫 (Base‘𝑅) ∈ V
12	11	rabex 5286	. . . . 5 ⊢ {𝑠 ∈ 𝒫 (Base‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ Rng} ∈ V
13	8, 9, 12	fvmpt 6949	. . . 4 ⊢ (𝑅 ∈ Rng → (SubRng‘𝑅) = {𝑠 ∈ 𝒫 (Base‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ Rng})
14	13	eleq2d 2823	. . 3 ⊢ (𝑅 ∈ Rng → (𝐴 ∈ (SubRng‘𝑅) ↔ 𝐴 ∈ {𝑠 ∈ 𝒫 (Base‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ Rng}))
15		oveq2 7376	. . . . . 6 ⊢ (𝑠 = 𝐴 → (𝑅 ↾s 𝑠) = (𝑅 ↾s 𝐴))
16	15	eleq1d 2822	. . . . 5 ⊢ (𝑠 = 𝐴 → ((𝑅 ↾s 𝑠) ∈ Rng ↔ (𝑅 ↾s 𝐴) ∈ Rng))
17	16	elrab 3648	. . . 4 ⊢ (𝐴 ∈ {𝑠 ∈ 𝒫 (Base‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ Rng} ↔ (𝐴 ∈ 𝒫 (Base‘𝑅) ∧ (𝑅 ↾s 𝐴) ∈ Rng))
18		issubrng.b	. . . . . . . . 9 ⊢ 𝐵 = (Base‘𝑅)
19	18	eqcomi 2746	. . . . . . . 8 ⊢ (Base‘𝑅) = 𝐵
20	19	sseq2i 3965	. . . . . . 7 ⊢ (𝐴 ⊆ (Base‘𝑅) ↔ 𝐴 ⊆ 𝐵)
21	20	anbi2i 624	. . . . . 6 ⊢ (((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ (Base‘𝑅)) ↔ ((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵))
22		ibar 528	. . . . . 6 ⊢ (𝑅 ∈ Rng → (((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵) ↔ (𝑅 ∈ Rng ∧ ((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵))))
23	21, 22	bitrid 283	. . . . 5 ⊢ (𝑅 ∈ Rng → (((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ (Base‘𝑅)) ↔ (𝑅 ∈ Rng ∧ ((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵))))
24	10	elpw2 5281	. . . . . 6 ⊢ (𝐴 ∈ 𝒫 (Base‘𝑅) ↔ 𝐴 ⊆ (Base‘𝑅))
25	24	anbi2ci 626	. . . . 5 ⊢ ((𝐴 ∈ 𝒫 (Base‘𝑅) ∧ (𝑅 ↾s 𝐴) ∈ Rng) ↔ ((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ (Base‘𝑅)))
26		3anass 1095	. . . . 5 ⊢ ((𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵) ↔ (𝑅 ∈ Rng ∧ ((𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵)))
27	23, 25, 26	3bitr4g 314	. . . 4 ⊢ (𝑅 ∈ Rng → ((𝐴 ∈ 𝒫 (Base‘𝑅) ∧ (𝑅 ↾s 𝐴) ∈ Rng) ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵)))
28	17, 27	bitrid 283	. . 3 ⊢ (𝑅 ∈ Rng → (𝐴 ∈ {𝑠 ∈ 𝒫 (Base‘𝑅) ∣ (𝑅 ↾s 𝑠) ∈ Rng} ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵)))
29	14, 28	bitrd 279	. 2 ⊢ (𝑅 ∈ Rng → (𝐴 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵)))
30	2, 3, 29	pm5.21nii 378	1 ⊢ (𝐴 ∈ (SubRng‘𝑅) ↔ (𝑅 ∈ Rng ∧ (𝑅 ↾s 𝐴) ∈ Rng ∧ 𝐴 ⊆ 𝐵))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  {crab 3401   ⊆ wss 3903  𝒫 cpw 4556  ‘cfv 6500  (class class class)co 7368  Basecbs 17148   ↾_s cress 17169  Rngcrng 20099  SubRngcsubrng 20490

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fv 6508  df-ov 7371  df-subrng 20491

This theorem is referenced by:  subrngss  20493  subrngid  20494  subrngrng  20495  subrngrcl  20496  issubrng2  20503  subsubrng  20508  subrngpropd  20513  subrgsubrng  20523  rng2idlsubrng  21232