| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > vr1val | Structured version Visualization version GIF version | ||
| 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 1o = {∅} 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.) |
| Ref | Expression |
|---|---|
| vr1val.1 | ⊢ 𝑋 = (var1‘𝑅) |
| Ref | Expression |
|---|---|
| vr1val | ⊢ 𝑋 = ((1o mVar 𝑅)‘∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | vr1val.1 | . . 3 ⊢ 𝑋 = (var1‘𝑅) | |
| 2 | oveq2 7426 | . . . . 5 ⊢ (𝑟 = 𝑅 → (1o mVar 𝑟) = (1o mVar 𝑅)) | |
| 3 | 2 | fveq1d 6885 | . . . 4 ⊢ (𝑟 = 𝑅 → ((1o mVar 𝑟)‘∅) = ((1o mVar 𝑅)‘∅)) |
| 4 | df-vr1 22492 | . . . 4 ⊢ var1 = (𝑟 ∈ V ↦ ((1o mVar 𝑟)‘∅)) | |
| 5 | fvex 6896 | . . . 4 ⊢ ((1o mVar 𝑅)‘∅) ∈ V | |
| 6 | 3, 4, 5 | fvmpt 6991 | . . 3 ⊢ (𝑅 ∈ V → (var1‘𝑅) = ((1o mVar 𝑅)‘∅)) |
| 7 | 1, 6 | eqtrid 2808 | . 2 ⊢ (𝑅 ∈ V → 𝑋 = ((1o mVar 𝑅)‘∅)) |
| 8 | fvprc 6875 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (var1‘𝑅) = ∅) | |
| 9 | 0fv 6924 | . . . 4 ⊢ (∅‘∅) = ∅ | |
| 10 | 8, 1, 9 | 3eqtr4g 2821 | . . 3 ⊢ (¬ 𝑅 ∈ V → 𝑋 = (∅‘∅)) |
| 11 | df-mvr 22211 | . . . . . 6 ⊢ mVar = (𝑖 ∈ V, 𝑟 ∈ V ↦ (𝑥 ∈ 𝑖 ↦ (𝑓 ∈ {ℎ ∈ (ℕ0 ↑m 𝑖) ∣ (◡ℎ “ ℕ) ∈ Fin} ↦ if(𝑓 = (𝑦 ∈ 𝑖 ↦ if(𝑦 = 𝑥, 1, 0)), (1r‘𝑟), (0g‘𝑟))))) | |
| 12 | 11 | reldmmpo 7552 | . . . . 5 ⊢ Rel dom mVar |
| 13 | 12 | ovprc2 7458 | . . . 4 ⊢ (¬ 𝑅 ∈ V → (1o mVar 𝑅) = ∅) |
| 14 | 13 | fveq1d 6885 | . . 3 ⊢ (¬ 𝑅 ∈ V → ((1o mVar 𝑅)‘∅) = (∅‘∅)) |
| 15 | 10, 14 | eqtr4d 2799 | . 2 ⊢ (¬ 𝑅 ∈ V → 𝑋 = ((1o mVar 𝑅)‘∅)) |
| 16 | 7, 15 | pm2.61i 184 | 1 ⊢ 𝑋 = ((1o mVar 𝑅)‘∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 = wceq 1570 ∈ wcel 2145 {crab 3413 Vcvv 3451 ∅c0 4279 ifcif 4482 ↦ cmpt 5186 ◡ccnv 5650 “ cima 5654 ‘cfv 6537 (class class class)co 7418 1oc1o 8462 ↑m cmap 8840 Fincfn 8966 0cc0 11193 1c1 11194 ℕcn 12328 ℕ0cn0 12599 0gc0g 17603 1rcur 20400 mVar cmvr 22206 var1cv1 22487 |
| 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-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-rab 3414 df-v 3453 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 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-iota 6493 df-fun 6539 df-fv 6545 df-ov 7421 df-oprab 7422 df-mpo 7423 df-mvr 22211 df-vr1 22492 |
| This theorem is used by: vr1cl2 22504 vr1cl 22528 subrgvr1 22573 subrgvr1cl 22574 coe1tm 22585 ply1coe 22609 evl1var 22647 evls1var 22649 rhmply1vr1 22695 |
| Copyright terms: Public domain | W3C validator |