Theorem vr1val 22417

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 7421	. . . . 5 ⊢ (𝑟 = 𝑅 → (1o mVar 𝑟) = (1o mVar 𝑅))
3	2	fveq1d 6880	. . . 4 ⊢ (𝑟 = 𝑅 → ((1o mVar 𝑟)‘∅) = ((1o mVar 𝑅)‘∅))
4		df-vr1 22406	. . . 4 ⊢ var1 = (𝑟 ∈ V ↦ ((1o mVar 𝑟)‘∅))
5		fvex 6891	. . . 4 ⊢ ((1o mVar 𝑅)‘∅) ∈ V
6	3, 4, 5	fvmpt 6986	. . 3 ⊢ (𝑅 ∈ V → (var1‘𝑅) = ((1o mVar 𝑅)‘∅))
7	1, 6	eqtrid 2807	. 2 ⊢ (𝑅 ∈ V → 𝑋 = ((1o mVar 𝑅)‘∅))
8		fvprc 6870	. . . 4 ⊢ (¬ 𝑅 ∈ V → (var1‘𝑅) = ∅)
9		0fv 6919	. . . 4 ⊢ (∅‘∅) = ∅
10	8, 1, 9	3eqtr4g 2820	. . 3 ⊢ (¬ 𝑅 ∈ V → 𝑋 = (∅‘∅))
11		df-mvr 22125	. . . . . 6 ⊢ mVar = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟)))))
12	11	reldmmpo 7547	. . . . 5 ⊢ Rel dom mVar
13	12	ovprc2 7453	. . . 4 ⊢ (¬ 𝑅 ∈ V → (1o mVar 𝑅) = ∅)
14	13	fveq1d 6880	. . 3 ⊢ (¬ 𝑅 ∈ V → ((1o mVar 𝑅)‘∅) = (∅‘∅))
15	10, 14	eqtr4d 2798	. 2 ⊢ (¬ 𝑅 ∈ V → 𝑋 = ((1o mVar 𝑅)‘∅))
16	7, 15	pm2.61i 184	1 ⊢ 𝑋 = ((1o mVar 𝑅)‘∅)

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145  {crab 3412  Vcvv 3450  ∅c0 4279  ifcif 4482   ↦ cmpt 5186  ^◡ccnv 5654   “ cima 5658  ‘cfv 6533  (class class class)co 7413  1_oc1o 8448   ↑_m cmap 8826  Fincfn 8952  0cc0 11124  1c1 11125  ℕcn 12257  ℕ₀cn0 12528  0_gc0g 17524  1_rcur 20320   mVar cmvr 22120  var₁cv1 22401

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 2732  ax-sep 5251  ax-nul 5263  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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541  df-ov 7416  df-oprab 7417  df-mpo 7418  df-mvr 22125  df-vr1 22406

This theorem is used by:  vr1cl2  22418  vr1cl  22442  subrgvr1  22487  subrgvr1cl  22488  coe1tm  22499  ply1coe  22523  evl1var  22561  evls1var  22563  rhmply1vr1  22609