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 36164
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 766 . 2 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → 𝑆 ∈ RingOps)
2 foelrn 6982 . . . . . . . 8 ((𝐹:𝑋onto𝑌𝑦𝑌) → ∃𝑤𝑋 𝑦 = (𝐹𝑤))
32ex 413 . . . . . . 7 (𝐹:𝑋onto𝑌 → (𝑦𝑌 → ∃𝑤𝑋 𝑦 = (𝐹𝑤)))
4 foelrn 6982 . . . . . . . 8 ((𝐹:𝑋onto𝑌𝑧𝑌) → ∃𝑥𝑋 𝑧 = (𝐹𝑥))
54ex 413 . . . . . . 7 (𝐹:𝑋onto𝑌 → (𝑧𝑌 → ∃𝑥𝑋 𝑧 = (𝐹𝑥)))
63, 5anim12d 609 . . . . . 6 (𝐹:𝑋onto𝑌 → ((𝑦𝑌𝑧𝑌) → (∃𝑤𝑋 𝑦 = (𝐹𝑤) ∧ ∃𝑥𝑋 𝑧 = (𝐹𝑥))))
7 reeanv 3294 . . . . . 6 (∃𝑤𝑋𝑥𝑋 (𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) ↔ (∃𝑤𝑋 𝑦 = (𝐹𝑤) ∧ ∃𝑥𝑋 𝑧 = (𝐹𝑥)))
86, 7syl6ibr 251 . . . . 5 (𝐹:𝑋onto𝑌 → ((𝑦𝑌𝑧𝑌) → ∃𝑤𝑋𝑥𝑋 (𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥))))
98ad2antll 726 . . . 4 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → ((𝑦𝑌𝑧𝑌) → ∃𝑤𝑋𝑥𝑋 (𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥))))
10 crnghomfo.1 . . . . . . . . . . . . . 14 𝐺 = (1st𝑅)
11 eqid 2738 . . . . . . . . . . . . . 14 (2nd𝑅) = (2nd𝑅)
12 crnghomfo.2 . . . . . . . . . . . . . 14 𝑋 = ran 𝐺
1310, 11, 12crngocom 36159 . . . . . . . . . . . . 13 ((𝑅 ∈ CRingOps ∧ 𝑤𝑋𝑥𝑋) → (𝑤(2nd𝑅)𝑥) = (𝑥(2nd𝑅)𝑤))
14133expb 1119 . . . . . . . . . . . 12 ((𝑅 ∈ CRingOps ∧ (𝑤𝑋𝑥𝑋)) → (𝑤(2nd𝑅)𝑥) = (𝑥(2nd𝑅)𝑤))
15143ad2antl1 1184 . . . . . . . . . . 11 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝑤(2nd𝑅)𝑥) = (𝑥(2nd𝑅)𝑤))
1615fveq2d 6778 . . . . . . . . . 10 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑤(2nd𝑅)𝑥)) = (𝐹‘(𝑥(2nd𝑅)𝑤)))
17 crngorngo 36158 . . . . . . . . . . 11 (𝑅 ∈ CRingOps → 𝑅 ∈ RingOps)
18 eqid 2738 . . . . . . . . . . . 12 (2nd𝑆) = (2nd𝑆)
1910, 12, 11, 18rngohommul 36128 . . . . . . . . . . 11 (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑤(2nd𝑅)𝑥)) = ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)))
2017, 19syl3anl1 1411 . . . . . . . . . 10 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑤(2nd𝑅)𝑥)) = ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)))
2110, 12, 11, 18rngohommul 36128 . . . . . . . . . . . 12 (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑥𝑋𝑤𝑋)) → (𝐹‘(𝑥(2nd𝑅)𝑤)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2221ancom2s 647 . . . . . . . . . . 11 (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑥(2nd𝑅)𝑤)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2317, 22syl3anl1 1411 . . . . . . . . . 10 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → (𝐹‘(𝑥(2nd𝑅)𝑤)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2416, 20, 233eqtr3d 2786 . . . . . . . . 9 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
25 oveq12 7284 . . . . . . . . . 10 ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)))
26 oveq12 7284 . . . . . . . . . . 11 ((𝑧 = (𝐹𝑥) ∧ 𝑦 = (𝐹𝑤)) → (𝑧(2nd𝑆)𝑦) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2726ancoms 459 . . . . . . . . . 10 ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑧(2nd𝑆)𝑦) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤)))
2825, 27eqeq12d 2754 . . . . . . . . 9 ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → ((𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦) ↔ ((𝐹𝑤)(2nd𝑆)(𝐹𝑥)) = ((𝐹𝑥)(2nd𝑆)(𝐹𝑤))))
2924, 28syl5ibrcom 246 . . . . . . . 8 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) ∧ (𝑤𝑋𝑥𝑋)) → ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦)))
3029ex 413 . . . . . . 7 ((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) → ((𝑤𝑋𝑥𝑋) → ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦))))
31303expa 1117 . . . . . 6 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RngHom 𝑆)) → ((𝑤𝑋𝑥𝑋) → ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦))))
3231adantrr 714 . . . . 5 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → ((𝑤𝑋𝑥𝑋) → ((𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦))))
3332rexlimdvv 3222 . . . 4 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → (∃𝑤𝑋𝑥𝑋 (𝑦 = (𝐹𝑤) ∧ 𝑧 = (𝐹𝑥)) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦)))
349, 33syld 47 . . 3 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → ((𝑦𝑌𝑧𝑌) → (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦)))
3534ralrimivv 3122 . 2 (((𝑅 ∈ CRingOps ∧ 𝑆 ∈ RingOps) ∧ (𝐹 ∈ (𝑅 RngHom 𝑆) ∧ 𝐹:𝑋onto𝑌)) → ∀𝑦𝑌𝑧𝑌 (𝑦(2nd𝑆)𝑧) = (𝑧(2nd𝑆)𝑦))
36 crnghomfo.3 . . 3 𝐽 = (1st𝑆)
37 crnghomfo.4 . . 3 𝑌 = ran 𝐽
3836, 18, 37iscrngo2 36155 . 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 1086   = wceq 1539  wcel 2106  wral 3064  wrex 3065  ran crn 5590  ontowfo 6431  cfv 6433  (class class class)co 7275  1st c1st 7829  2nd c2nd 7830  RingOpscrngo 36052   RngHom crnghom 36118  CRingOpsccring 36151
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  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 2709  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ral 3069  df-rex 3070  df-rab 3073  df-v 3434  df-sbc 3717  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-br 5075  df-opab 5137  df-mpt 5158  df-id 5489  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-fo 6439  df-fv 6441  df-ov 7278  df-oprab 7279  df-mpo 7280  df-1st 7831  df-2nd 7832  df-map 8617  df-rngo 36053  df-rngohom 36121  df-com2 36148  df-crngo 36152
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator