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

Theorem rngohomf 39166
Description: Obsolete theorem, use rhmf 20766 instead. A ring homomorphism is a function. (Contributed by Jeff Madsen, 19-Jun-2010.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
rnghomf.1 𝐺 = (1st ‘𝑅)
rnghomf.2 𝑋 = ran 𝐺
rnghomf.3 𝐽 = (1st ‘𝑆)
rnghomf.4 𝑌 = ran 𝐽
Assertion
Ref Expression
rngohomf ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹:𝑋⟶𝑌)

Proof of Theorem rngohomf
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 rnghomf.1 . . . . 5 𝐺 = (1st ‘𝑅)
2 eqid 2763 . . . . 5 (2nd ‘𝑅) = (2nd ‘𝑅)
3 rnghomf.2 . . . . 5 𝑋 = ran 𝐺
4 eqid 2763 . . . . 5 (GId‘(2nd ‘𝑅)) = (GId‘(2nd ‘𝑅))
5 rnghomf.3 . . . . 5 𝐽 = (1st ‘𝑆)
6 eqid 2763 . . . . 5 (2nd ‘𝑆) = (2nd ‘𝑆)
7 rnghomf.4 . . . . 5 𝑌 = ran 𝐽
8 eqid 2763 . . . . 5 (GId‘(2nd ‘𝑆)) = (GId‘(2nd ‘𝑆))
91, 2, 3, 4, 5, 6, 7, 8isrngohom 39165 . . . 4 ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝐹 ∈ (𝑅 RingOpsHom 𝑆) ↔ (𝐹:𝑋⟶𝑌 ∧ (𝐹‘(GId‘(2nd ‘𝑅))) = (GId‘(2nd ‘𝑆)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦))))))
109biimpa 482 . . 3 (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → (𝐹:𝑋⟶𝑌 ∧ (𝐹‘(GId‘(2nd ‘𝑅))) = (GId‘(2nd ‘𝑆)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 ((𝐹‘(𝑥𝐺𝑦)) = ((𝐹‘𝑥)𝐽(𝐹‘𝑦)) ∧ (𝐹‘(𝑥(2nd ‘𝑅)𝑦)) = ((𝐹‘𝑥)(2nd ‘𝑆)(𝐹‘𝑦)))))
1110simp1d 1160 . 2 (((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹:𝑋⟶𝑌)
12113impa 1127 1 ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps ∧ 𝐹 ∈ (𝑅 RingOpsHom 𝑆)) → 𝐹:𝑋⟶𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  ran crn 5659  ⟶wf 6562  ‘cfv 6566  (class class class)co 7451  1st c1st 8033  2nd c2nd 8034  GIdcgi 31149  RingOpscrngo 39094   RingOpsHom crngohom 39160
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
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  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-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  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-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-map 8887  df-rngohom 39163
This theorem is used by:  rngohomcl  39167  rngogrphom  39171  rngohomco  39174  keridl  39232
  Copyright terms: Public domain W3C validator