Metamath Proof Explorer


Theorem rngunsnply1

Description: Adjoining one element to a ring results in a set of polynomial evaluations. Generalization of rngunsnply . (Contributed by Thierry Arnoux, 8-Nov-2026)

Ref Expression
Hypotheses rngunsnply1.b ⊢ B = Base R
rngunsnply1.p ⊢ P = Poly 1 ⁡ R ↾ 𝑠 S
rngunsnply1.u ⊢ U = Base P
rngunsnply1.q ⊢ Q = R evalSub 1 S
rngunsnply1.r ⊢ φ → R ∈ CRing
rngunsnply1.s ⊢ φ → S ∈ SubRing ⁡ R
rngunsnply1.x ⊢ φ → X ∈ B
rngunsnply1.n ⊢ N = RingSpan ⁡ R
Assertion rngunsnply1 ⊢ φ → V ∈ N ⁡ S ∪ X ↔ ∃ p ∈ U V = Q ⁡ p ⁡ X

Proof

Step Hyp Ref Expression
1 rngunsnply1.b ⊢ B = Base R
2 rngunsnply1.p ⊢ P = Poly 1 ⁡ R ↾ 𝑠 S
3 rngunsnply1.u ⊢ U = Base P
4 rngunsnply1.q ⊢ Q = R evalSub 1 S
5 rngunsnply1.r ⊢ φ → R ∈ CRing
6 rngunsnply1.s ⊢ φ → S ∈ SubRing ⁡ R
7 rngunsnply1.x ⊢ φ → X ∈ B
8 rngunsnply1.n ⊢ N = RingSpan ⁡ R
9 5 crngringd ⊢ φ → R ∈ Ring
10 1 a1i ⊢ φ → B = Base R
11 1 subrgss ⊢ S ∈ SubRing ⁡ R → S ⊆ B
12 6 11 syl ⊢ φ → S ⊆ B
13 7 snssd ⊢ φ → X ⊆ B
14 12 13 unssd ⊢ φ → S ∪ X ⊆ B
15 8 a1i ⊢ φ → N = RingSpan ⁡ R
16 eqidd ⊢ φ → N ⁡ S ∪ X = N ⁡ S ∪ X
17 eqid ⊢ p ∈ U ⟼ Q ⁡ p ⁡ X = p ∈ U ⟼ Q ⁡ p ⁡ X
18 4 2 1 3 5 6 7 17 evls1maprhm ⊢ φ → p ∈ U ⟼ Q ⁡ p ⁡ X ∈ P RingHom R
19 rnrhmsubrg ⊢ p ∈ U ⟼ Q ⁡ p ⁡ X ∈ P RingHom R → ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X ∈ SubRing ⁡ R
20 18 19 syl ⊢ φ → ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X ∈ SubRing ⁡ R
21 4 2 1 3 5 6 7 17 evls1maprnss ⊢ φ → S ⊆ ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X
22 eqid ⊢ var 1 ⁡ R = var 1 ⁡ R
23 eqid ⊢ R ↾ 𝑠 S = R ↾ 𝑠 S
24 22 6 23 2 3 subrgvr1cl ⊢ φ → var 1 ⁡ R ∈ U
25 22 6 23 subrgvr1 ⊢ φ → var 1 ⁡ R = var 1 ⁡ R ↾ 𝑠 S
26 25 fveq2d ⊢ φ → Q ⁡ var 1 ⁡ R = Q ⁡ var 1 ⁡ R ↾ 𝑠 S
27 26 fveq1d ⊢ φ → Q ⁡ var 1 ⁡ R ⁡ X = Q ⁡ var 1 ⁡ R ↾ 𝑠 S ⁡ X
28 eqid ⊢ var 1 ⁡ R ↾ 𝑠 S = var 1 ⁡ R ↾ 𝑠 S
29 4 28 23 1 5 6 evls1var ⊢ φ → Q ⁡ var 1 ⁡ R ↾ 𝑠 S = I ↾ B
30 29 fveq1d ⊢ φ → Q ⁡ var 1 ⁡ R ↾ 𝑠 S ⁡ X = I ↾ B ⁡ X
31 fvresi ⊢ X ∈ B → I ↾ B ⁡ X = X
32 7 31 syl ⊢ φ → I ↾ B ⁡ X = X
33 27 30 32 3eqtrrd ⊢ φ → X = Q ⁡ var 1 ⁡ R ⁡ X
34 33 adantr ⊢ φ ∧ p = var 1 ⁡ R → X = Q ⁡ var 1 ⁡ R ⁡ X
35 fveq2 ⊢ p = var 1 ⁡ R → Q ⁡ p = Q ⁡ var 1 ⁡ R
36 35 fveq1d ⊢ p = var 1 ⁡ R → Q ⁡ p ⁡ X = Q ⁡ var 1 ⁡ R ⁡ X
37 36 adantl ⊢ φ ∧ p = var 1 ⁡ R → Q ⁡ p ⁡ X = Q ⁡ var 1 ⁡ R ⁡ X
38 34 37 eqtr4d ⊢ φ ∧ p = var 1 ⁡ R → X = Q ⁡ p ⁡ X
39 17 24 7 38 elrnmptdv ⊢ φ → X ∈ ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X
40 39 snssd ⊢ φ → X ⊆ ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X
41 21 40 unssd ⊢ φ → S ∪ X ⊆ ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X
42 9 10 14 15 16 20 41 rgspnmin ⊢ φ → N ⁡ S ∪ X ⊆ ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X
43 42 sseld ⊢ φ → V ∈ N ⁡ S ∪ X → V ∈ ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X
44 fvex ⊢ Q ⁡ p ⁡ X ∈ V
45 17 44 elrnmpti ⊢ V ∈ ran ⁡ p ∈ U ⟼ Q ⁡ p ⁡ X ↔ ∃ p ∈ U V = Q ⁡ p ⁡ X
46 43 45 imbitrdi ⊢ φ → V ∈ N ⁡ S ∪ X → ∃ p ∈ U V = Q ⁡ p ⁡ X
47 5 adantr ⊢ φ ∧ p ∈ U → R ∈ CRing
48 6 adantr ⊢ φ ∧ p ∈ U → S ∈ SubRing ⁡ R
49 7 adantr ⊢ φ ∧ p ∈ U → X ∈ B
50 simpr ⊢ φ ∧ p ∈ U → p ∈ U
51 1 2 3 4 47 48 49 8 50 evls1rgspncl ⊢ φ ∧ p ∈ U → Q ⁡ p ⁡ X ∈ N ⁡ S ∪ X
52 eleq1 ⊢ V = Q ⁡ p ⁡ X → V ∈ N ⁡ S ∪ X ↔ Q ⁡ p ⁡ X ∈ N ⁡ S ∪ X
53 51 52 syl5ibrcom ⊢ φ ∧ p ∈ U → V = Q ⁡ p ⁡ X → V ∈ N ⁡ S ∪ X
54 53 rexlimdva ⊢ φ → ∃ p ∈ U V = Q ⁡ p ⁡ X → V ∈ N ⁡ S ∪ X
55 46 54 impbid ⊢ φ → V ∈ N ⁡ S ∪ X ↔ ∃ p ∈ U V = Q ⁡ p ⁡ X