Theorem rhmsubcALTVlem2 49106

Description: Lemma 2 for rhmsubcALTV 49109. (Contributed by AV, 2-Mar-2020.) (New usage is discouraged.)

Hypotheses

Ref	Expression
rngcrescrhmALTV.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
rngcrescrhmALTV.c	⊢ 𝐶 = (RngCatALTV‘𝑈)
rngcrescrhmALTV.r	⊢ (𝜑 → 𝑅 = (Ring ∩ 𝑈))
rngcrescrhmALTV.h	⊢ 𝐻 = ( RingHom ↾ (𝑅 × 𝑅))

Assertion

Ref	Expression
rhmsubcALTVlem2	⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝑋𝐻𝑌) = (𝑋 RingHom 𝑌))

Proof of Theorem rhmsubcALTVlem2

Step	Hyp	Ref	Expression
1		opelxpi 5700	. . . 4 ⊢ ((𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → ⟨𝑋, 𝑌⟩ ∈ (𝑅 × 𝑅))
2	1	3adant1 1148	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → ⟨𝑋, 𝑌⟩ ∈ (𝑅 × 𝑅))
3	2	fvresd 6905	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩) = ( RingHom ‘⟨𝑋, 𝑌⟩))
4		df-ov 7422	. . 3 ⊢ (𝑋𝐻𝑌) = (𝐻‘⟨𝑋, 𝑌⟩)
5		rngcrescrhmALTV.h	. . . 4 ⊢ 𝐻 = ( RingHom ↾ (𝑅 × 𝑅))
6	5	fveq1i 6886	. . 3 ⊢ (𝐻‘⟨𝑋, 𝑌⟩) = (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩)
7	4, 6	eqtri 2788	. 2 ⊢ (𝑋𝐻𝑌) = (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩)
8		df-ov 7422	. 2 ⊢ (𝑋 RingHom 𝑌) = ( RingHom ‘⟨𝑋, 𝑌⟩)
9	3, 7, 8	3eqtr4g 2825	1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝑋𝐻𝑌) = (𝑋 RingHom 𝑌))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ∩ cin 3905  ⟨cop 4597   × cxp 5661   ↾ cres 5665  ‘cfv 6540  (class class class)co 7419  Ringcrg 20361   RingHom crh 20599  RngCatALTVcrngcALTV 49087

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

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-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-xp 5669  df-res 5675  df-iota 6496  df-fv 6548  df-ov 7422

This theorem is used by:  rhmsubcALTVlem3  49107  rhmsubcALTVlem4  49108