MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  crngrhmfo Structured version   Visualization version   GIF version

Theorem crngrhmfo 20777
Description: The image of a surjective homomorphism from a commutative ring is commutative. (Contributed by Jeff Madsen, 4-Jan-2011.) (Revised by AV, 19-Jul-2026.)
Hypothesis
Ref Expression
crngrhmfo.b 𝐵 = (Base‘𝑆)
Assertion
Ref Expression
crngrhmfo ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:dom 𝐹⟶onto𝐵) → 𝑆 ∈ CRing)

Proof of Theorem crngrhmfo
Dummy variables 𝑎 𝑏 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rhmrcl2 20759 . . 3 (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝑆 ∈ Ring)
213ad2ant2 1152 . 2 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:dom 𝐹⟶onto𝐵) → 𝑆 ∈ Ring)
3 foelrn 7139 . . . . . . . 8 ((𝐹:dom 𝐹⟶onto𝐵 ∧ 𝑥 ∈ 𝐵) → ∃𝑎 ∈ dom 𝐹 𝑥 = (𝐹‘𝑎))
43ex 418 . . . . . . 7 (𝐹:dom 𝐹⟶onto𝐵 → (𝑥 ∈ 𝐵 → ∃𝑎 ∈ dom 𝐹 𝑥 = (𝐹‘𝑎)))
5 foelrn 7139 . . . . . . . 8 ((𝐹:dom 𝐹⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑏 ∈ dom 𝐹 𝑦 = (𝐹‘𝑏))
65ex 418 . . . . . . 7 (𝐹:dom 𝐹⟶onto𝐵 → (𝑦 ∈ 𝐵 → ∃𝑏 ∈ dom 𝐹 𝑦 = (𝐹‘𝑏)))
74, 6anim12d 621 . . . . . 6 (𝐹:dom 𝐹⟶onto𝐵 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (∃𝑎 ∈ dom 𝐹 𝑥 = (𝐹‘𝑎) ∧ ∃𝑏 ∈ dom 𝐹 𝑦 = (𝐹‘𝑏))))
8 reeanv 3238 . . . . . 6 (∃𝑎 ∈ dom 𝐹∃𝑏 ∈ dom 𝐹(𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏)) ↔ (∃𝑎 ∈ dom 𝐹 𝑥 = (𝐹‘𝑎) ∧ ∃𝑏 ∈ dom 𝐹 𝑦 = (𝐹‘𝑏)))
97, 8imbitrrdi 255 . . . . 5 (𝐹:dom 𝐹⟶onto𝐵 → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑎 ∈ dom 𝐹∃𝑏 ∈ dom 𝐹(𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏))))
1093ad2ant3 1153 . . . 4 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:dom 𝐹⟶onto𝐵) → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑎 ∈ dom 𝐹∃𝑏 ∈ dom 𝐹(𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏))))
11 simpll 779 . . . . . . . . . . . 12 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → 𝑅 ∈ CRing)
12 eqid 2763 . . . . . . . . . . . . . . . . . . 19 (Base‘𝑅) = (Base‘𝑅)
13 eqid 2763 . . . . . . . . . . . . . . . . . . 19 (Base‘𝑆) = (Base‘𝑆)
1412, 13rhmf 20766 . . . . . . . . . . . . . . . . . 18 (𝐹 ∈ (𝑅 RingHom 𝑆) → 𝐹:(Base‘𝑅)⟶(Base‘𝑆))
1514fdmd 6750 . . . . . . . . . . . . . . . . 17 (𝐹 ∈ (𝑅 RingHom 𝑆) → dom 𝐹 = (Base‘𝑅))
1615eleq2d 2850 . . . . . . . . . . . . . . . 16 (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝑎 ∈ dom 𝐹 ↔ 𝑎 ∈ (Base‘𝑅)))
1715eleq2d 2850 . . . . . . . . . . . . . . . 16 (𝐹 ∈ (𝑅 RingHom 𝑆) → (𝑏 ∈ dom 𝐹 ↔ 𝑏 ∈ (Base‘𝑅)))
1816, 17anbi12d 644 . . . . . . . . . . . . . . 15 (𝐹 ∈ (𝑅 RingHom 𝑆) → ((𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹) ↔ (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅))))
1918biimpd 232 . . . . . . . . . . . . . 14 (𝐹 ∈ (𝑅 RingHom 𝑆) → ((𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅))))
2019adantl 487 . . . . . . . . . . . . 13 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) → ((𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅))))
2120imp 412 . . . . . . . . . . . 12 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)))
22 3anass 1111 . . . . . . . . . . . 12 ((𝑅 ∈ CRing ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)) ↔ (𝑅 ∈ CRing ∧ (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅))))
2311, 21, 22sylanbrc 595 . . . . . . . . . . 11 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝑅 ∈ CRing ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)))
24 eqid 2763 . . . . . . . . . . . 12 (.r‘𝑅) = (.r‘𝑅)
2512, 24crngcom 20529 . . . . . . . . . . 11 ((𝑅 ∈ CRing ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)) → (𝑎(.r‘𝑅)𝑏) = (𝑏(.r‘𝑅)𝑎))
2623, 25syl 18 . . . . . . . . . 10 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝑎(.r‘𝑅)𝑏) = (𝑏(.r‘𝑅)𝑎))
2726fveq2d 6920 . . . . . . . . 9 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝐹‘(𝑎(.r‘𝑅)𝑏)) = (𝐹‘(𝑏(.r‘𝑅)𝑎)))
28 simplr 781 . . . . . . . . . . 11 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → 𝐹 ∈ (𝑅 RingHom 𝑆))
29 3anass 1111 . . . . . . . . . . 11 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)) ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ (𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅))))
3028, 21, 29sylanbrc 595 . . . . . . . . . 10 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)))
31 eqid 2763 . . . . . . . . . . 11 (.r‘𝑆) = (.r‘𝑆)
3212, 24, 31rhmmul 20771 . . . . . . . . . 10 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑎 ∈ (Base‘𝑅) ∧ 𝑏 ∈ (Base‘𝑅)) → (𝐹‘(𝑎(.r‘𝑅)𝑏)) = ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)))
3330, 32syl 18 . . . . . . . . 9 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝐹‘(𝑎(.r‘𝑅)𝑏)) = ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)))
3421ancomd 467 . . . . . . . . . . 11 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝑏 ∈ (Base‘𝑅) ∧ 𝑎 ∈ (Base‘𝑅)))
35 3anass 1111 . . . . . . . . . . 11 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑎 ∈ (Base‘𝑅)) ↔ (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ (𝑏 ∈ (Base‘𝑅) ∧ 𝑎 ∈ (Base‘𝑅))))
3628, 34, 35sylanbrc 595 . . . . . . . . . 10 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑎 ∈ (Base‘𝑅)))
3712, 24, 31rhmmul 20771 . . . . . . . . . 10 ((𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝑏 ∈ (Base‘𝑅) ∧ 𝑎 ∈ (Base‘𝑅)) → (𝐹‘(𝑏(.r‘𝑅)𝑎)) = ((𝐹‘𝑏)(.r‘𝑆)(𝐹‘𝑎)))
3836, 37syl 18 . . . . . . . . 9 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → (𝐹‘(𝑏(.r‘𝑅)𝑎)) = ((𝐹‘𝑏)(.r‘𝑆)(𝐹‘𝑎)))
3927, 33, 383eqtr3d 2806 . . . . . . . 8 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)) = ((𝐹‘𝑏)(.r‘𝑆)(𝐹‘𝑎)))
40 oveq12 7460 . . . . . . . . 9 ((𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏)) → (𝑥(.r‘𝑆)𝑦) = ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)))
41 oveq12 7460 . . . . . . . . . 10 ((𝑦 = (𝐹‘𝑏) ∧ 𝑥 = (𝐹‘𝑎)) → (𝑦(.r‘𝑆)𝑥) = ((𝐹‘𝑏)(.r‘𝑆)(𝐹‘𝑎)))
4241ancoms 464 . . . . . . . . 9 ((𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏)) → (𝑦(.r‘𝑆)𝑥) = ((𝐹‘𝑏)(.r‘𝑆)(𝐹‘𝑎)))
4340, 42eqeq12d 2779 . . . . . . . 8 ((𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏)) → ((𝑥(.r‘𝑆)𝑦) = (𝑦(.r‘𝑆)𝑥) ↔ ((𝐹‘𝑎)(.r‘𝑆)(𝐹‘𝑏)) = ((𝐹‘𝑏)(.r‘𝑆)(𝐹‘𝑎))))
4439, 43syl5ibrcom 250 . . . . . . 7 (((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) ∧ (𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹)) → ((𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏)) → (𝑥(.r‘𝑆)𝑦) = (𝑦(.r‘𝑆)𝑥)))
4544ex 418 . . . . . 6 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆)) → ((𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹) → ((𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏)) → (𝑥(.r‘𝑆)𝑦) = (𝑦(.r‘𝑆)𝑥))))
46453adant3 1150 . . . . 5 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:dom 𝐹⟶onto𝐵) → ((𝑎 ∈ dom 𝐹 ∧ 𝑏 ∈ dom 𝐹) → ((𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏)) → (𝑥(.r‘𝑆)𝑦) = (𝑦(.r‘𝑆)𝑥))))
4746rexlimdvv 3222 . . . 4 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:dom 𝐹⟶onto𝐵) → (∃𝑎 ∈ dom 𝐹∃𝑏 ∈ dom 𝐹(𝑥 = (𝐹‘𝑎) ∧ 𝑦 = (𝐹‘𝑏)) → (𝑥(.r‘𝑆)𝑦) = (𝑦(.r‘𝑆)𝑥)))
4810, 47syld 48 . . 3 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:dom 𝐹⟶onto𝐵) → ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑥(.r‘𝑆)𝑦) = (𝑦(.r‘𝑆)𝑥)))
4948ralrimivv 3207 . 2 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:dom 𝐹⟶onto𝐵) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(.r‘𝑆)𝑦) = (𝑦(.r‘𝑆)𝑥))
50 crngrhmfo.b . . 3 𝐵 = (Base‘𝑆)
5150, 31iscrng2 20530 . 2 (𝑆 ∈ CRing ↔ (𝑆 ∈ Ring ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥(.r‘𝑆)𝑦) = (𝑦(.r‘𝑆)𝑥)))
522, 49, 51sylanbrc 595 1 ((𝑅 ∈ CRing ∧ 𝐹 ∈ (𝑅 RingHom 𝑆) ∧ 𝐹:dom 𝐹⟶onto𝐵) → 𝑆 ∈ CRing)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  dom cdm 5658  ⟶ontowfo 6564  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  .rcmulr 17473  Ringcrg 20510  CRingccrg 20511   RingHom crh 20750
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-cnex 11295  ax-resscn 11296  ax-1cn 11297  ax-icn 11298  ax-addcl 11299  ax-addrcl 11300  ax-mulcl 11301  ax-mulrcl 11302  ax-mulcom 11303  ax-addass 11304  ax-mulass 11305  ax-distr 11306  ax-i2m1 11307  ax-1ne0 11308  ax-1rid 11309  ax-rnegex 11310  ax-rrecex 11311  ax-cnre 11312  ax-pre-lttri 11313  ax-pre-lttrn 11314  ax-pre-ltadd 11315  ax-pre-mulgt0 11316
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  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 4841  df-uni 4873  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-riota 7408  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-er 8755  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-pnf 11384  df-mnf 11385  df-xr 11386  df-ltxr 11387  df-le 11388  df-sub 11582  df-neg 11583  df-nn 12376  df-2 12445  df-sets 17386  df-slot 17404  df-ndx 17416  df-base 17432  df-plusg 17486  df-0g 17662  df-mhm 19028  df-ghm 19478  df-cmn 20047  df-mgp 20412  df-ur 20459  df-ring 20512  df-cring 20513  df-rhm 20753
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator