Theorem rhmdvdsr 14420

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 1027	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝐹 ∈ (𝑅 RingHom 𝑆))
2		simpl2 1028	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝐴 ∈ 𝑋)
3		rhmdvdsr.x	. . . . 5 ⊢ 𝑋 = (Base‘𝑅)
4		eqid 2234	. . . . 5 ⊢ (Base‘𝑆) = (Base‘𝑆)
5	3, 4	rhmf 14408	. . . 4 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹:𝑋⟶(Base‘𝑆))
6	5	ffvelcdmda 5817	. . 3 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋) → (𝐹‘𝐴) ∈ (Base‘𝑆))
7	1, 2, 6	syl2anc 411	. 2 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (𝐹‘𝐴) ∈ (Base‘𝑆))
8		simpll1 1063	. . . . . 6 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → 𝐹 ∈ (𝑅 RingHom 𝑆))
9		simpr 110	. . . . . 6 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → 𝑐 ∈ 𝑋)
10	5	ffvelcdmda 5817	. . . . . 6 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑐 ∈ 𝑋) → (𝐹‘𝑐) ∈ (Base‘𝑆))
11	8, 9, 10	syl2anc 411	. . . . 5 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → (𝐹‘𝑐) ∈ (Base‘𝑆))
12	11	ralrimiva 2617	. . . 4 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∀𝑐 ∈ 𝑋 (𝐹‘𝑐) ∈ (Base‘𝑆))
13	2	adantr 276	. . . . . . 7 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → 𝐴 ∈ 𝑋)
14		eqid 2234	. . . . . . . 8 ⊢ (.r‘𝑅) = (.r‘𝑅)
15		eqid 2234	. . . . . . . 8 ⊢ (.r‘𝑆) = (.r‘𝑆)
16	3, 14, 15	rhmmul 14409	. . . . . . 7 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑐 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋) → (𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)))
17	8, 9, 13, 16	syl3anc 1274	. . . . . 6 ⊢ ((((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) ∧ 𝑐 ∈ 𝑋) → (𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)))
18	17	ralrimiva 2617	. . . . 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 14400	. . . . . . . . . 10 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑅 ∈ Ring)
24	23	3ad2ant1 1045	. . . . . . . . 9 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝑅 ∈ Ring)
25	24	adantr 276	. . . . . . . 8 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑅 ∈ Ring)
26		ringsrg 14290	. . . . . . . 8 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ SRing)
27	25, 26	syl 14	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑅 ∈ SRing)
28		eqidd 2235	. . . . . . 7 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (.r‘𝑅) = (.r‘𝑅))
29	20, 22, 27, 28, 2	dvdsr2d 14340	. . . . . 6 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (𝐴 ∥ 𝐵 ↔ ∃𝑐 ∈ 𝑋 (𝑐(.r‘𝑅)𝐴) = 𝐵))
30	19, 29	mpbid 147	. . . . 5 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∃𝑐 ∈ 𝑋 (𝑐(.r‘𝑅)𝐴) = 𝐵)
31		r19.29 2682	. . . . . 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 5679	. . . . . . . 8 ⊢ (((𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ (𝑐(.r‘𝑅)𝐴) = 𝐵) → (𝐹‘(𝑐(.r‘𝑅)𝐴)) = (𝐹‘𝐵))
35	32, 34	eqtr3d 2269	. . . . . . 7 ⊢ (((𝐹‘(𝑐(.r‘𝑅)𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) ∧ (𝑐(.r‘𝑅)𝐴) = 𝐵) → ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
36	35	reximi 2641	. . . . . 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 2682	. . . 4 ⊢ ((∀𝑐 ∈ 𝑋 (𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)) → ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)))
40	12, 38, 39	syl2anc 411	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∃𝑐 ∈ 𝑋 ((𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)))
41		oveq1 6065	. . . . . 6 ⊢ (𝑦 = (𝐹‘𝑐) → (𝑦(.r‘𝑆)(𝐹‘𝐴)) = ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)))
42	41	eqeq1d 2243	. . . . 5 ⊢ (𝑦 = (𝐹‘𝑐) → ((𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵) ↔ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)))
43	42	rspcev 2923	. . . 4 ⊢ (((𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)) → ∃𝑦 ∈ (Base‘𝑆)(𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
44	43	rexlimivw 2658	. . 3 ⊢ (∃𝑐 ∈ 𝑋 ((𝐹‘𝑐) ∈ (Base‘𝑆) ∧ ((𝐹‘𝑐)(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵)) → ∃𝑦 ∈ (Base‘𝑆)(𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
45	40, 44	syl 14	. 2 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ∃𝑦 ∈ (Base‘𝑆)(𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))
46		eqidd 2235	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (Base‘𝑆) = (Base‘𝑆))
47		rhmdvdsr.n	. . . 4 ⊢ / = (∥r‘𝑆)
48	47	a1i 9	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → / = (∥r‘𝑆))
49		rhmrcl2 14401	. . . . . 6 ⊢ (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑆 ∈ Ring)
50	49	3ad2ant1 1045	. . . . 5 ⊢ ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → 𝑆 ∈ Ring)
51	50	adantr 276	. . . 4 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑆 ∈ Ring)
52		ringsrg 14290	. . . 4 ⊢ (𝑆 ∈ Ring → 𝑆 ∈ SRing)
53	51, 52	syl 14	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → 𝑆 ∈ SRing)
54		eqidd 2235	. . 3 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (.r‘𝑆) = (.r‘𝑆))
55	46, 48, 53, 54	dvdsrd 14339	. 2 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → ((𝐹‘𝐴) / (𝐹‘𝐵) ↔ ((𝐹‘𝐴) ∈ (Base‘𝑆) ∧ ∃𝑦 ∈ (Base‘𝑆)(𝑦(.r‘𝑆)(𝐹‘𝐴)) = (𝐹‘𝐵))))
56	7, 45, 55	mpbir2and 953	1 ⊢ (((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝐴 ∥ 𝐵) → (𝐹‘𝐴) / (𝐹‘𝐵))

Syntax hints:   → wi 4   ∧ wa 104   ∧ w3a 1005   = wceq 1398   ∈ wcel 2205  ∀wral 2522  ∃wrex 2523   class class class wbr 4114  ‘cfv 5357  (class class class)co 6058  Basecbs 13296  ._rcmulr 13375  SRingcsrg 14206  Ringcrg 14239  ∥_rcdsr 14330   RingHom crh 14395

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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-cnex 8234  ax-resscn 8235  ax-1cn 8236  ax-1re 8237  ax-icn 8238  ax-addcl 8239  ax-addrcl 8240  ax-mulcl 8241  ax-addcom 8243  ax-addass 8245  ax-i2m1 8248  ax-0lt1 8249  ax-0id 8251  ax-rnegex 8252  ax-pre-ltirr 8255  ax-pre-ltadd 8259

This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-nel 2510  df-ral 2527  df-rex 2528  df-reu 2529  df-rmo 2530  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-id 4419  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-riota 6011  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-map 6897  df-pnf 8326  df-mnf 8327  df-ltxr 8329  df-inn 9255  df-2 9313  df-3 9314  df-ndx 13299  df-slot 13300  df-base 13302  df-sets 13303  df-plusg 13387  df-mulr 13388  df-0g 13555  df-mgm 13619  df-sgrp 13665  df-mnd 13678  df-mhm 13714  df-grp 13758  df-minusg 13759  df-ghm 13994  df-cmn 14039  df-abl 14040  df-mgp 14160  df-ur 14203  df-srg 14207  df-ring 14241  df-dvdsr 14333  df-rhm 14397

This theorem is referenced by:  elrhmunit  14422