Theorem issubrg 20838

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 20837	. . 3 ⊢ SubRing = (𝑟 ∈ Ring ↦ {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟 ↾s 𝑠) ∈ Ring ∧ (1r‘𝑟) ∈ 𝑠)})
2	1	mptrcl 7014	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
3		simpll 779	. 2 ⊢ (((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)) → 𝑅 ∈ Ring)
4		fveq2 6896	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
5		issubrg.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝑅)
6	4, 5	eqtr4di 2816	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = 𝐵)
7	6	pweqd 4577	. . . . . 6 ⊢ (𝑟 = 𝑅 → 𝒫 (Base‘𝑟) = 𝒫 𝐵)
8		oveq1 7437	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (𝑟 ↾s 𝑠) = (𝑅 ↾s 𝑠))
9	8	eleq1d 2849	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((𝑟 ↾s 𝑠) ∈ Ring ↔ (𝑅 ↾s 𝑠) ∈ Ring))
10		fveq2 6896	. . . . . . . . 9 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = (1r‘𝑅))
11		issubrg.i	. . . . . . . . 9 ⊢ 1 = (1r‘𝑅)
12	10, 11	eqtr4di 2816	. . . . . . . 8 ⊢ (𝑟 = 𝑅 → (1r‘𝑟) = 1 )
13	12	eleq1d 2849	. . . . . . 7 ⊢ (𝑟 = 𝑅 → ((1r‘𝑟) ∈ 𝑠 ↔ 1 ∈ 𝑠))
14	9, 13	anbi12d 644	. . . . . 6 ⊢ (𝑟 = 𝑅 → (((𝑟 ↾s 𝑠) ∈ Ring ∧ (1r‘𝑟) ∈ 𝑠) ↔ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)))
15	7, 14	rabeqbidv 3433	. . . . 5 ⊢ (𝑟 = 𝑅 → {𝑠 ∈ 𝒫 (Base‘𝑟) ∣ ((𝑟 ↾s 𝑠) ∈ Ring ∧ (1r‘𝑟) ∈ 𝑠)} = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)})
16	5	fvexi 6910	. . . . . . 7 ⊢ 𝐵 ∈ V
17	16	pwex 5346	. . . . . 6 ⊢ 𝒫 𝐵 ∈ V
18	17	rabex 5304	. . . . 5 ⊢ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ∈ V
19	15, 1, 18	fvmpt 7004	. . . 4 ⊢ (𝑅 ∈ Ring → (SubRing‘𝑅) = {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)})
20	19	eleq2d 2850	. . 3 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ 𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)}))
21		oveq2 7438	. . . . . . . 8 ⊢ (𝑠 = 𝐴 → (𝑅 ↾s 𝑠) = (𝑅 ↾s 𝐴))
22	21	eleq1d 2849	. . . . . . 7 ⊢ (𝑠 = 𝐴 → ((𝑅 ↾s 𝑠) ∈ Ring ↔ (𝑅 ↾s 𝐴) ∈ Ring))
23		eleq2 2853	. . . . . . 7 ⊢ (𝑠 = 𝐴 → ( 1 ∈ 𝑠 ↔ 1 ∈ 𝐴))
24	22, 23	anbi12d 644	. . . . . 6 ⊢ (𝑠 = 𝐴 → (((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠) ↔ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)))
25	24	elrab 3648	. . . . 5 ⊢ (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ↔ (𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)))
26	16	elpw2 5300	. . . . . 6 ⊢ (𝐴 ∈ 𝒫 𝐵 ↔ 𝐴 ⊆ 𝐵)
27	26	anbi1i 636	. . . . 5 ⊢ ((𝐴 ∈ 𝒫 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)) ↔ (𝐴 ⊆ 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)))
28		an12 658	. . . . 5 ⊢ ((𝐴 ⊆ 𝐵 ∧ ((𝑅 ↾s 𝐴) ∈ Ring ∧ 1 ∈ 𝐴)) ↔ ((𝑅 ↾s 𝐴) ∈ Ring ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)))
29	25, 27, 28	3bitri 300	. . . 4 ⊢ (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ↔ ((𝑅 ↾s 𝐴) ∈ Ring ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)))
30		ibar 538	. . . . 5 ⊢ (𝑅 ∈ Ring → ((𝑅 ↾s 𝐴) ∈ Ring ↔ (𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring)))
31	30	anbi1d 643	. . . 4 ⊢ (𝑅 ∈ Ring → (((𝑅 ↾s 𝐴) ∈ Ring ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))))
32	29, 31	bitrid 286	. . 3 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ {𝑠 ∈ 𝒫 𝐵 ∣ ((𝑅 ↾s 𝑠) ∈ Ring ∧ 1 ∈ 𝑠)} ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))))
33	20, 32	bitrd 282	. 2 ⊢ (𝑅 ∈ Ring → (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴))))
34	2, 3, 33	pm5.21nii 381	1 ⊢ (𝐴 ∈ (SubRing‘𝑅) ↔ ((𝑅 ∈ Ring ∧ (𝑅 ↾s 𝐴) ∈ Ring) ∧ (𝐴 ⊆ 𝐵 ∧ 1 ∈ 𝐴)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  {crab 3416   ⊆ wss 3900  𝒫 cpw 4560  ‘cfv 6547  (class class class)co 7430  Basecbs 17402   ↾_s cress 17423  1_rcur 20422  Ringcrg 20474  SubRingcsubrg 20836

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fv 6555  df-ov 7433  df-subrg 20837

This theorem is used by:  subrgss  20839  subrgid  20840  subrgring  20841  subrgrcl  20843  subrgsubrng  20845  subrg1cl  20847  issubrg2  20859  subsubrg  20865  subrgpropd  20875  issubassa  22190  subrgpsr  22300  cphsubrglem  25513  fldgensdrg  33932  fldgenfldext  34356  fldextrspundgdvdslem  34368  fldextrspundgdvds  34369