| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > mvrvalind | Structured version Visualization version GIF version | ||
| Description: Value of the generating elements of the power series structure, expressed using the indicator function. (Contributed by Thierry Arnoux, 25-Jan-2026.) |
| Ref | Expression |
|---|---|
| mvrvalind.1 | ⊢ 𝑉 = (𝐼 mVar 𝑅) |
| mvrvalind.2 | ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} |
| mvrvalind.3 | ⊢ 0 = (0g‘𝑅) |
| mvrvalind.4 | ⊢ 1 = (1r‘𝑅) |
| mvrvalind.5 | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
| mvrvalind.6 | ⊢ (𝜑 → 𝑅 ∈ 𝑌) |
| mvrvalind.7 | ⊢ (𝜑 → 𝑋 ∈ 𝐼) |
| mvrvalind.8 | ⊢ (𝜑 → 𝐹 ∈ 𝐷) |
| mvrvalind.9 | ⊢ 𝐴 = ((𝟭‘𝐼)‘{𝑋}) |
| Ref | Expression |
|---|---|
| mvrvalind | ⊢ (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = 𝐴, 1 , 0 )) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mvrvalind.1 | . . 3 ⊢ 𝑉 = (𝐼 mVar 𝑅) | |
| 2 | mvrvalind.2 | . . 3 ⊢ 𝐷 = {ℎ ∈ (ℕ0 ↑m 𝐼) ∣ (◡ℎ “ ℕ) ∈ Fin} | |
| 3 | mvrvalind.3 | . . 3 ⊢ 0 = (0g‘𝑅) | |
| 4 | mvrvalind.4 | . . 3 ⊢ 1 = (1r‘𝑅) | |
| 5 | mvrvalind.5 | . . 3 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
| 6 | mvrvalind.6 | . . 3 ⊢ (𝜑 → 𝑅 ∈ 𝑌) | |
| 7 | mvrvalind.7 | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐼) | |
| 8 | mvrvalind.8 | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐷) | |
| 9 | 1, 2, 3, 4, 5, 6, 7, 8 | mvrval2 22345 | . 2 ⊢ (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )) |
| 10 | mvrvalind.9 | . . . . . 6 ⊢ 𝐴 = ((𝟭‘𝐼)‘{𝑋}) | |
| 11 | 10 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐴 = ((𝟭‘𝐼)‘{𝑋})) |
| 12 | 7 | snssd 4749 | . . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ 𝐼) |
| 13 | indval 12363 | . . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ {𝑋} ⊆ 𝐼) → ((𝟭‘𝐼)‘{𝑋}) = (𝑦 ∈ 𝐼 ↦ if(𝑦 ∈ {𝑋}, 1, 0))) | |
| 14 | 5, 12, 13 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → ((𝟭‘𝐼)‘{𝑋}) = (𝑦 ∈ 𝐼 ↦ if(𝑦 ∈ {𝑋}, 1, 0))) |
| 15 | velsn 4600 | . . . . . . . 8 ⊢ (𝑦 ∈ {𝑋} ↔ 𝑦 = 𝑋) | |
| 16 | 15 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ {𝑋} ↔ 𝑦 = 𝑋)) |
| 17 | 16 | ifbid 4509 | . . . . . 6 ⊢ (𝜑 → if(𝑦 ∈ {𝑋}, 1, 0) = if(𝑦 = 𝑋, 1, 0)) |
| 18 | 17 | mpteq2dv 5205 | . . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐼 ↦ if(𝑦 ∈ {𝑋}, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 19 | 11, 14, 18 | 3eqtrd 2802 | . . . 4 ⊢ (𝜑 → 𝐴 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 20 | 19 | eqeq2d 2774 | . . 3 ⊢ (𝜑 → (𝐹 = 𝐴 ↔ 𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) |
| 21 | 20 | ifbid 4509 | . 2 ⊢ (𝜑 → if(𝐹 = 𝐴, 1 , 0 ) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )) |
| 22 | 9, 21 | eqtr4d 2801 | 1 ⊢ (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = 𝐴, 1 , 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2147 {crab 3416 ⊆ wss 3900 ifcif 4485 {csn 4588 ↦ cmpt 5192 ◡ccnv 5657 “ cima 5661 ‘cfv 6566 (class class class)co 7451 ↑m cmap 8885 Fincfn 9011 0cc0 11239 1c1 11240 𝟭cind 12360 ℕcn 12375 ℕ0cn0 12646 0gc0g 17660 1rcur 20458 mVar cmvr 22268 |
| 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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 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-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 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-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-ind 12361 df-mvr 22273 |
| This theorem is used by: mplmulmvr 34282 |
| Copyright terms: Public domain | W3C validator |