Metamath Proof Explorer


Theorem ressply1add

Description: A restricted polynomial algebra has the same addition operation. (Contributed by Mario Carneiro, 3-Jul-2015)

Ref Expression
Hypotheses ressply1.s 𝑆 = ( Poly1𝑅 )
ressply1.h 𝐻 = ( 𝑅s 𝑇 )
ressply1.u 𝑈 = ( Poly1𝐻 )
ressply1.b 𝐵 = ( Base ‘ 𝑈 )
ressply1.2 ( 𝜑𝑇 ∈ ( SubRing ‘ 𝑅 ) )
ressply1.p 𝑃 = ( 𝑆s 𝐵 )
Assertion ressply1add ( ( 𝜑 ∧ ( 𝑋𝐵𝑌𝐵 ) ) → ( 𝑋 ( +g𝑈 ) 𝑌 ) = ( 𝑋 ( +g𝑃 ) 𝑌 ) )

Proof

Step Hyp Ref Expression
1 ressply1.s 𝑆 = ( Poly1𝑅 )
2 ressply1.h 𝐻 = ( 𝑅s 𝑇 )
3 ressply1.u 𝑈 = ( Poly1𝐻 )
4 ressply1.b 𝐵 = ( Base ‘ 𝑈 )
5 ressply1.2 ( 𝜑𝑇 ∈ ( SubRing ‘ 𝑅 ) )
6 ressply1.p 𝑃 = ( 𝑆s 𝐵 )
7 eqid ( 1o mPoly 𝑅 ) = ( 1o mPoly 𝑅 )
8 eqid ( 1o mPoly 𝐻 ) = ( 1o mPoly 𝐻 )
9 eqid ( PwSer1𝐻 ) = ( PwSer1𝐻 )
10 3 9 4 ply1bas 𝐵 = ( Base ‘ ( 1o mPoly 𝐻 ) )
11 1on 1o ∈ On
12 11 a1i ( 𝜑 → 1o ∈ On )
13 eqid ( ( 1o mPoly 𝑅 ) ↾s 𝐵 ) = ( ( 1o mPoly 𝑅 ) ↾s 𝐵 )
14 7 2 8 10 12 5 13 ressmpladd ( ( 𝜑 ∧ ( 𝑋𝐵𝑌𝐵 ) ) → ( 𝑋 ( +g ‘ ( 1o mPoly 𝐻 ) ) 𝑌 ) = ( 𝑋 ( +g ‘ ( ( 1o mPoly 𝑅 ) ↾s 𝐵 ) ) 𝑌 ) )
15 eqid ( +g𝑈 ) = ( +g𝑈 )
16 3 8 15 ply1plusg ( +g𝑈 ) = ( +g ‘ ( 1o mPoly 𝐻 ) )
17 16 oveqi ( 𝑋 ( +g𝑈 ) 𝑌 ) = ( 𝑋 ( +g ‘ ( 1o mPoly 𝐻 ) ) 𝑌 )
18 eqid ( +g𝑆 ) = ( +g𝑆 )
19 1 7 18 ply1plusg ( +g𝑆 ) = ( +g ‘ ( 1o mPoly 𝑅 ) )
20 4 fvexi 𝐵 ∈ V
21 6 18 ressplusg ( 𝐵 ∈ V → ( +g𝑆 ) = ( +g𝑃 ) )
22 20 21 ax-mp ( +g𝑆 ) = ( +g𝑃 )
23 eqid ( +g ‘ ( 1o mPoly 𝑅 ) ) = ( +g ‘ ( 1o mPoly 𝑅 ) )
24 13 23 ressplusg ( 𝐵 ∈ V → ( +g ‘ ( 1o mPoly 𝑅 ) ) = ( +g ‘ ( ( 1o mPoly 𝑅 ) ↾s 𝐵 ) ) )
25 20 24 ax-mp ( +g ‘ ( 1o mPoly 𝑅 ) ) = ( +g ‘ ( ( 1o mPoly 𝑅 ) ↾s 𝐵 ) )
26 19 22 25 3eqtr3i ( +g𝑃 ) = ( +g ‘ ( ( 1o mPoly 𝑅 ) ↾s 𝐵 ) )
27 26 oveqi ( 𝑋 ( +g𝑃 ) 𝑌 ) = ( 𝑋 ( +g ‘ ( ( 1o mPoly 𝑅 ) ↾s 𝐵 ) ) 𝑌 )
28 14 17 27 3eqtr4g ( ( 𝜑 ∧ ( 𝑋𝐵𝑌𝐵 ) ) → ( 𝑋 ( +g𝑈 ) 𝑌 ) = ( 𝑋 ( +g𝑃 ) 𝑌 ) )