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 45135
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 7425 . . . . 5 (𝑛 = 𝑁 → (𝑛 + 1) = (𝑁 + 1))
21oveq2d 7434 . . . 4 (𝑛 = 𝑁 → (1...(𝑛 + 1)) = (1...(𝑁 + 1)))
32oveq2d 7434 . . 3 (𝑛 = 𝑁 → ((0[,]1) ↑m (1...(𝑛 + 1))) = ((0[,]1) ↑m (1...(𝑁 + 1))))
42sumeq1d 15860 . . . 4 (𝑛 = 𝑁 → Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡‘𝑘) = Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘))
54eqeq1d 2763 . . 3 (𝑛 = 𝑁 → (Σ𝑘 ∈ (1...(𝑛 + 1))(𝑡‘𝑘) = 1 ↔ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘) = 1))
63, 5rabeqbidv 3430 . 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 7451 . . 3 ((0[,]1) ↑m (1...(𝑁 + 1))) ∈ V
98rabex 5300 . 2 {𝑡 ∈ ((0[,]1) ↑m (1...(𝑁 + 1))) ∣ Σ𝑘 ∈ (1...(𝑁 + 1))(𝑡‘𝑘) = 1} ∈ V
106, 7, 9fvmpt 6991 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 3413   ↦ cmpt 5186  ‘cfv 6537  (class class class)co 7418   ↑m cmap 8840  0cc0 11193  1c1 11194   + caddc 11196  ℕ0cn0 12599  [,]cicc 13472  ...cfz 13632  Σcsu 15846
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-sep 5249  ax-nul 5260  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-rab 3414  df-v 3453  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 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-pred 6303  df-iota 6493  df-fun 6539  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-frecs 8292  df-wrecs 8323  df-recs 8372  df-rdg 8411  df-seq 14138  df-sum 15847
This theorem is used by:  k0004ss1  45136  k0004val0  45139
  Copyright terms: Public domain W3C validator