Theorem rhmsubcALTVlem2 49515

Description: Lemma 2 for rhmsubcALTV 49518. (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 5688	. . . 4 ⊢ ((𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → ⟨𝑋, 𝑌⟩ ∈ (𝑅 × 𝑅))
2	1	3adant1 1148	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → ⟨𝑋, 𝑌⟩ ∈ (𝑅 × 𝑅))
3	2	fvresd 6910	. 2 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩) = ( RingHom ‘⟨𝑋, 𝑌⟩))
4		df-ov 7427	. . 3 ⊢ (𝑋𝐻𝑌) = (𝐻‘⟨𝑋, 𝑌⟩)
5		rngcrescrhmALTV.h	. . . 4 ⊢ 𝐻 = ( RingHom ↾ (𝑅 × 𝑅))
6	5	fveq1i 6891	. . 3 ⊢ (𝐻‘⟨𝑋, 𝑌⟩) = (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩)
7	4, 6	eqtri 2783	. 2 ⊢ (𝑋𝐻𝑌) = (( RingHom ↾ (𝑅 × 𝑅))‘⟨𝑋, 𝑌⟩)
8		df-ov 7427	. 2 ⊢ (𝑋 RingHom 𝑌) = ( RingHom ‘⟨𝑋, 𝑌⟩)
9	3, 7, 8	3eqtr4g 2820	1 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝑅 ∧ 𝑌 ∈ 𝑅) → (𝑋𝐻𝑌) = (𝑋 RingHom 𝑌))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ∩ cin 4088  ⟨cop 4834   × cxp 5649   ↾ cres 5653  ‘cfv 6543  (class class class)co 7424  Ringcrg 20468   RingHom crh 20708  RngCatALTVcrngcALTV 49496

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5657  df-res 5663  df-iota 6497  df-fv 6551  df-ov 7427

This theorem is used by:  rhmsubcALTVlem3  49516  rhmsubcALTVlem4  49517