Theorem extvfval 34146

Description: The "variable extension" function evaluated for adding a variable with index 𝐴. (Contributed by Thierry Arnoux, 25-Jan-2026.)

Hypotheses

Ref	Expression
extvval.d	⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ ℎ finSupp 0}
extvval.1	⊢ 0 = (0g‘𝑅)
extvval.i	⊢ (𝜑 → 𝐼 ∈ 𝑉)
extvval.r	⊢ (𝜑 → 𝑅 ∈ 𝑊)
extvfval.a	⊢ (𝜑 → 𝐴 ∈ 𝐼)
extvfval.j	⊢ 𝐽 = (𝐼 ∖ {𝐴})
extvfval.m	⊢ 𝑀 = (Base‘(𝐽 mPoly 𝑅))

Assertion

Ref	Expression
extvfval	⊢ (𝜑 → ((𝐼extendVars𝑅)‘𝐴) = (𝑓 ∈ 𝑀 ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))))

Distinct variable groups:   𝑓,𝐼,ℎ,𝑥   𝑅,𝑓,𝑥   𝐴,𝑓,𝑥   𝑓,𝑀

Allowed substitution hints:   𝜑(𝑥, 𝑓, ℎ)   𝐴(ℎ)   𝐷(𝑥, 𝑓, ℎ)   𝑅(ℎ)   𝐽(𝑥, 𝑓, ℎ)   𝑀(𝑥, ℎ)   𝑉(𝑥, 𝑓, ℎ)   𝑊(𝑥, 𝑓, ℎ)   0 (𝑥, 𝑓, ℎ)

Proof of Theorem extvfval

Dummy variable 𝑎 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		sneq 4594	. . . . . . 7 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴})
2	1	difeq2d 4074	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝐼 ∖ {𝑎}) = (𝐼 ∖ {𝐴}))
3		extvfval.j	. . . . . 6 ⊢ 𝐽 = (𝐼 ∖ {𝐴})
4	2, 3	eqtr4di 2814	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝐼 ∖ {𝑎}) = 𝐽)
5	4	fvoveq1d 7434	. . . 4 ⊢ (𝑎 = 𝐴 → (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) = (Base‘(𝐽 mPoly 𝑅)))
6		extvfval.m	. . . 4 ⊢ 𝑀 = (Base‘(𝐽 mPoly 𝑅))
7	5, 6	eqtr4di 2814	. . 3 ⊢ (𝑎 = 𝐴 → (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) = 𝑀)
8		fveqeq2 6886	. . . . 5 ⊢ (𝑎 = 𝐴 → ((𝑥‘𝑎) = 0 ↔ (𝑥‘𝐴) = 0))
9	4	reseq2d 5970	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑥 ↾ (𝐼 ∖ {𝑎})) = (𝑥 ↾ 𝐽))
10	9	fveq2d 6881	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))) = (𝑓‘(𝑥 ↾ 𝐽)))
11	8, 10	ifbieq1d 4507	. . . 4 ⊢ (𝑎 = 𝐴 → if((𝑥‘𝑎) = 0, (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))), 0 ) = if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))
12	11	mpteq2dv 5199	. . 3 ⊢ (𝑎 = 𝐴 → (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝑎) = 0, (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))), 0 )) = (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 )))
13	7, 12	mpteq12dv 5192	. 2 ⊢ (𝑎 = 𝐴 → (𝑓 ∈ (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝑎) = 0, (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))), 0 ))) = (𝑓 ∈ 𝑀 ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))))
14		extvval.d	. . 3 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ ℎ finSupp 0}
15		extvval.1	. . 3 ⊢ 0 = (0g‘𝑅)
16		extvval.i	. . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑉)
17		extvval.r	. . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑊)
18		eqid 2761	. . 3 ⊢ (𝐼 ∖ {𝑎}) = (𝐼 ∖ {𝑎})
19		eqid 2761	. . 3 ⊢ (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) = (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅))
20	14, 15, 16, 17, 18, 19	extvval 34145	. 2 ⊢ (𝜑 → (𝐼extendVars𝑅) = (𝑎 ∈ 𝐼 ↦ (𝑓 ∈ (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝑎) = 0, (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))), 0 )))))
21		extvfval.a	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐼)
22	6	fvexi 6891	. . . 4 ⊢ 𝑀 ∈ V
23	22	mptex 7221	. . 3 ⊢ (𝑓 ∈ 𝑀 ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))) ∈ V
24	23	a1i 11	. 2 ⊢ (𝜑 → (𝑓 ∈ 𝑀 ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))) ∈ V)
25	13, 20, 21, 24	fvmptd4 7010	1 ⊢ (𝜑 → ((𝐼extendVars𝑅)‘𝐴) = (𝑓 ∈ 𝑀 ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))))

This proof depends on syntax axioms:   → wi 4   = wceq 1570   ∈ wcel 2145  {crab 3413  Vcvv 3451   ∖ cdif 3896  ifcif 4482  {csn 4584   class class class wbr 5103   ↦ cmpt 5186   ↾ cres 5653  ‘cfv 6531  (class class class)co 7412   ↑_m cmap 8831   finSupp cfsupp 9337  0cc0 11181  ℕ₀cn0 12587  Basecbs 17367  0_gc0g 17590   mPoly cmpl 22194  extendVarscextv 34143

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pr 5391

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-oprab 7416  df-mpo 7417  df-extv 34144

This theorem is used by:  extvfv  34147  extvfvalf  34151