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

Theorem rngohomval 33430
 Description: The set of ring homomorphisms. (Contributed by Jeff Madsen, 19-Jun-2010.) (Revised by Mario Carneiro, 22-Sep-2015.)
Hypotheses
Ref Expression
rnghomval.1 𝐺 = (1st𝑅)
rnghomval.2 𝐻 = (2nd𝑅)
rnghomval.3 𝑋 = ran 𝐺
rnghomval.4 𝑈 = (GId‘𝐻)
rnghomval.5 𝐽 = (1st𝑆)
rnghomval.6 𝐾 = (2nd𝑆)
rnghomval.7 𝑌 = ran 𝐽
rnghomval.8 𝑉 = (GId‘𝐾)
Assertion
Ref Expression
rngohomval ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝑅 RngHom 𝑆) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ((𝑓𝑈) = 𝑉 ∧ ∀𝑥𝑋𝑦𝑋 ((𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)) ∧ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦))))})
Distinct variable groups:   𝑥,𝑓,𝑦   𝑓,𝐺   𝑓,𝐻   𝑓,𝐽   𝑓,𝑌,𝑦   𝑓,𝐾   𝑅,𝑓,𝑥,𝑦   𝑆,𝑓,𝑥,𝑦   𝑓,𝑋,𝑥,𝑦   𝑈,𝑓   𝑓,𝑉
Allowed substitution hints:   𝑈(𝑥,𝑦)   𝐺(𝑥,𝑦)   𝐻(𝑥,𝑦)   𝐽(𝑥,𝑦)   𝐾(𝑥,𝑦)   𝑉(𝑥,𝑦)   𝑌(𝑥)

Proof of Theorem rngohomval
Dummy variables 𝑟 𝑠 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 477 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → 𝑠 = 𝑆)
21fveq2d 6157 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → (1st𝑠) = (1st𝑆))
3 rnghomval.5 . . . . . . 7 𝐽 = (1st𝑆)
42, 3syl6eqr 2673 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → (1st𝑠) = 𝐽)
54rneqd 5318 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → ran (1st𝑠) = ran 𝐽)
6 rnghomval.7 . . . . 5 𝑌 = ran 𝐽
75, 6syl6eqr 2673 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → ran (1st𝑠) = 𝑌)
8 simpl 473 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → 𝑟 = 𝑅)
98fveq2d 6157 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → (1st𝑟) = (1st𝑅))
10 rnghomval.1 . . . . . . 7 𝐺 = (1st𝑅)
119, 10syl6eqr 2673 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → (1st𝑟) = 𝐺)
1211rneqd 5318 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → ran (1st𝑟) = ran 𝐺)
13 rnghomval.3 . . . . 5 𝑋 = ran 𝐺
1412, 13syl6eqr 2673 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → ran (1st𝑟) = 𝑋)
157, 14oveq12d 6628 . . 3 ((𝑟 = 𝑅𝑠 = 𝑆) → (ran (1st𝑠) ↑𝑚 ran (1st𝑟)) = (𝑌𝑚 𝑋))
168fveq2d 6157 . . . . . . . . 9 ((𝑟 = 𝑅𝑠 = 𝑆) → (2nd𝑟) = (2nd𝑅))
17 rnghomval.2 . . . . . . . . 9 𝐻 = (2nd𝑅)
1816, 17syl6eqr 2673 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → (2nd𝑟) = 𝐻)
1918fveq2d 6157 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → (GId‘(2nd𝑟)) = (GId‘𝐻))
20 rnghomval.4 . . . . . . 7 𝑈 = (GId‘𝐻)
2119, 20syl6eqr 2673 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → (GId‘(2nd𝑟)) = 𝑈)
2221fveq2d 6157 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑓‘(GId‘(2nd𝑟))) = (𝑓𝑈))
231fveq2d 6157 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → (2nd𝑠) = (2nd𝑆))
24 rnghomval.6 . . . . . . . 8 𝐾 = (2nd𝑆)
2523, 24syl6eqr 2673 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → (2nd𝑠) = 𝐾)
2625fveq2d 6157 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → (GId‘(2nd𝑠)) = (GId‘𝐾))
27 rnghomval.8 . . . . . 6 𝑉 = (GId‘𝐾)
2826, 27syl6eqr 2673 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → (GId‘(2nd𝑠)) = 𝑉)
2922, 28eqeq12d 2636 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑓‘(GId‘(2nd𝑟))) = (GId‘(2nd𝑠)) ↔ (𝑓𝑈) = 𝑉))
3011oveqd 6627 . . . . . . . . 9 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑥(1st𝑟)𝑦) = (𝑥𝐺𝑦))
3130fveq2d 6157 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑓‘(𝑥(1st𝑟)𝑦)) = (𝑓‘(𝑥𝐺𝑦)))
324oveqd 6627 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑓𝑥)(1st𝑠)(𝑓𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)))
3331, 32eqeq12d 2636 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑓‘(𝑥(1st𝑟)𝑦)) = ((𝑓𝑥)(1st𝑠)(𝑓𝑦)) ↔ (𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦))))
3418oveqd 6627 . . . . . . . . 9 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑥(2nd𝑟)𝑦) = (𝑥𝐻𝑦))
3534fveq2d 6157 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → (𝑓‘(𝑥(2nd𝑟)𝑦)) = (𝑓‘(𝑥𝐻𝑦)))
3625oveqd 6627 . . . . . . . 8 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑓𝑥)(2nd𝑠)(𝑓𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦)))
3735, 36eqeq12d 2636 . . . . . . 7 ((𝑟 = 𝑅𝑠 = 𝑆) → ((𝑓‘(𝑥(2nd𝑟)𝑦)) = ((𝑓𝑥)(2nd𝑠)(𝑓𝑦)) ↔ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦))))
3833, 37anbi12d 746 . . . . . 6 ((𝑟 = 𝑅𝑠 = 𝑆) → (((𝑓‘(𝑥(1st𝑟)𝑦)) = ((𝑓𝑥)(1st𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(2nd𝑟)𝑦)) = ((𝑓𝑥)(2nd𝑠)(𝑓𝑦))) ↔ ((𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)) ∧ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦)))))
3914, 38raleqbidv 3144 . . . . 5 ((𝑟 = 𝑅𝑠 = 𝑆) → (∀𝑦 ∈ ran (1st𝑟)((𝑓‘(𝑥(1st𝑟)𝑦)) = ((𝑓𝑥)(1st𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(2nd𝑟)𝑦)) = ((𝑓𝑥)(2nd𝑠)(𝑓𝑦))) ↔ ∀𝑦𝑋 ((𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)) ∧ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦)))))
4014, 39raleqbidv 3144 . . . 4 ((𝑟 = 𝑅𝑠 = 𝑆) → (∀𝑥 ∈ ran (1st𝑟)∀𝑦 ∈ ran (1st𝑟)((𝑓‘(𝑥(1st𝑟)𝑦)) = ((𝑓𝑥)(1st𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(2nd𝑟)𝑦)) = ((𝑓𝑥)(2nd𝑠)(𝑓𝑦))) ↔ ∀𝑥𝑋𝑦𝑋 ((𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)) ∧ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦)))))
4129, 40anbi12d 746 . . 3 ((𝑟 = 𝑅𝑠 = 𝑆) → (((𝑓‘(GId‘(2nd𝑟))) = (GId‘(2nd𝑠)) ∧ ∀𝑥 ∈ ran (1st𝑟)∀𝑦 ∈ ran (1st𝑟)((𝑓‘(𝑥(1st𝑟)𝑦)) = ((𝑓𝑥)(1st𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(2nd𝑟)𝑦)) = ((𝑓𝑥)(2nd𝑠)(𝑓𝑦)))) ↔ ((𝑓𝑈) = 𝑉 ∧ ∀𝑥𝑋𝑦𝑋 ((𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)) ∧ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦))))))
4215, 41rabeqbidv 3184 . 2 ((𝑟 = 𝑅𝑠 = 𝑆) → {𝑓 ∈ (ran (1st𝑠) ↑𝑚 ran (1st𝑟)) ∣ ((𝑓‘(GId‘(2nd𝑟))) = (GId‘(2nd𝑠)) ∧ ∀𝑥 ∈ ran (1st𝑟)∀𝑦 ∈ ran (1st𝑟)((𝑓‘(𝑥(1st𝑟)𝑦)) = ((𝑓𝑥)(1st𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(2nd𝑟)𝑦)) = ((𝑓𝑥)(2nd𝑠)(𝑓𝑦))))} = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ((𝑓𝑈) = 𝑉 ∧ ∀𝑥𝑋𝑦𝑋 ((𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)) ∧ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦))))})
43 df-rngohom 33429 . 2 RngHom = (𝑟 ∈ RingOps, 𝑠 ∈ RingOps ↦ {𝑓 ∈ (ran (1st𝑠) ↑𝑚 ran (1st𝑟)) ∣ ((𝑓‘(GId‘(2nd𝑟))) = (GId‘(2nd𝑠)) ∧ ∀𝑥 ∈ ran (1st𝑟)∀𝑦 ∈ ran (1st𝑟)((𝑓‘(𝑥(1st𝑟)𝑦)) = ((𝑓𝑥)(1st𝑠)(𝑓𝑦)) ∧ (𝑓‘(𝑥(2nd𝑟)𝑦)) = ((𝑓𝑥)(2nd𝑠)(𝑓𝑦))))})
44 ovex 6638 . . 3 (𝑌𝑚 𝑋) ∈ V
4544rabex 4778 . 2 {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ((𝑓𝑈) = 𝑉 ∧ ∀𝑥𝑋𝑦𝑋 ((𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)) ∧ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦))))} ∈ V
4642, 43, 45ovmpt2a 6751 1 ((𝑅 ∈ RingOps ∧ 𝑆 ∈ RingOps) → (𝑅 RngHom 𝑆) = {𝑓 ∈ (𝑌𝑚 𝑋) ∣ ((𝑓𝑈) = 𝑉 ∧ ∀𝑥𝑋𝑦𝑋 ((𝑓‘(𝑥𝐺𝑦)) = ((𝑓𝑥)𝐽(𝑓𝑦)) ∧ (𝑓‘(𝑥𝐻𝑦)) = ((𝑓𝑥)𝐾(𝑓𝑦))))})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ wa 384   = wceq 1480   ∈ wcel 1987  ∀wral 2907  {crab 2911  ran crn 5080  ‘cfv 5852  (class class class)co 6610  1st c1st 7118  2nd c2nd 7119   ↑𝑚 cmap 7809  GIdcgi 27214  RingOpscrngo 33360   RngHom crnghom 33426 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-sep 4746  ax-nul 4754  ax-pr 4872 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ral 2912  df-rex 2913  df-rab 2916  df-v 3191  df-sbc 3422  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-br 4619  df-opab 4679  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-iota 5815  df-fun 5854  df-fv 5860  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-rngohom 33429 This theorem is referenced by:  isrngohom  33431
 Copyright terms: Public domain W3C validator