Users' Mathboxes Mathbox for Jeff Madsen < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  crngohomfo Structured version   Visualization version   GIF version

Theorem crngohomfo 36966
Description: The image of a homomorphism from a commutative ring is commutative. (Contributed by Jeff Madsen, 4-Jan-2011.)
Hypotheses
Ref Expression
crnghomfo.1 𝐺 = (1st𝑅)
crnghomfo.2 𝑋 = ran 𝐺
crnghomfo.3 𝐽 = (1st𝑆)
crnghomfo.4 𝑌 = ran 𝐽
Assertion
Ref Expression
crngohomfo (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → 𝑆 ∈ CRingOps)

Proof of Theorem crngohomfo
Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simplr 767 . 2 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → 𝑆 ∈ RingOps)
2 foelrn 7108 . . . . . . . 8 ((𝐹:𝑋onto𝑌𝑦𝑌) → ∃𝑤𝑋 𝑦 = (𝐹𝑤))
32ex 413 . . . . . . 7 (𝐹:𝑋onto𝑌 → (𝑦𝑌 → ∃𝑤𝑋 𝑦 = (𝐹𝑤)))
4 foelrn 7108 . . . . . . . 8 ((𝐹:𝑋onto𝑌𝑧𝑌) → ∃𝑥𝑋 𝑧 = (𝐹𝑥))
54ex 413 . . . . . . 7 (𝐹:𝑋onto𝑌 → (𝑧𝑌 → ∃𝑥𝑋 𝑧 = (𝐹𝑥)))
63, 5anim12d 609 . . . . . 6 (𝐹:𝑋onto𝑌 → ((𝑦𝑌𝑧𝑌) → (∃𝑤𝑋 𝑦 = (𝐹𝑤) ∧ ∃𝑥𝑋 𝑧 = (𝐹𝑥))))
7 reeanv 3226 . . . . . 6 (∃𝑤𝑋𝑥𝑋 (𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) ↔ (∃𝑤𝑋 𝑦 = (𝐹𝑤) ∧ ∃𝑥𝑋 𝑧 = (𝐹𝑥)))
86, 7imbitrrdi 251 . . . . 5 (𝐹:𝑋onto𝑌 → ((𝑦𝑌𝑧𝑌) → ∃𝑤𝑋𝑥𝑋 (𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥))))
98ad2antll 727 . . . 4 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → ((𝑦𝑌𝑧𝑌) → ∃𝑤𝑋𝑥𝑋 (𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥))))
10 crnghomfo.1 . . . . . . . . . . . . . 14 𝐺 = (1st𝑅)
11 eqid 2732 . . . . . . . . . . . . . 14 (2nd𝑅) = (2nd𝑅)
12 crnghomfo.2 . . . . . . . . . . . . . 14 𝑋 = ran 𝐺
1310, 11, 12crngocom 36961 . . . . . . . . . . . . 13 ((𝑅 ∈ CRingOps ∧ 𝑤𝑋𝑥𝑋) → (𝑤(2nd𝑅)𝑥) = (𝑥(2nd𝑅)𝑤))
14133expb 1120 . . . . . . . . . . . 12 ((𝑅 ∈ CRingOps ∧ (𝑤𝑋𝑥𝑋)) → (𝑤(2nd𝑅)𝑥) = (𝑥(2nd𝑅)𝑤))
15143ad2antl1 1185 . . . . . . . . . . 11 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝑤(2nd𝑅)𝑥) = (𝑥(2nd𝑅)𝑤))
1615fveq2d 6895 . . . . . . . . . 10 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑤(2nd𝑅)𝑥)) = (𝐹‘(𝑥(2nd𝑅)𝑤)))
17 crngorngo 36960 . . . . . . . . . . 11 (𝑅 ∈ CRingOps → 𝑅 ∈ RingOps)
18 eqid 2732 . . . . . . . . . . . 12 (2nd𝑆) = (2nd𝑆)
1910, 12, 11, 18rngohommul 36930 . . . . . . . . . . 11 (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑤(2nd𝑅)𝑥)) = ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)))
2017, 19syl3anl1 1412 . . . . . . . . . 10 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑤(2nd𝑅)𝑥)) = ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)))
2110, 12, 11, 18rngohommul 36930 . . . . . . . . . . . 12 (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑥𝑋𝑤𝑋)) → (𝐹‘(𝑥(2nd𝑅)𝑤)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2221ancom2s 648 . . . . . . . . . . 11 (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑥(2nd𝑅)𝑤)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2317, 22syl3anl1 1412 . . . . . . . . . 10 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑥(2nd𝑅)𝑤)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2416, 20, 233eqtr3d 2780 . . . . . . . . 9 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
25 oveq12 7420 . . . . . . . . . 10 ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)))
26 oveq12 7420 . . . . . . . . . . 11 ((𝑧 = (𝐹𝑥) ∧ 𝑦 = (𝐹𝑤)) → (𝑧(2nd𝑆)𝑦) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2726ancoms 459 . . . . . . . . . 10 ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑧(2nd𝑆)𝑦) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2825, 27eqeq12d 2748 . . . . . . . . 9 ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → ((𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦) ↔ ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤))))
2924, 28syl5ibrcom 246 . . . . . . . 8 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦)))
3029ex 413 . . . . . . 7 ((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) → ((𝑤𝑋𝑥𝑋) → ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦))))
31303expa 1118 . . . . . 6 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) → ((𝑤𝑋𝑥𝑋) → ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦))))
3231adantrr 715 . . . . 5 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → ((𝑤𝑋𝑥𝑋) → ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦))))
3332rexlimdvv 3210 . . . 4 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → (∃𝑤𝑋𝑥𝑋 (𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦)))
349, 33syld 47 . . 3 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → ((𝑦𝑌𝑧𝑌) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦)))
3534ralrimivv 3198 . 2 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → ∀𝑦𝑌𝑧𝑌 (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦))
36 crnghomfo.3 . . 3 𝐽 = (1st𝑆)
37 crnghomfo.4 . . 3 𝑌 = ran 𝐽
3836, 18, 37iscrngo2 36957 . 2 (𝑆 ∈ CRingOps ↔ (𝑆 ∈ RingOps ∧ ∀𝑦𝑌𝑧𝑌 (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦)))
391, 35, 38sylanbrc 583 1 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → 𝑆 ∈ CRingOps)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3061  wrex 3070  ran crn 5677  ontowfo 6541  cfv 6543  (class class class)co 7411  1st c1st 7975  2nd c2nd 7976  RingOpscrngo 36854   RngHom crnghom 36920  CRingOpsccring 36953
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7727
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-sbc 3778  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-fo 6549  df-fv 6551  df-ov 7414  df-oprab 7415  df-mpo 7416  df-1st 7977  df-2nd 7978  df-map 8824  df-rngo 36855  df-rngohom 36923  df-com2 36950  df-crngo 36954
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator