Proof sketch: linear combinations are closed under sums and scalar multiples, each vector of the family is a combination with one coefficient 1, and a subspace containing the vectors contains every combination by induction on the length.
Routine facts about tuples built termwise or with one distinguished component, and about nonempty segments, are used without comment (Toolkit for AL2). We first establish the four identities of (i). The first follows from Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (v), which combines the two sums term by term, together with (Vector Space over a Field (viii)). For the second, the map on is additive by Vector Space over a Field (vii) and fixes by Elementary Identities in a Vector Space (iii), so Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vi) moves it inside the sum, and by Vector Space over a Field (v). For the third, by The Zero Vector, Negatives and Differences in a Vector Space (iii) and Elementary Identities in a Vector Space (iv), so the first two identities give
For the fourth, each term is by Elementary Identities in a Vector Space (ii), and a sum of zero vectors is , by Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vi) for the constant map on with value (for this is Span of a Finite Family; Spanning Families (i)). This proves (i).
By the fourth identity, is a linear combination of and so lies in ; by the first two, sums and scalar multiples of linear combinations of are again linear combinations of . So the span is a linear subspace of by Linear Subspaces (i).
Now let , so that , and take the coefficients and for . By Iterated Operations over an Interval: Extracting One Term and Reversing the Order (i), applied with in place of and with the gap map of Bijections between Intervals: the Gap Map and the Reversal (i),
where the second equality uses the fourth identity of (i) for the -tuple and Vector Space over a Field (vi), and the third uses The Zero Vector, Negatives and Differences in a Vector Space (i). So , and with the previous paragraph this proves (ii).
For (iii), let be a linear subspace of containing every , and let . Since contains and is closed under addition and scalar multiplication (Linear Subspaces (i)), each lies in . We show by induction on (Induction on ββ from 0 for a Condition Expressed by a Predicative Formula (ii)) that, if , the partial sum lies in . For it is by Span of a Finite Family; Spanning Families (i). If the claim holds for and , then by Iterated Operations over Finite Sets: Singletons, Disjoint Unions, Reindexing, Products of Sets, Termwise Combination, Homomorphisms and Intervals (vii)
a sum of two vectors of , which lies in . Taking , every linear combination of lies in , so . This proves (iii).
Finally, if , the set consists of the empty map alone (Tuples in a Set: the Set of n-Tuples and Their Components (ii)), and the corresponding sum is (Span of a Finite Family; Spanning Families (i)). So , which is (iv).
Loadingβ¦