| Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > k0004val | Structured version Visualization version GIF version | ||
| Description: The topological simplex of dimension 𝑁 is the set of real vectors where the components are nonnegative and sum to 1. (Contributed by RP, 29-Mar-2021.) |
| Ref | Expression |
|---|---|
| k0004.a | ⊢ 𝐴 = (𝑛 ∈ ℕ0 ↦ {𝑡 ∈ ((0[,]1) ↑m (1...(𝑛 + 1))) ∣ Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡‘𝑘) = 1}) |
| Ref | Expression |
|---|---|
| k0004val | ⊢ (𝑁 ∈ ℕ0 → (𝐴‘𝑁) = {𝑡 ∈ ((0[,]1) ↑m (1...(𝑁 + 1))) ∣ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘) = 1}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | oveq1 7420 | . . . . 5 ⊢ (𝑛 = 𝑁 → (𝑛 + 1) = (𝑁 + 1)) | |
| 2 | 1 | oveq2d 7429 | . . . 4 ⊢ (𝑛 = 𝑁 → (1...(𝑛 + 1)) = (1...(𝑁 + 1))) |
| 3 | 2 | oveq2d 7429 | . . 3 ⊢ (𝑛 = 𝑁 → ((0[,]1) ↑m (1...(𝑛 + 1))) = ((0[,]1) ↑m (1...(𝑁 + 1)))) |
| 4 | 2 | sumeq1d 15787 | . . . 4 ⊢ (𝑛 = 𝑁 → Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡‘𝑘) = Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘)) |
| 5 | 4 | eqeq1d 2762 | . . 3 ⊢ (𝑛 = 𝑁 → (Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡‘𝑘) = 1 ↔ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘) = 1)) |
| 6 | 3, 5 | rabeqbidv 3429 | . 2 ⊢ (𝑛 = 𝑁 → {𝑡 ∈ ((0[,]1) ↑m (1...(𝑛 + 1))) ∣ Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡‘𝑘) = 1} = {𝑡 ∈ ((0[,]1) ↑m (1...(𝑁 + 1))) ∣ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘) = 1}) |
| 7 | k0004.a | . 2 ⊢ 𝐴 = (𝑛 ∈ ℕ0 ↦ {𝑡 ∈ ((0[,]1) ↑m (1...(𝑛 + 1))) ∣ Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡‘𝑘) = 1}) | |
| 8 | ovex 7446 | . . 3 ⊢ ((0[,]1) ↑m (1...(𝑁 + 1))) ∈ V | |
| 9 | 8 | rabex 5303 | . 2 ⊢ {𝑡 ∈ ((0[,]1) ↑m (1...(𝑁 + 1))) ∣ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘) = 1} ∈ V |
| 10 | 6, 7, 9 | fvmpt 6986 | 1 ⊢ (𝑁 ∈ ℕ0 → (𝐴‘𝑁) = {𝑡 ∈ ((0[,]1) ↑m (1...(𝑁 + 1))) ∣ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘) = 1}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 {crab 3412 ↦ cmpt 5186 ‘cfv 6533 (class class class)co 7413 ↑m cmap 8826 0cc0 11124 1c1 11125 + caddc 11127 ℕ0cn0 12528 [,]cicc 13401 ...cfz 13561 Σcsu 15773 |
| 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-pw 4559 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-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-iota 6489 df-fun 6535 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-ov 7416 df-oprab 7417 df-mpo 7418 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-seq 14066 df-sum 15774 |
| This theorem is used by: k0004ss1 44991 k0004val0 44994 |
| Copyright terms: Public domain | W3C validator |