TheoremBase

Splitting the interval {1,...,m+n} at m and shifting {1,...,n} by m identify [m+n] minus [m] with the image of j mapsto m+j; the case analysis and the uniqueness of j = k - m then follow from the definition of the difference.

Proof

Each result cited is universally quantified over the data in its own statement.

Preliminaries. By Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting §segment, [p]={i∈N:i≤p}[p]=\{i\in\mathbb{N}:i\le p\} for p∈N0p\in\mathbb{N}_{0}, so the elements of a segment are natural numbers; and [p]={1,…,p}[p]=\{1,\dots,p\} by Intervals of Natural Numbers §segment. By Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication §closed, m+n∈Nm+n\in\mathbb{N}, so that the segment [m+n][m+n] is defined, and m+1∈Nm+1\in\mathbb{N}, so 1≤m+11\le m+1 by Arithmetic and Order of the Natural Numbers §least. Hence Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting §split, applied with 11, mm and nn in place of its mm, nn and pp, gives

[m+n]={1,…,m+n}={1,…,m}∪{m+1,…,m+n}=[m]∪{m+1,…,m+n},(1)[m+n]=\{1,\dots,m+n\}=\{1,\dots,m\}\cup\{m+1,\dots,m+n\}=[m]\cup\{m+1,\dots,m+n\},\tag{1}

with [m][m] and {m+1,…,m+n}\{m+1,\dots,m+n\} disjoint; therefore

{m+1,…,m+n}=[m+n]∖[m].(2)\{m+1,\dots,m+n\}=[m+n]\setminus[m].\tag{2}

By Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting §shift, applied with 11, nn and mm in place of its mm, nn and pp, the map j↦j+mj\mapsto j+m is a bijection from {1,…,n}=[n]\{1,\dots,n\}=[n] onto {1+m,…,n+m}\{1+m,\dots,n+m\}. For j∈[n]j\in[n] we have j∈Nj\in\mathbb{N}, so j+m=m+jj+m=m+j, and also 1+m=m+11+m=m+1 and n+m=m+nn+m=m+n, by Arithmetic and Order of the Natural Numbers §commutative. Hence the map σ:[n]→{m+1,…,m+n}\sigma:[n]\to\{m+1,\dots,m+n\}, σ(j)=m+j\sigma(j)=m+j (Values, Restriction and Equality of a Map, and the Map u↦t(u)u\mapsto t(u) as a Defined Set Symbol §map-symbol), has the same values as j↦j+mj\mapsto j+m and is a bijection onto {m+1,…,m+n}\{m+1,\dots,m+n\}.

Clause sum. m+n∈Nm+n\in\mathbb{N}, as shown in the Preliminaries. Since n∈Nn\in\mathbb{N}, m<m+nm<m+n by Arithmetic and Order of the Natural Numbers §difference, so m≤m+nm\le m+n by Arithmetic and Order of the Natural Numbers §partial-order, and [m]⊆[m+n][m]\subseteq[m+n] by Intervals of Natural Numbers: Initial Segments, Adding One Element, Splitting and Shifting §inclusion.

Clause shift. For j∈[n]j\in[n], m+j=σ(j)∈{m+1,…,m+n}=[m+n]∖[m]m+j=\sigma(j)\in\{m+1,\dots,m+n\}=[m+n]\setminus[m] by (2), so m+j∈[m+n]m+j\in[m+n] and m+j∉[m]m+j\notin[m]. By (2), the map [n]→[m+n]∖[m][n]\to[m+n]\setminus[m], j↦m+jj\mapsto m+j, is σ\sigma, which is injective and surjective onto [m+n]∖[m][m+n]\setminus[m]; so it is a bijection by Injective, Surjective and Bijective Functions between Classes §bijective.

Clause cases. Every value m+jm+j (j∈[n]j\in[n]) of σ\sigma lies in [m+n]∖[m][m+n]\setminus[m], and by Injective, Surjective and Bijective Functions between Classes §surjective every element of [m+n]∖[m][m+n]\setminus[m] is such a value; so {m+j:j∈[n]}=[m+n]∖[m]\{m+j:j\in[n]\}=[m+n]\setminus[m]. Let k∈[m+n]k\in[m+n]. Then kk lies in [m][m] or in [m+n]∖[m][m+n]\setminus[m], and not in both; this is the first assertion. Suppose now that k∈[m+n]∖[m]k\in[m+n]\setminus[m], and take j∈[n]j\in[n] with k=m+jk=m+j. As j∈Nj\in\mathbb{N}, m<m+j=km<m+j=k by Arithmetic and Order of the Natural Numbers §difference, so m≤km\le k by Arithmetic and Order of the Natural Numbers §partial-order. Since j∈N0j\in\mathbb{N}_{0} and m+j=km+j=k, The Difference of Two Natural Numbers with Zero §difference gives k−m=jk-m=j; hence k−m∈[n]k-m\in[n] and k=m+(k−m)k=m+(k-m). Finally, if j′∈[n]j'\in[n] and k=m+j′k=m+j', then j′∈N0j'\in\mathbb{N}_{0} and m+j′=km+j'=k, so j′=k−mj'=k-m by the uniqueness in The Difference of Two Natural Numbers with Zero §difference.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…