Theorem extvfval 33676

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 4577	. . . . . . 7 ⊢ (𝑎 = 𝐴 → {𝑎} = {𝐴})
2	1	difeq2d 4066	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝐼 ∖ {𝑎}) = (𝐼 ∖ {𝐴}))
3		extvfval.j	. . . . . 6 ⊢ 𝐽 = (𝐼 ∖ {𝐴})
4	2, 3	eqtr4di 2789	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝐼 ∖ {𝑎}) = 𝐽)
5	4	fvoveq1d 7389	. . . 4 ⊢ (𝑎 = 𝐴 → (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) = (Base‘(𝐽 mPoly 𝑅)))
6		extvfval.m	. . . 4 ⊢ 𝑀 = (Base‘(𝐽 mPoly 𝑅))
7	5, 6	eqtr4di 2789	. . 3 ⊢ (𝑎 = 𝐴 → (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) = 𝑀)
8		fveqeq2 6849	. . . . 5 ⊢ (𝑎 = 𝐴 → ((𝑥‘𝑎) = 0 ↔ (𝑥‘𝐴) = 0))
9	4	reseq2d 5944	. . . . . 6 ⊢ (𝑎 = 𝐴 → (𝑥 ↾ (𝐼 ∖ {𝑎})) = (𝑥 ↾ 𝐽))
10	9	fveq2d 6844	. . . . 5 ⊢ (𝑎 = 𝐴 → (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))) = (𝑓‘(𝑥 ↾ 𝐽)))
11	8, 10	ifbieq1d 4491	. . . 4 ⊢ (𝑎 = 𝐴 → if((𝑥‘𝑎) = 0, (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))), 0 ) = if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))
12	11	mpteq2dv 5179	. . 3 ⊢ (𝑎 = 𝐴 → (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝑎) = 0, (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))), 0 )) = (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 )))
13	7, 12	mpteq12dv 5172	. 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 2736	. . 3 ⊢ (𝐼 ∖ {𝑎}) = (𝐼 ∖ {𝑎})
19		eqid 2736	. . 3 ⊢ (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) = (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅))
20	14, 15, 16, 17, 18, 19	extvval 33675	. 2 ⊢ (𝜑 → (𝐼extendVars𝑅) = (𝑎 ∈ 𝐼 ↦ (𝑓 ∈ (Base‘((𝐼 ∖ {𝑎}) mPoly 𝑅)) ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝑎) = 0, (𝑓‘(𝑥 ↾ (𝐼 ∖ {𝑎}))), 0 )))))
21		extvfval.a	. 2 ⊢ (𝜑 → 𝐴 ∈ 𝐼)
22	6	fvexi 6854	. . . 4 ⊢ 𝑀 ∈ V
23	22	mptex 7178	. . 3 ⊢ (𝑓 ∈ 𝑀 ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))) ∈ V
24	23	a1i 11	. 2 ⊢ (𝜑 → (𝑓 ∈ 𝑀 ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))) ∈ V)
25	13, 20, 21, 24	fvmptd4 6972	1 ⊢ (𝜑 → ((𝐼extendVars𝑅)‘𝐴) = (𝑓 ∈ 𝑀 ↦ (𝑥 ∈ 𝐷 ↦ if((𝑥‘𝐴) = 0, (𝑓‘(𝑥 ↾ 𝐽)), 0 ))))

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  {crab 3389  Vcvv 3429   ∖ cdif 3886  ifcif 4466  {csn 4567   class class class wbr 5085   ↦ cmpt 5166   ↾ cres 5633  ‘cfv 6498  (class class class)co 7367   ↑_m cmap 8773   finSupp cfsupp 9274  0cc0 11038  ℕ₀cn0 12437  Basecbs 17179  0_gc0g 17402   mPoly cmpl 21886  extendVarscextv 33673

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-extv 33674

This theorem is referenced by:  extvfv  33677  extvfvalf  33681