Theorem subrgpropd 13885

Description: If two structures have the same group components (properties), they have the same set of subrings. (Contributed by Mario Carneiro, 9-Feb-2015.)

Hypotheses

Ref	Expression
subrgpropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
subrgpropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
subrgpropd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
subrgpropd.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))

Assertion

Ref	Expression
subrgpropd	⊢ (𝜑 → (SubRing‘𝐾) = (SubRing‘𝐿))

Distinct variable groups:   𝑥,𝑦,𝐵   𝑥,𝐾,𝑦   𝜑,𝑥,𝑦   𝑥,𝐿,𝑦

Proof of Theorem subrgpropd

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		subrgrcl 13858	. . . 4 ⊢ (𝑠 ∈ (SubRing‘𝐾) → 𝐾 ∈ Ring)
2	1	a1i 9	. . 3 ⊢ (𝜑 → (𝑠 ∈ (SubRing‘𝐾) → 𝐾 ∈ Ring))
3		subrgrcl 13858	. . . 4 ⊢ (𝑠 ∈ (SubRing‘𝐿) → 𝐿 ∈ Ring)
4		subrgpropd.1	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
5		subrgpropd.2	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
6		subrgpropd.3	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
7		subrgpropd.4	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
8	4, 5, 6, 7	ringpropd 13670	. . . 4 ⊢ (𝜑 → (𝐾 ∈ Ring ↔ 𝐿 ∈ Ring))
9	3, 8	imbitrrid 156	. . 3 ⊢ (𝜑 → (𝑠 ∈ (SubRing‘𝐿) → 𝐾 ∈ Ring))
10	8	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝐾 ∈ Ring ↔ 𝐿 ∈ Ring))
11	4	ineq2d 3365	. . . . . . . . . 10 ⊢ (𝜑 → (𝑠 ∩ 𝐵) = (𝑠 ∩ (Base‘𝐾)))
12	11	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝑠 ∩ 𝐵) = (𝑠 ∩ (Base‘𝐾)))
13		eqidd 2197	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (𝐾 ↾s 𝑠) = (𝐾 ↾s 𝑠))
14		eqidd 2197	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (Base‘𝐾) = (Base‘𝐾))
15		simplr 528	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → 𝐾 ∈ Ring)
16		simpr 110	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → 𝑠 ∈ V)
17	13, 14, 15, 16	ressbasd 12770	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (𝑠 ∩ (Base‘𝐾)) = (Base‘(𝐾 ↾s 𝑠)))
18	17	elvd 2768	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝑠 ∩ (Base‘𝐾)) = (Base‘(𝐾 ↾s 𝑠)))
19	12, 18	eqtrd 2229	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝑠 ∩ 𝐵) = (Base‘(𝐾 ↾s 𝑠)))
20	5	ineq2d 3365	. . . . . . . . . 10 ⊢ (𝜑 → (𝑠 ∩ 𝐵) = (𝑠 ∩ (Base‘𝐿)))
21	20	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝑠 ∩ 𝐵) = (𝑠 ∩ (Base‘𝐿)))
22		eqidd 2197	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (𝐿 ↾s 𝑠) = (𝐿 ↾s 𝑠))
23		eqidd 2197	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (Base‘𝐿) = (Base‘𝐿))
24	8	biimpa 296	. . . . . . . . . . . 12 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → 𝐿 ∈ Ring)
25	24	adantr 276	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → 𝐿 ∈ Ring)
26	22, 23, 25, 16	ressbasd 12770	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (𝑠 ∩ (Base‘𝐿)) = (Base‘(𝐿 ↾s 𝑠)))
27	26	elvd 2768	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝑠 ∩ (Base‘𝐿)) = (Base‘(𝐿 ↾s 𝑠)))
28	21, 27	eqtrd 2229	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝑠 ∩ 𝐵) = (Base‘(𝐿 ↾s 𝑠)))
29		elinel2 3351	. . . . . . . . . 10 ⊢ (𝑥 ∈ (𝑠 ∩ 𝐵) → 𝑥 ∈ 𝐵)
30		elinel2 3351	. . . . . . . . . 10 ⊢ (𝑦 ∈ (𝑠 ∩ 𝐵) → 𝑦 ∈ 𝐵)
31	29, 30	anim12i 338	. . . . . . . . 9 ⊢ ((𝑥 ∈ (𝑠 ∩ 𝐵) ∧ 𝑦 ∈ (𝑠 ∩ 𝐵)) → (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵))
32	6	adantlr 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
33		eqidd 2197	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (+g‘𝐾) = (+g‘𝐾))
34	13, 33, 16, 15	ressplusgd 12831	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (+g‘𝐾) = (+g‘(𝐾 ↾s 𝑠)))
35	34	elvd 2768	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (+g‘𝐾) = (+g‘(𝐾 ↾s 𝑠)))
36	35	oveqdr 5953	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘(𝐾 ↾s 𝑠))𝑦))
37		eqidd 2197	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (+g‘𝐿) = (+g‘𝐿))
38	22, 37, 16, 25	ressplusgd 12831	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ 𝑠 ∈ V) → (+g‘𝐿) = (+g‘(𝐿 ↾s 𝑠)))
39	38	elvd 2768	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (+g‘𝐿) = (+g‘(𝐿 ↾s 𝑠)))
40	39	oveqdr 5953	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐿)𝑦) = (𝑥(+g‘(𝐿 ↾s 𝑠))𝑦))
41	32, 36, 40	3eqtr3d 2237	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘(𝐾 ↾s 𝑠))𝑦) = (𝑥(+g‘(𝐿 ↾s 𝑠))𝑦))
42	31, 41	sylan2 286	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ (𝑠 ∩ 𝐵) ∧ 𝑦 ∈ (𝑠 ∩ 𝐵))) → (𝑥(+g‘(𝐾 ↾s 𝑠))𝑦) = (𝑥(+g‘(𝐿 ↾s 𝑠))𝑦))
43	7	adantlr 477	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
44		vex 2766	. . . . . . . . . . . . 13 ⊢ 𝑠 ∈ V
45		eqid 2196	. . . . . . . . . . . . . 14 ⊢ (𝐾 ↾s 𝑠) = (𝐾 ↾s 𝑠)
46		eqid 2196	. . . . . . . . . . . . . 14 ⊢ (.r‘𝐾) = (.r‘𝐾)
47	45, 46	ressmulrg 12847	. . . . . . . . . . . . 13 ⊢ ((𝑠 ∈ V ∧ 𝐾 ∈ Ring) → (.r‘𝐾) = (.r‘(𝐾 ↾s 𝑠)))
48	44, 47	mpan 424	. . . . . . . . . . . 12 ⊢ (𝐾 ∈ Ring → (.r‘𝐾) = (.r‘(𝐾 ↾s 𝑠)))
49	48	adantl 277	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (.r‘𝐾) = (.r‘(𝐾 ↾s 𝑠)))
50	49	oveqdr 5953	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘(𝐾 ↾s 𝑠))𝑦))
51		eqid 2196	. . . . . . . . . . . . 13 ⊢ (𝐿 ↾s 𝑠) = (𝐿 ↾s 𝑠)
52		eqid 2196	. . . . . . . . . . . . 13 ⊢ (.r‘𝐿) = (.r‘𝐿)
53	51, 52	ressmulrg 12847	. . . . . . . . . . . 12 ⊢ ((𝑠 ∈ V ∧ 𝐿 ∈ Ring) → (.r‘𝐿) = (.r‘(𝐿 ↾s 𝑠)))
54	44, 24, 53	sylancr 414	. . . . . . . . . . 11 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (.r‘𝐿) = (.r‘(𝐿 ↾s 𝑠)))
55	54	oveqdr 5953	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐿)𝑦) = (𝑥(.r‘(𝐿 ↾s 𝑠))𝑦))
56	43, 50, 55	3eqtr3d 2237	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘(𝐾 ↾s 𝑠))𝑦) = (𝑥(.r‘(𝐿 ↾s 𝑠))𝑦))
57	31, 56	sylan2 286	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝐾 ∈ Ring) ∧ (𝑥 ∈ (𝑠 ∩ 𝐵) ∧ 𝑦 ∈ (𝑠 ∩ 𝐵))) → (𝑥(.r‘(𝐾 ↾s 𝑠))𝑦) = (𝑥(.r‘(𝐿 ↾s 𝑠))𝑦))
58	19, 28, 42, 57	ringpropd 13670	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → ((𝐾 ↾s 𝑠) ∈ Ring ↔ (𝐿 ↾s 𝑠) ∈ Ring))
59	10, 58	anbi12d 473	. . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → ((𝐾 ∈ Ring ∧ (𝐾 ↾s 𝑠) ∈ Ring) ↔ (𝐿 ∈ Ring ∧ (𝐿 ↾s 𝑠) ∈ Ring)))
60	4, 5	eqtr3d 2231	. . . . . . . . 9 ⊢ (𝜑 → (Base‘𝐾) = (Base‘𝐿))
61	60	sseq2d 3214	. . . . . . . 8 ⊢ (𝜑 → (𝑠 ⊆ (Base‘𝐾) ↔ 𝑠 ⊆ (Base‘𝐿)))
62	61	adantr 276	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝑠 ⊆ (Base‘𝐾) ↔ 𝑠 ⊆ (Base‘𝐿)))
63	4	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → 𝐵 = (Base‘𝐾))
64	5	adantr 276	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → 𝐵 = (Base‘𝐿))
65		simpr 110	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → 𝐾 ∈ Ring)
66	63, 64, 43, 65, 24	rngidpropdg 13778	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (1r‘𝐾) = (1r‘𝐿))
67	66	eleq1d 2265	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → ((1r‘𝐾) ∈ 𝑠 ↔ (1r‘𝐿) ∈ 𝑠))
68	62, 67	anbi12d 473	. . . . . 6 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → ((𝑠 ⊆ (Base‘𝐾) ∧ (1r‘𝐾) ∈ 𝑠) ↔ (𝑠 ⊆ (Base‘𝐿) ∧ (1r‘𝐿) ∈ 𝑠)))
69	59, 68	anbi12d 473	. . . . 5 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (((𝐾 ∈ Ring ∧ (𝐾 ↾s 𝑠) ∈ Ring) ∧ (𝑠 ⊆ (Base‘𝐾) ∧ (1r‘𝐾) ∈ 𝑠)) ↔ ((𝐿 ∈ Ring ∧ (𝐿 ↾s 𝑠) ∈ Ring) ∧ (𝑠 ⊆ (Base‘𝐿) ∧ (1r‘𝐿) ∈ 𝑠))))
70		eqid 2196	. . . . . 6 ⊢ (Base‘𝐾) = (Base‘𝐾)
71		eqid 2196	. . . . . 6 ⊢ (1r‘𝐾) = (1r‘𝐾)
72	70, 71	issubrg 13853	. . . . 5 ⊢ (𝑠 ∈ (SubRing‘𝐾) ↔ ((𝐾 ∈ Ring ∧ (𝐾 ↾s 𝑠) ∈ Ring) ∧ (𝑠 ⊆ (Base‘𝐾) ∧ (1r‘𝐾) ∈ 𝑠)))
73		eqid 2196	. . . . . 6 ⊢ (Base‘𝐿) = (Base‘𝐿)
74		eqid 2196	. . . . . 6 ⊢ (1r‘𝐿) = (1r‘𝐿)
75	73, 74	issubrg 13853	. . . . 5 ⊢ (𝑠 ∈ (SubRing‘𝐿) ↔ ((𝐿 ∈ Ring ∧ (𝐿 ↾s 𝑠) ∈ Ring) ∧ (𝑠 ⊆ (Base‘𝐿) ∧ (1r‘𝐿) ∈ 𝑠)))
76	69, 72, 75	3bitr4g 223	. . . 4 ⊢ ((𝜑 ∧ 𝐾 ∈ Ring) → (𝑠 ∈ (SubRing‘𝐾) ↔ 𝑠 ∈ (SubRing‘𝐿)))
77	76	ex 115	. . 3 ⊢ (𝜑 → (𝐾 ∈ Ring → (𝑠 ∈ (SubRing‘𝐾) ↔ 𝑠 ∈ (SubRing‘𝐿))))
78	2, 9, 77	pm5.21ndd 706	. 2 ⊢ (𝜑 → (𝑠 ∈ (SubRing‘𝐾) ↔ 𝑠 ∈ (SubRing‘𝐿)))
79	78	eqrdv 2194	1 ⊢ (𝜑 → (SubRing‘𝐾) = (SubRing‘𝐿))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2167  Vcvv 2763   ∩ cin 3156   ⊆ wss 3157  ‘cfv 5259  (class class class)co 5925  Basecbs 12703   ↾_s cress 12704  +_gcplusg 12780  ._rcmulr 12781  1_rcur 13591  Ringcrg 13628  SubRingcsubrg 13849

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-lttrn 8010  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-3 9067  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-iress 12711  df-plusg 12793  df-mulr 12794  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-grp 13205  df-mgp 13553  df-ur 13592  df-ring 13630  df-subrg 13851

This theorem is referenced by: (None)