| 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 22283 | . 2 ⊢ (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )) |
| 10 | mvrvalind.9 | . . . . . 6 ⊢ 𝐴 = ((𝟭‘𝐼)‘{𝑋}) | |
| 11 | 10 | a1i 11 | . . . . 5 ⊢ (𝜑 → 𝐴 = ((𝟭‘𝐼)‘{𝑋})) |
| 12 | 7 | snssd 4747 | . . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ 𝐼) |
| 13 | indval 12316 | . . . . . 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 4506 | . . . . . 6 ⊢ (𝜑 → if(𝑦 ∈ {𝑋}, 1, 0) = if(𝑦 = 𝑋, 1, 0)) |
| 18 | 17 | mpteq2dv 5199 | . . . . 5 ⊢ (𝜑 → (𝑦 ∈ 𝐼 ↦ if(𝑦 ∈ {𝑋}, 1, 0)) = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 19 | 11, 14, 18 | 3eqtrd 2800 | . . . 4 ⊢ (𝜑 → 𝐴 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0))) |
| 20 | 19 | eqeq2d 2772 | . . 3 ⊢ (𝜑 → (𝐹 = 𝐴 ↔ 𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)))) |
| 21 | 20 | ifbid 4506 | . 2 ⊢ (𝜑 → if(𝐹 = 𝐴, 1 , 0 ) = if(𝐹 = (𝑦 ∈ 𝐼 ↦ if(𝑦 = 𝑋, 1, 0)), 1 , 0 )) |
| 22 | 9, 21 | eqtr4d 2799 | 1 ⊢ (𝜑 → ((𝑉‘𝑋)‘𝐹) = if(𝐹 = 𝐴, 1 , 0 )) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1570 ∈ wcel 2145 {crab 3413 ⊆ wss 3899 ifcif 4482 {csn 4584 ↦ cmpt 5186 ◡ccnv 5650 “ cima 5654 ‘cfv 6537 (class class class)co 7418 ↑m cmap 8840 Fincfn 8966 0cc0 11193 1c1 11194 𝟭cind 12313 ℕcn 12328 ℕ0cn0 12599 0gc0g 17603 1rcur 20400 mVar cmvr 22206 |
| 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-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 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-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 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-rn 5662 df-res 5663 df-ima 5664 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-ov 7421 df-oprab 7422 df-mpo 7423 df-ind 12314 df-mvr 22211 |
| This theorem is used by: mplmulmvr 34164 |
| Copyright terms: Public domain | W3C validator |