Theorem vr1val 22565

Description: The value of the generator of the power series algebra (the 𝑋 in 𝑅[[𝑋]]). Since all univariate polynomial rings over a fixed base ring 𝑅 are isomorphic, we don't bother to pass this in as a parameter; internally we are actually using the empty set as this generator and 1_o = {∅} is the index set (but for most purposes this choice should not be visible anyway). (Contributed by Mario Carneiro, 8-Feb-2015.) (Revised by Mario Carneiro, 12-Jun-2015.)

Hypothesis

Ref	Expression
vr1val.1	⊢ 𝑋 = (var1‘𝑅)

Assertion

Ref	Expression
vr1val	⊢ 𝑋 = ((1o mVar 𝑅)‘∅)

Proof of Theorem vr1val

Dummy variables 𝑓 ℎ 𝑖 𝑟 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vr1val.1	. . 3 ⊢ 𝑋 = (var1‘𝑅)
2		oveq2 7459	. . . . 5 ⊢ (𝑟 = 𝑅 → (1o mVar 𝑟) = (1o mVar 𝑅))
3	2	fveq1d 6918	. . . 4 ⊢ (𝑟 = 𝑅 → ((1o mVar 𝑟)‘∅) = ((1o mVar 𝑅)‘∅))
4		df-vr1 22554	. . . 4 ⊢ var1 = (𝑟 ∈ V ↦ ((1o mVar 𝑟)‘∅))
5		fvex 6929	. . . 4 ⊢ ((1o mVar 𝑅)‘∅) ∈ V
6	3, 4, 5	fvmpt 7024	. . 3 ⊢ (𝑅 ∈ V → (var1‘𝑅) = ((1o mVar 𝑅)‘∅))
7	1, 6	eqtrid 2810	. 2 ⊢ (𝑅 ∈ V → 𝑋 = ((1o mVar 𝑅)‘∅))
8		fvprc 6908	. . . 4 ⊢ (¬ 𝑅 ∈ V → (var1‘𝑅) = ∅)
9		0fv 6957	. . . 4 ⊢ (∅‘∅) = ∅
10	8, 1, 9	3eqtr4g 2823	. . 3 ⊢ (¬ 𝑅 ∈ V → 𝑋 = (∅‘∅))
11		df-mvr 22273	. . . . . 6 ⊢ mVar = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟)))))
12	11	reldmmpo 7584	. . . . 5 ⊢ Rel dom mVar
13	12	ovprc2 7491	. . . 4 ⊢ (¬ 𝑅 ∈ V → (1o mVar 𝑅) = ∅)
14	13	fveq1d 6918	. . 3 ⊢ (¬ 𝑅 ∈ V → ((1o mVar 𝑅)‘∅) = (∅‘∅))
15	10, 14	eqtr4d 2801	. 2 ⊢ (¬ 𝑅 ∈ V → 𝑋 = ((1o mVar 𝑅)‘∅))
16	7, 15	pm2.61i 184	1 ⊢ 𝑋 = ((1o mVar 𝑅)‘∅)

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2147  {crab 3416  Vcvv 3454  ∅c0 4281  ifcif 4485   ↦ cmpt 5192  ^◡ccnv 5657   “ cima 5661  ‘cfv 6566  (class class class)co 7451  1_oc1o 8507   ↑_m cmap 8885  Fincfn 9011  0cc0 11239  1c1 11240  ℕcn 12375  ℕ₀cn0 12646  0_gc0g 17660  1_rcur 20458   mVar cmvr 22268  var₁cv1 22549

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-mvr 22273  df-vr1 22554

This theorem is used by:  vr1cl2  22566  vr1cl  22590  subrgvr1  22635  subrgvr1cl  22636  coe1tm  22647  ply1coe  22671  evl1var  22709  evls1var  22711  rhmply1vr1  22757