Metamath Proof Explorer


Theorem ressply1sub

Description: A restricted polynomial algebra has the same subtraction operation. (Contributed by Thierry Arnoux, 30-Jan-2025)

Ref Expression
Hypotheses ressply.1 S = Poly 1 R
ressply.2 H = R 𝑠 T
ressply.3 U = Poly 1 H
ressply.4 B = Base U
ressply.5 φ T SubRing R
ressply1.1 P = S 𝑠 B
ressply1sub.1 φ X B
ressply1sub.2 φ Y B
Assertion ressply1sub φ X - U Y = X - P Y

Proof

Step Hyp Ref Expression
1 ressply.1 S = Poly 1 R
2 ressply.2 H = R 𝑠 T
3 ressply.3 U = Poly 1 H
4 ressply.4 B = Base U
5 ressply.5 φ T SubRing R
6 ressply1.1 P = S 𝑠 B
7 ressply1sub.1 φ X B
8 ressply1sub.2 φ Y B
9 1 2 3 4 5 6 8 ressply1invg φ inv g U Y = inv g P Y
10 9 oveq2d φ X + U inv g U Y = X + U inv g P Y
11 1 2 3 4 subrgply1 T SubRing R B SubRing S
12 subrgsubg B SubRing S B SubGrp S
13 5 11 12 3syl φ B SubGrp S
14 6 subggrp B SubGrp S P Grp
15 13 14 syl φ P Grp
16 1 2 3 4 5 6 ressply1bas φ B = Base P
17 8 16 eleqtrd φ Y Base P
18 eqid Base P = Base P
19 eqid inv g P = inv g P
20 18 19 grpinvcl P Grp Y Base P inv g P Y Base P
21 15 17 20 syl2anc φ inv g P Y Base P
22 21 16 eleqtrrd φ inv g P Y B
23 7 22 jca φ X B inv g P Y B
24 1 2 3 4 5 6 ressply1add φ X B inv g P Y B X + U inv g P Y = X + P inv g P Y
25 23 24 mpdan φ X + U inv g P Y = X + P inv g P Y
26 10 25 eqtrd φ X + U inv g U Y = X + P inv g P Y
27 eqid + U = + U
28 eqid inv g U = inv g U
29 eqid - U = - U
30 4 27 28 29 grpsubval X B Y B X - U Y = X + U inv g U Y
31 7 8 30 syl2anc φ X - U Y = X + U inv g U Y
32 7 16 eleqtrd φ X Base P
33 eqid + P = + P
34 eqid - P = - P
35 18 33 19 34 grpsubval X Base P Y Base P X - P Y = X + P inv g P Y
36 32 17 35 syl2anc φ X - P Y = X + P inv g P Y
37 26 31 36 3eqtr4d φ X - U Y = X - P Y