| 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 22296 | . 2 ⊢ (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )) |
| 10 | mvrvalind.9 | . . . . . 6 ⊢ 𝐴 = ((𝟭‘𝐼)‘{𝑋}) | |
| 11 | 10 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐴 = ((𝟭‘𝐼)‘{𝑋})) |
| 12 | 7 | snssd 4743 | . . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ 𝐼) |
| 13 | indval 12327 | . . . . . 6 ⊢ ((𝐼 ∈ 𝑊 ∧ {𝑋} ⊆ 𝐼) → ((𝟭‘𝐼)‘{𝑋}) = (𝑦 ∈ 𝐼 ↦ if(𝑦 ∈ {𝑋}, 1, 0))) | |
| 14 | 5, 12, 13 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → ((𝟭‘𝐼)‘{𝑋}) = (𝑦 ∈ 𝐼 ↦ if(𝑦 ∈ {𝑋}, 1, 0))) |
| 15 | velsn 4596 | . . . . . . . 8 ⊢ (𝑦 ∈ {𝑋} ↔ 𝑦 = 𝑋) | |
| 16 | 15 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → (𝑦 ∈ {𝑋} ↔ 𝑦 = 𝑋)) |
| 17 | 16 | ifbid 4505 | . . . . . 6 ⊢ (𝜑 → if(𝑦 ∈ {𝑋}, 1, 0) = if(𝑦 = 𝑋, 1, 0)) |
| 18 | 17 | mpteq2dv 5198 | . . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐼 ↦ if(𝑦 ∈ {𝑋}, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 19 | 11, 14, 18 | 3eqtrd 2799 | . . . 4 ⊢ (𝜑 → 𝐴 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 20 | 19 | eqeq2d 2771 | . . 3 ⊢ (𝜑 → (𝐹 = 𝐴 ↔ 𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) |
| 21 | 20 | ifbid 4505 | . 2 ⊢ (𝜑 → if(𝐹 = 𝐴, 1 , 0 ) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )) |
| 22 | 9, 21 | eqtr4d 2798 | 1 ⊢ (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = 𝐴, 1 , 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 {crab 3412 ⊆ wss 3895 ifcif 4481 {csn 4584 ↦ cmpt 5185 ◡ccnv 5649 “ cima 5653 ‘cfv 6539 (class class class)co 7421 ↑m cmap 8851 Fincfn 8977 0cc0 11204 1c1 11205 𝟭cind 12324 ℕcn 12339 ℕ0cn0 12610 0gc0g 17616 1rcur 20413 mVar cmvr 22219 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-ov 7424 df-oprab 7425 df-mpo 7426 df-ind 12325 df-mvr 22224 |
| This theorem is used by: mplmulmvr 34218 |
| Copyright terms: Public domain | W3C validator |