Theorem rhmsubcALTVlem2 48528

Description: Lemma 2 for rhmsubcALTV 48531. (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 5661	. . . 4 ⊢ ((𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → ⟨𝑋, 𝑌⟩ ∈ (𝑅 × 𝑅))
2	1	3adant1 1130	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → ⟨𝑋, 𝑌⟩ ∈ (𝑅 × 𝑅))
3	2	fvresd 6854	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩) = ( RingHom ‘⟨𝑋, 𝑌⟩))
4		df-ov 7361	. . 3 ⊢ (𝑋𝐻𝑌) = (𝐻‘⟨𝑋, 𝑌⟩)
5		rngcrescrhmALTV.h	. . . 4 ⊢ 𝐻 = ( RingHom ↾ (𝑅 × 𝑅))
6	5	fveq1i 6835	. . 3 ⊢ (𝐻‘⟨𝑋, 𝑌⟩) = (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩)
7	4, 6	eqtri 2759	. 2 ⊢ (𝑋𝐻𝑌) = (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩)
8		df-ov 7361	. 2 ⊢ (𝑋 RingHom 𝑌) = ( RingHom ‘⟨𝑋, 𝑌⟩)
9	3, 7, 8	3eqtr4g 2796	1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝑋𝐻𝑌) = (𝑋 RingHom 𝑌))

Syntax hints:   → wi 4   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113   ∩ cin 3900  ⟨cop 4586   × cxp 5622   ↾ cres 5626  ‘cfv 6492  (class class class)co 7358  Ringcrg 20168   RingHom crh 20405  RngCatALTVcrngcALTV 48509

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-br 5099  df-opab 5161  df-xp 5630  df-res 5636  df-iota 6448  df-fv 6500  df-ov 7361

This theorem is referenced by:  rhmsubcALTVlem3  48529  rhmsubcALTVlem4  48530