Users' Mathboxes Mathbox for Richard Penner < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  k0004val Structured version   Visualization version   GIF version

Theorem k0004val 44934
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.)
Hypothesis
Ref Expression
k0004.a 𝐴 = (𝑛 ∈ ℕ0 ↦ {𝑡 ∈ ((0[,]1) ↑m (1...(𝑛 + 1))) ∣ Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡𝑘) = 1})
Assertion
Ref Expression
k0004val (𝑁 ∈ ℕ0 → (𝐴𝑁) = {𝑡 ∈ ((0[,]1) ↑m (1...(𝑁 + 1))) ∣ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡𝑘) = 1})
Distinct variable groups:   𝑘,𝑛   𝑡,𝑛   𝑘,𝑁   𝑡,𝑁,𝑛
Allowed substitution hints:   𝐴(𝑡, 𝑘, 𝑛)

Proof of Theorem k0004val
StepHypRef Expression
1 oveq1 7426 . . . . 5 (𝑛 = 𝑁 → (𝑛 + 1) = (𝑁 + 1))
21oveq2d 7435 . . . 4 (𝑛 = 𝑁 → (1...(𝑛 + 1)) = (1...(𝑁 + 1)))
32oveq2d 7435 . . 3 (𝑛 = 𝑁 → ((0[,]1) ↑m (1...(𝑛 + 1))) = ((0[,]1) ↑m (1...(𝑁 + 1))))
42sumeq1d 15775 . . . 4 (𝑛 = 𝑁 → Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡𝑘) = Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡𝑘))
54eqeq1d 2767 . . 3 (𝑛 = 𝑁 → (Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡𝑘) = 1 ↔ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡𝑘) = 1))
63, 5rabeqbidv 3436 . 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 7452 . . 3 ((0[,]1) ↑m (1...(𝑁 + 1))) ∈ V
98rabex 5311 . 2 {𝑡 ∈ ((0[,]1) ↑m (1...(𝑁 + 1))) ∣ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡𝑘) = 1} ∈ V
106, 7, 9fvmpt 6993 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 2146  {crab 3418  cmpt 5194  cfv 6540  (class class class)co 7419  m cmap 8830  0cc0 11115  1c1 11116   + caddc 11118  0cn0 12519  [,]cicc 13391  ...cfz 13551  Σcsu 15761
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pr 5406
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-opab 5176  df-mpt 5195  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-iota 6496  df-fun 6542  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-seq 14056  df-sum 15762
This theorem is used by:  k0004ss1  44935  k0004val0  44938
  Copyright terms: Public domain W3C validator