Theorem issubrg 14638

Description: The subring predicate. (Contributed by Stefan O'Rear, 27-Nov-2014.) (Proof shortened by AV, 12-Oct-2020.)

Hypotheses

Ref	Expression
issubrg.b	⊢ 𝐵 = (Base‘𝑅)
issubrg.i	⊢ 1 = (1r‘𝑅)

Assertion

Ref	Expression
issubrg	⊢ (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)))

Proof of Theorem issubrg

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

Step	Hyp	Ref	Expression
1		df-subrg 14636	. . 3 ⊢ SubRing = (𝑟 ∈ Ring ↦ {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟 ↾s 𝑠) ∈ Ring ∧ (1r‘𝑟) ∈ 𝑠)})
2	1	mptrcl 5791	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
3		simpll 531	. 2 ⊢ (((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)) → 𝑅 ∈ Ring)
4		fveq2 5698	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5		issubrg.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
6	4, 5	eqtr4di 2289	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
7	6	pweqd 3693	. . . . . 6 ⊢ (𝑟 = 𝑅 → 𝒫 (Base‘𝑟) = 𝒫 𝐵)
8		oveq1 6095	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑟 ↾s 𝑠) = (𝑅 ↾s 𝑠))
9	8	eleq1d 2307	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((𝑟 ↾s 𝑠) ∈ Ring ↔ (𝑅 ↾s 𝑠) ∈ Ring))
10		fveq2 5698	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
11		issubrg.i	. . . . . . . . 9 ⊢ 1 = (1r‘𝑅)
12	10, 11	eqtr4di 2289	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
13	12	eleq1d 2307	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((1r‘𝑟) ∈ 𝑠 ↔ 1 ∈ 𝑠))
14	9, 13	anbi12d 477	. . . . . 6 ⊢ (𝑟 = 𝑅 → (((𝑟 ↾s 𝑠) ∈ Ring ∧ (1r‘𝑟) ∈ 𝑠) ↔ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)))
15	7, 14	rabeqbidv 2816	. . . . 5 ⊢ (𝑟 = 𝑅 → {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟 ↾s 𝑠) ∈ Ring ∧ (1r‘𝑟) ∈ 𝑠)} = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)})
16		id 19	. . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Ring)
17		basfn 13469	. . . . . . . . 9 ⊢ Base Fn V
18		elex 2833	. . . . . . . . 9 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ V)
19		funfvex 5715	. . . . . . . . . 10 ⊢ ((Fun Base ∧ 𝑅 ∈ dom Base) → (Base‘𝑅) ∈ V)
20	19	funfni 5486	. . . . . . . . 9 ⊢ ((Base Fn V ∧ 𝑅 ∈ V) → (Base‘𝑅) ∈ V)
21	17, 18, 20	sylancr 418	. . . . . . . 8 ⊢ (𝑅 ∈ Ring → (Base‘𝑅) ∈ V)
22	5, 21	eqeltrid 2325	. . . . . . 7 ⊢ (𝑅 ∈ Ring → 𝐵 ∈ V)
23	22	pwexd 4320	. . . . . 6 ⊢ (𝑅 ∈ Ring → 𝒫 𝐵 ∈ V)
24		rabexg 4281	. . . . . 6 ⊢ (𝒫 𝐵 ∈ V → {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ∈ V)
25	23, 24	syl 14	. . . . 5 ⊢ (𝑅 ∈ Ring → {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ∈ V)
26	1, 15, 16, 25	fvmptd3 5802	. . . 4 ⊢ (𝑅 ∈ Ring → (SubRing‘𝑅) = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)})
27	26	eleq2d 2308	. . 3 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ 𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)}))
28		oveq2 6096	. . . . . . . 8 ⊢ (𝑠 = 𝐴 → (𝑅 ↾s 𝑠) = (𝑅 ↾s 𝐴))
29	28	eleq1d 2307	. . . . . . 7 ⊢ (𝑠 = 𝐴 → ((𝑅 ↾s 𝑠) ∈ Ring ↔ (𝑅 ↾s 𝐴) ∈ Ring))
30		eleq2 2302	. . . . . . 7 ⊢ (𝑠 = 𝐴 → ( 1 ∈ 𝑠 ↔ 1 ∈ 𝐴))
31	29, 30	anbi12d 477	. . . . . 6 ⊢ (𝑠 = 𝐴 → (((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠) ↔ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)))
32	31	elrab 2982	. . . . 5 ⊢ (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ↔ (𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)))
33	32	a1i 9	. . . 4 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ↔ (𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴))))
34		elpw2g 4294	. . . . . 6 ⊢ (𝐵 ∈ V → (𝐴 ∈ 𝒫 𝐵 ↔ 𝐴 ⊆ 𝐵))
35	22, 34	syl 14	. . . . 5 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ 𝒫 𝐵 ↔ 𝐴 ⊆ 𝐵))
36	35	anbi1d 469	. . . 4 ⊢ (𝑅 ∈ Ring → ((𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)) ↔ (𝐴 ⊆ 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴))))
37		an12 567	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)) ↔ ((𝑅 ↾s 𝐴) ∈ Ring ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)))
38	37	a1i 9	. . . 4 ⊢ (𝑅 ∈ Ring → ((𝐴 ⊆ 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)) ↔ ((𝑅 ↾s 𝐴) ∈ Ring ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))))
39	33, 36, 38	3bitrd 214	. . 3 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ↔ ((𝑅 ↾s 𝐴) ∈ Ring ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))))
40		ibar 301	. . . 4 ⊢ (𝑅 ∈ Ring → ((𝑅 ↾s 𝐴) ∈ Ring ↔ (𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring)))
41	40	anbi1d 469	. . 3 ⊢ (𝑅 ∈ Ring → (((𝑅 ↾s 𝐴) ∈ Ring ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))))
42	27, 39, 41	3bitrd 214	. 2 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))))
43	2, 3, 42	pm5.21nii 716	1 ⊢ (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)))

This proof depends on syntax axioms:   ∧ wa 104   ↔ wb 105   = wceq 1402   ∈ wcel 2209  {crab 2532  Vcvv 2821   ⊆ wss 3220  𝒫 cpw 3688   Fn wfn 5375  ‘cfv 5380  (class class class)co 6088  Basecbs 13410   ↾_s cress 13411  1_rcur 14369  Ringcrg 14407  SubRingcsubrg 14634

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4251  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-cnex 8276  ax-resscn 8277  ax-1re 8279  ax-addrcl 8282

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4132  df-opab 4194  df-mpt 4195  df-id 4440  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-fv 5388  df-ov 6091  df-inn 9314  df-ndx 13413  df-slot 13414  df-base 13416  df-subrg 14636

This theorem is used by:  subrgss  14639  subrgid  14640  subrgring  14641  subrgrcl  14643  subrg1cl  14646  issubrg2  14658  subsubrg  14662  subrgpropd  14670  issubassa  15122