Theorem rhmdvdsr 14188

Description: A ring homomorphism preserves the divisibility relation. (Contributed by Thierry Arnoux, 22-Oct-2017.)

Hypotheses

Ref	Expression
rhmdvdsr.x	⊢ 𝑋 = (Base‘𝑅)
rhmdvdsr.m	⊢ ∥ = (∥r‘𝑅)
rhmdvdsr.n	⊢ / = (∥r‘𝑆)

Assertion

Ref	Expression
rhmdvdsr	⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (𝐹‘𝐴) / (𝐹‘𝐵))

Proof of Theorem rhmdvdsr

Dummy variables 𝑦 𝑐 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpl1 1026	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝐹 ∈ (𝑅 RingHom 𝑆))
2		simpl2 1027	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝐴 ∈ 𝑋)
3		rhmdvdsr.x	. . . . 5 ⊢ 𝑋 = (Base‘𝑅)
4		eqid 2231	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
5	3, 4	rhmf 14176	. . . 4 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹:𝑋⟶(Base‘𝑆))
6	5	ffvelcdmda 5782	. . 3 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ (Base‘𝑆))
7	1, 2, 6	syl2anc 411	. 2 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (𝐹‘𝐴) ∈ (Base‘𝑆))
8		simpll1 1062	. . . . . 6 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → 𝐹 ∈ (𝑅 RingHom 𝑆))
9		simpr 110	. . . . . 6 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → 𝑐 ∈ 𝑋)
10	5	ffvelcdmda 5782	. . . . . 6 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑐 ∈ 𝑋) → (𝐹‘𝑐) ∈ (Base‘𝑆))
11	8, 9, 10	syl2anc 411	. . . . 5 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → (𝐹‘𝑐) ∈ (Base‘𝑆))
12	11	ralrimiva 2605	. . . 4 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∀𝑐 ∈ 𝑋 (𝐹‘𝑐) ∈ (Base‘𝑆))
13	2	adantr 276	. . . . . . 7 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → 𝐴 ∈ 𝑋)
14		eqid 2231	. . . . . . . 8 ⊢ (.r‘𝑅) = (.r‘𝑅)
15		eqid 2231	. . . . . . . 8 ⊢ (.r‘𝑆) = (.r‘𝑆)
16	3, 14, 15	rhmmul 14177	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑐 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)))
17	8, 9, 13, 16	syl3anc 1273	. . . . . 6 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → (𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)))
18	17	ralrimiva 2605	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∀𝑐 ∈ 𝑋 (𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)))
19		simpr 110	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝐴 ∥ 𝐵)
20	3	a1i 9	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑋 = (Base‘𝑅))
21		rhmdvdsr.m	. . . . . . . 8 ⊢ ∥ = (∥r‘𝑅)
22	21	a1i 9	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∥ = (∥r‘𝑅))
23		rhmrcl1 14168	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑅 ∈ Ring)
24	23	3ad2ant1 1044	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝑅 ∈ Ring)
25	24	adantr 276	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑅 ∈ Ring)
26		ringsrg 14059	. . . . . . . 8 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing)
27	25, 26	syl 14	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑅 ∈ SRing)
28		eqidd 2232	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (.r‘𝑅) = (.r‘𝑅))
29	20, 22, 27, 28, 2	dvdsr2d 14108	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (𝐴 ∥ 𝐵 ↔ ∃𝑐 ∈ 𝑋 (𝑐(.r‘𝑅)𝐴) = 𝐵))
30	19, 29	mpbid 147	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∃𝑐 ∈ 𝑋 (𝑐(.r‘𝑅)𝐴) = 𝐵)
31		r19.29 2670	. . . . . 6 ⊢ ((∀𝑐 ∈ 𝑋 (𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ ∃𝑐 ∈ 𝑋 (𝑐(.r‘𝑅)𝐴) = 𝐵) → ∃𝑐 ∈ 𝑋 ((𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ (𝑐(.r‘𝑅)𝐴) = 𝐵))
32		simpl 109	. . . . . . . 8 ⊢ (((𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ (𝑐(.r‘𝑅)𝐴) = 𝐵) → (𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)))
33		simpr 110	. . . . . . . . 9 ⊢ (((𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ (𝑐(.r‘𝑅)𝐴) = 𝐵) → (𝑐(.r‘𝑅)𝐴) = 𝐵)
34	33	fveq2d 5643	. . . . . . . 8 ⊢ (((𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ (𝑐(.r‘𝑅)𝐴) = 𝐵) → (𝐹‘(𝑐(.r‘𝑅)𝐴)) = (𝐹‘𝐵))
35	32, 34	eqtr3d 2266	. . . . . . 7 ⊢ (((𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ (𝑐(.r‘𝑅)𝐴) = 𝐵) → ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
36	35	reximi 2629	. . . . . 6 ⊢ (∃𝑐 ∈ 𝑋 ((𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ (𝑐(.r‘𝑅)𝐴) = 𝐵) → ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
37	31, 36	syl 14	. . . . 5 ⊢ ((∀𝑐 ∈ 𝑋 (𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ ∃𝑐 ∈ 𝑋 (𝑐(.r‘𝑅)𝐴) = 𝐵) → ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
38	18, 30, 37	syl2anc 411	. . . 4 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
39		r19.29 2670	. . . 4 ⊢ ((∀𝑐 ∈ 𝑋 (𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)) → ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)))
40	12, 38, 39	syl2anc 411	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)))
41		oveq1 6024	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝑐) → (𝑦(.r‘𝑆)(𝐹‘𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)))
42	41	eqeq1d 2240	. . . . 5 ⊢ (𝑦 = (𝐹‘𝑐) → ((𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵) ↔ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)))
43	42	rspcev 2910	. . . 4 ⊢ (((𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)) → ∃𝑦 ∈ (Base‘𝑆)(𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
44	43	rexlimivw 2646	. . 3 ⊢ (∃𝑐 ∈ 𝑋 ((𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)) → ∃𝑦 ∈ (Base‘𝑆)(𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
45	40, 44	syl 14	. 2 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∃𝑦 ∈ (Base‘𝑆)(𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
46		eqidd 2232	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (Base‘𝑆) = (Base‘𝑆))
47		rhmdvdsr.n	. . . 4 ⊢ / = (∥r‘𝑆)
48	47	a1i 9	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → / = (∥r‘𝑆))
49		rhmrcl2 14169	. . . . . 6 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑆 ∈ Ring)
50	49	3ad2ant1 1044	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝑆 ∈ Ring)
51	50	adantr 276	. . . 4 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑆 ∈ Ring)
52		ringsrg 14059	. . . 4 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ SRing)
53	51, 52	syl 14	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑆 ∈ SRing)
54		eqidd 2232	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (.r‘𝑆) = (.r‘𝑆))
55	46, 48, 53, 54	dvdsrd 14107	. 2 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ((𝐹‘𝐴) / (𝐹‘𝐵) ↔ ((𝐹‘𝐴) ∈ (Base‘𝑆) ∧ ∃𝑦 ∈ (Base‘𝑆)(𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))))
56	7, 45, 55	mpbir2and 952	1 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (𝐹‘𝐴) / (𝐹‘𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1004   = wceq 1397   ∈ wcel 2202  ∀wral 2510  ∃wrex 2511   class class class wbr 4088  ‘cfv 5326  (class class class)co 6017  Basecbs 13081  ._rcmulr 13160  SRingcsrg 13975  Ringcrg 14008  ∥_rcdsr 14098   RingHom crh 14163

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 8122  ax-resscn 8123  ax-1cn 8124  ax-1re 8125  ax-icn 8126  ax-addcl 8127  ax-addrcl 8128  ax-mulcl 8129  ax-addcom 8131  ax-addass 8133  ax-i2m1 8136  ax-0lt1 8137  ax-0id 8139  ax-rnegex 8140  ax-pre-ltirr 8143  ax-pre-ltadd 8147

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 5970  df-ov 6020  df-oprab 6021  df-mpo 6022  df-1st 6302  df-2nd 6303  df-map 6818  df-pnf 8215  df-mnf 8216  df-ltxr 8218  df-inn 9143  df-2 9201  df-3 9202  df-ndx 13084  df-slot 13085  df-base 13087  df-sets 13088  df-plusg 13172  df-mulr 13173  df-0g 13340  df-mgm 13438  df-sgrp 13484  df-mnd 13499  df-mhm 13541  df-grp 13585  df-minusg 13586  df-ghm 13827  df-cmn 13872  df-abl 13873  df-mgp 13933  df-ur 13972  df-srg 13976  df-ring 14010  df-dvdsr 14101  df-rhm 14165

This theorem is referenced by:  elrhmunit  14190