Theorem subrgdvds 14252

Description: If an element divides another in a subring, then it also divides the other in the parent ring. (Contributed by Mario Carneiro, 4-Dec-2014.)

Hypotheses

Ref	Expression
subrgdvds.1	⊢ 𝑆 = (𝑅 ↾s 𝐴)
subrgdvds.2	⊢ ∥ = (∥r‘𝑅)
subrgdvds.3	⊢ 𝐸 = (∥r‘𝑆)

Assertion

Ref	Expression
subrgdvds	⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐸 ⊆ ∥ )

Proof of Theorem subrgdvds

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		subrgdvds.1	. . . . 5 ⊢ 𝑆 = (𝑅 ↾s 𝐴)
2	1	subrgring 14241	. . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ Ring)
3		ringsrg 14063	. . . 4 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ SRing)
4	2, 3	syl 14	. . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑆 ∈ SRing)
5		reldvdsrsrg 14109	. . . 4 ⊢ (𝑆 ∈ SRing → Rel (∥r‘𝑆))
6		subrgdvds.3	. . . . 5 ⊢ 𝐸 = (∥r‘𝑆)
7	6	releqi 4809	. . . 4 ⊢ (Rel 𝐸 ↔ Rel (∥r‘𝑆))
8	5, 7	sylibr 134	. . 3 ⊢ (𝑆 ∈ SRing → Rel 𝐸)
9	4, 8	syl 14	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → Rel 𝐸)
10	1	subrgbas 14247	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 = (Base‘𝑆))
11		eqid 2231	. . . . . . . 8 ⊢ (Base‘𝑅) = (Base‘𝑅)
12	11	subrgss 14239	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐴 ⊆ (Base‘𝑅))
13	10, 12	eqsstrrd 3264	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) ⊆ (Base‘𝑅))
14	13	sseld 3226	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∈ (Base‘𝑆) → 𝑥 ∈ (Base‘𝑅)))
15		subrgrcl 14243	. . . . . . . . . 10 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ Ring)
16		eqid 2231	. . . . . . . . . . 11 ⊢ (.r‘𝑅) = (.r‘𝑅)
17	1, 16	ressmulrg 13230	. . . . . . . . . 10 ⊢ ((𝐴 ∈ (SubRing‘𝑅) ∧ 𝑅 ∈ Ring) → (.r‘𝑅) = (.r‘𝑆))
18	15, 17	mpdan 421	. . . . . . . . 9 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑆))
19	18	oveqd 6035	. . . . . . . 8 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑧(.r‘𝑅)𝑥) = (𝑧(.r‘𝑆)𝑥))
20	19	eqeq1d 2240	. . . . . . 7 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ((𝑧(.r‘𝑅)𝑥) = 𝑦 ↔ (𝑧(.r‘𝑆)𝑥) = 𝑦))
21	20	rexbidv 2533	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∃𝑧 ∈ (Base‘𝑆)(𝑧(.r‘𝑅)𝑥) = 𝑦 ↔ ∃𝑧 ∈ (Base‘𝑆)(𝑧(.r‘𝑆)𝑥) = 𝑦))
22		ssrexv 3292	. . . . . . 7 ⊢ ((Base‘𝑆) ⊆ (Base‘𝑅) → (∃𝑧 ∈ (Base‘𝑆)(𝑧(.r‘𝑅)𝑥) = 𝑦 → ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦))
23	13, 22	syl 14	. . . . . 6 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∃𝑧 ∈ (Base‘𝑆)(𝑧(.r‘𝑅)𝑥) = 𝑦 → ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦))
24	21, 23	sylbird 170	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (∃𝑧 ∈ (Base‘𝑆)(𝑧(.r‘𝑆)𝑥) = 𝑦 → ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦))
25	14, 24	anim12d 335	. . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ((𝑥 ∈ (Base‘𝑆) ∧ ∃𝑧 ∈ (Base‘𝑆)(𝑧(.r‘𝑆)𝑥) = 𝑦) → (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦)))
26		eqidd 2232	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑆) = (Base‘𝑆))
27	6	a1i 9	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐸 = (∥r‘𝑆))
28		eqidd 2232	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑆) = (.r‘𝑆))
29	26, 27, 4, 28	dvdsrd 14111	. . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥𝐸𝑦 ↔ (𝑥 ∈ (Base‘𝑆) ∧ ∃𝑧 ∈ (Base‘𝑆)(𝑧(.r‘𝑆)𝑥) = 𝑦)))
30		eqidd 2232	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (Base‘𝑅) = (Base‘𝑅))
31		subrgdvds.2	. . . . . 6 ⊢ ∥ = (∥r‘𝑅)
32	31	a1i 9	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → ∥ = (∥r‘𝑅))
33		ringsrg 14063	. . . . . 6 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing)
34	15, 33	syl 14	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝑅 ∈ SRing)
35		eqidd 2232	. . . . 5 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (.r‘𝑅) = (.r‘𝑅))
36	30, 32, 34, 35	dvdsrd 14111	. . . 4 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥 ∥ 𝑦 ↔ (𝑥 ∈ (Base‘𝑅) ∧ ∃𝑧 ∈ (Base‘𝑅)(𝑧(.r‘𝑅)𝑥) = 𝑦)))
37	25, 29, 36	3imtr4d 203	. . 3 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (𝑥𝐸𝑦 → 𝑥 ∥ 𝑦))
38		df-br 4089	. . 3 ⊢ (𝑥𝐸𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ 𝐸)
39		df-br 4089	. . 3 ⊢ (𝑥 ∥ 𝑦 ↔ ⟨𝑥, 𝑦⟩ ∈ ∥ )
40	37, 38, 39	3imtr3g 204	. 2 ⊢ (𝐴 ∈ (SubRing‘𝑅) → (⟨𝑥, 𝑦⟩ ∈ 𝐸 → ⟨𝑥, 𝑦⟩ ∈ ∥ ))
41	9, 40	relssdv 4818	1 ⊢ (𝐴 ∈ (SubRing‘𝑅) → 𝐸 ⊆ ∥ )

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1397   ∈ wcel 2202  ∃wrex 2511   ⊆ wss 3200  ⟨cop 3672   class class class wbr 4088  Rel wrel 4730  ‘cfv 5326  (class class class)co 6018  Basecbs 13084   ↾_s cress 13085  ._rcmulr 13163  SRingcsrg 13979  Ringcrg 14012  ∥_rcdsr 14102  SubRingcsubrg 14234

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-cnex 8123  ax-resscn 8124  ax-1cn 8125  ax-1re 8126  ax-icn 8127  ax-addcl 8128  ax-addrcl 8129  ax-mulcl 8130  ax-addcom 8132  ax-addass 8134  ax-i2m1 8137  ax-0lt1 8138  ax-0id 8140  ax-rnegex 8141  ax-pre-ltirr 8144  ax-pre-lttrn 8146  ax-pre-ltadd 8148

This theorem depends on definitions:  df-bi 117  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-nel 2498  df-ral 2515  df-rex 2516  df-reu 2517  df-rmo 2518  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-id 4390  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-riota 5971  df-ov 6021  df-oprab 6022  df-mpo 6023  df-pnf 8216  df-mnf 8217  df-ltxr 8219  df-inn 9144  df-2 9202  df-3 9203  df-ndx 13087  df-slot 13088  df-base 13090  df-sets 13091  df-iress 13092  df-plusg 13175  df-mulr 13176  df-0g 13343  df-mgm 13441  df-sgrp 13487  df-mnd 13502  df-grp 13588  df-minusg 13589  df-subg 13759  df-cmn 13875  df-abl 13876  df-mgp 13937  df-ur 13976  df-srg 13980  df-ring 14014  df-dvdsr 14105  df-subrg 14236

This theorem is referenced by:  subrguss  14253