TheoremBase

Membership in (-π/2,π/2) is written through t+t and π, the value of the tangent through y·cos t = sin t with the sine and cosine formulas of the sine-cosine kit, and the resulting formula is moved to any position and fed to class comprehension.

Proof

Facts about maps, predicative formulas and the arithmetic and order of R\mathbb{R} carried by Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (vi) are used without comment. The parameters are those of the statement, at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i); in formulas, ⋅\cdot is the multiplication of R\mathbb{R}, and J=(−π/2,π/2)J=(-\pi/2,\pi/2) is the open interval. Throughout, the values of the parameters, and JJ, are sets: N\mathbb{N}, R\mathbb{R} and C\mathbb{C} (The Set of Natural Numbers and the Number One (i), The Real Numbers (i), The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (iii)); the constants 1∈N1\in\mathbb{N}, the unit 11 and the imaginary unit of C\mathbb{C}, and 0,π∈R0,\pi\in\mathbb{R} as elements of sets (The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion (ii), The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (v), The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (iv), The Real Numbers (iv), The Number Pi (i), Classes, Membership, Sets and Proper Classes (i)); the map R→C\mathbb{R}\to\mathbb{C}, the addition of N0\mathbb{N}_{0}, the sum and product operations of C\mathbb{C}, ++, ⋅\cdot and dCd_{\mathbb{C}} as maps between sets, hence elements of classes BAB^{A} of functions from AA to BB (The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (vi), Addition on Omega (i), The Real Numbers (iii), The Distance on the Complex Numbers (i), Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii), The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)); ≤\le and its strict order << as subclasses of the set R×R\mathbb{R}\times\mathbb{R} (Partial and Total Orders on a Set and the Associated Strict Relation (i), Relations, Domain, Range, Inverse and Composition (vi), Partial and Total Orders on a Set and the Associated Strict Relation (iii)); and JJ as a subclass of R\mathbb{R} (Intervals of the Real Line (ii)), these by Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper (i). We write F,C,SF,C,S for the distinct set variables x0,x1,x2x_{0},x_{1},x_{2} of Renaming and Substituting Variables in Predicative Formulas, the given x0,…,xn−1x_{0},\dots,x_{n-1} being the first of the variables x0,x1,…x_{0},x_{1},\dots there; we build a predicative formula in FF alone and move it to the position ii at the end. The letters t,y,c,s,g,h,u,vt,y,c,s,g,h,u,v denote further pairwise distinct set variables, distinct from x0,x1,x2x_{0},x_{1},x_{2}. The parameters are set variables other than x0,…,xn−1x_{0},\dots,x_{n-1}, other than x0,x1,x2x_{0},x_{1},x_{2}, and other than these letters and all other bound variables used below.

The tangent. By The Tangent Function on (−π/2,π/2)(-\pi/2,\pi/2) (i), tan⁡\tan is a map J→RJ\to\mathbb{R} with tan⁡t=sin⁡t/cos⁡t\tan t=\sin t/\cos t for every t∈Jt\in J, where sin⁡,cos⁡:R→R\sin,\cos:\mathbb{R}\to\mathbb{R} are the sine and the cosine. For t∈Jt\in J we have cos⁡t>0\cos t>0 by The Cosine Is Positive on (−π/2,π/2)(-\pi/2,\pi/2) (i), so cos⁡t≠0\cos t\neq0, and hence, for every y∈Ry\in\mathbb{R},

y⋅cos⁡t=sin⁡t  ⟺  y=sin⁡tcos⁡t=tan⁡t.y\cdot\cos t=\sin t\iff y=\frac{\sin t}{\cos t}=\tan t .

The function tan⁡\tan is a set: as a map J→RJ\to\mathbb{R} it lies in the class RJ\mathbb{R}^{J} of functions from JJ to R\mathbb{R} by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i), JJ and R\mathbb{R} being sets, and elements of classes are sets.

Reading rules. (a) For a map G:A→RG:A\to\mathbb{R}, with AA equal to JJ or R\mathbb{R}, and all sets uu and vv: (u,v)∈G(u,v)\in G if and only if u∈Au\in A and v=G(u)v=G(u), by Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (ii). (b) For u,v∈Ru,v\in\mathbb{R} and every set gg: ((u,v),g)∈+((u,v),g)\in{+} if and only if g=u+vg=u+v, and ((u,v),g)∈⋅((u,v),g)\in{\cdot} if and only if g=u⋅vg=u\cdot v, by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (xi) for the binary operations of R\mathbb{R} (The Real Numbers (iii)); and for real uu and vv, (u,v)∈<(u,v)\in{<} says u<vu<v (Partial and Total Orders on a Set and the Associated Strict Relation (iii)). (c) By Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii) and Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iv), each formula of the form (⋅,⋅)∈⋅(\cdot,\cdot)\in\cdot or ((⋅,⋅),⋅)∈⋅((\cdot,\cdot),\cdot)\in\cdot written below is predicative and, when sets are assigned to the variables inside the pairs, holds if and only if the corresponding membership of ordered pairs holds; the values of 00 and π\pi are sets, as noted at the start. Each formula below is built from such formulas, from membership in the parameter R\mathbb{R} and from formulas already shown predicative by connectives and quantifiers over set variables, with abbreviations as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (vi); so it is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i).

The cosine and the sine. Kit for def:sine-cosine-real (i) and Kit for def:sine-cosine-real (ii), for one variable and the position 00, give predicative formulas in x0x_{0} expressing that x0x_{0} is the cosine function and that x0x_{0} is the sine function; their parameters are among those of the statement. By Renaming and Substituting Variables in Predicative Formulas (i) with k=1k=1, n=3n=3 and σ(0)=1\sigma(0)=1, respectively σ(0)=2\sigma(0)=2, they become predicative formulas γcos⁡(C)\gamma_{\cos}(C) and γsin⁡(S)\gamma_{\sin}(S) in x0,x1,x2x_{0},x_{1},x_{2}, with bound variables renamed to differ from the letters above, that hold exactly when CC is the cosine function and when SS is the sine function, respectively. The functions cos⁡\cos and sin⁡\sin are sets: as maps R→R\mathbb{R}\to\mathbb{R} they lie in the class RR\mathbb{R}^{\mathbb{R}} of functions from R\mathbb{R} to R\mathbb{R} by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i). Hence cos⁡\cos is the only set CC with γcos⁡(C)\gamma_{\cos}(C), and sin⁡\sin is the only set SS with γsin⁡(S)\gamma_{\sin}(S).

The interval. Let

δ(t)=t∈R∧∃g ∃h (((t,t),g)∈+∧(g,π)∈<∧((g,π),h)∈+∧(0,h)∈<).\delta(t)=t\in\mathbb{R}\wedge\exists g\,\exists h\,\bigl(((t,t),g)\in{+}\wedge(g,\pi)\in{<}\wedge((g,\pi),h)\in{+}\wedge(0,h)\in{<}\bigr).

Assign a set to tt; as δ(t)\delta(t) requires t∈Rt\in\mathbb{R}, and J⊆RJ\subseteq\mathbb{R}, let t∈Rt\in\mathbb{R}. By (b), the conjuncts inside the quantifiers say that g=t+tg=t+t, g<πg<\pi, h=(t+t)+πh=(t+t)+\pi and 0<h0<h; such gg and hh exist and are sets, as elements of R\mathbb{R}. So δ(t)\delta(t) holds if and only if t∈Rt\in\mathbb{R}, t+t<πt+t<\pi and 0<(t+t)+π0<(t+t)+\pi, that is, −π<2t<π-\pi<2t<\pi, or equivalently −π/2<t<π/2-\pi/2<t<\pi/2. By Intervals of the Real Line (ii), for every set tt, δ(t)\delta(t) holds if and only if t∈Jt\in J.

Maps on the interval. Let Φ(F)\Phi(F) be the formula of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vi), with bound variables distinct from those above, which holds exactly when FF is a function, and let

μJ(F)=Φ(F)∧∀u (δ(u)⇔∃v ((u,v)∈F))∧∀u ∀v ((u,v)∈F⇒v∈R).\mu_{J}(F)=\Phi(F)\wedge\forall u\,\bigl(\delta(u)\Leftrightarrow\exists v\,((u,v)\in F)\bigr)\wedge\forall u\,\forall v\,\bigl((u,v)\in F\Rightarrow v\in\mathbb{R}\bigr).

As δ(u)\delta(u) holds for a set uu exactly when u∈Ju\in J, μJ(F)\mu_{J}(F) holds if and only if the formula μ(F,A,B)\mu(F,A,B) of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vii) holds with JJ and R\mathbb{R} assigned to AA and BB, that is, if and only if FF is a map F:J→RF:J\to\mathbb{R}.

The tangent as a formula. Let

φ=μJ(F)∧∃C ∃S (γcos⁡(C)∧γsin⁡(S)∧∀t ∀y ∀c ∀s (((t,y)∈F∧(t,c)∈C∧(t,s)∈S)⇒((y,c),s)∈⋅)).\varphi=\mu_{J}(F)\wedge\exists C\,\exists S\,\Bigl(\gamma_{\cos}(C)\wedge\gamma_{\sin}(S)\wedge\forall t\,\forall y\,\forall c\,\forall s\,\bigl(((t,y)\in F\wedge(t,c)\in C\wedge(t,s)\in S)\Rightarrow((y,c),s)\in{\cdot}\bigr)\Bigr).

Assign to FF a map J→RJ\to\mathbb{R}. As cos⁡\cos and sin⁡\sin are the only sets with γcos⁡\gamma_{\cos} and γsin⁡\gamma_{\sin}, the existential conjunct of φ\varphi holds if and only if its universal formula holds with CC assigned cos⁡\cos and SS assigned sin⁡\sin. Then, by (a), the premises of the implication say that t∈Jt\in J, y=F(t)y=F(t), c=cos⁡tc=\cos t and s=sin⁡ts=\sin t, as J⊆RJ\subseteq\mathbb{R}; these exist for every t∈Jt\in J and are sets, as elements of R\mathbb{R}. By (b) the conclusion then says sin⁡t=F(t)⋅cos⁡t\sin t=F(t)\cdot\cos t, as F(t)F(t) and cos⁡t\cos t are real numbers. So φ\varphi holds if and only if FF is a map J→RJ\to\mathbb{R} with

F(t)⋅cos⁡t=sin⁡tfor every t∈J,F(t)\cdot\cos t=\sin t\qquad\text{for every }t\in J,

that is, by the paragraph on the tangent, with F(t)=tan⁡tF(t)=\tan t for every t∈Jt\in J. As tan⁡\tan is such a map, this holds if and only if F=tan⁡F=\tan, by Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iii). Thus φ\varphi, whose only free variable other than parameters is FF, that is x0x_{0}, is a predicative formula in x0x_{0} in the sense of Renaming and Substituting Variables in Predicative Formulas, and it holds exactly when x0x_{0} is the tangent function.

Any position. By Renaming and Substituting Variables in Predicative Formulas (i) with k=1k=1 and σ(0)=i\sigma(0)=i, the formula φ(xi)\varphi(x_{i}) is a predicative formula in x0,…,xn−1x_{0},\dots,x_{n-1} that holds, under every assignment of sets to x0,…,xn−1x_{0},\dots,x_{n-1}, exactly when xix_{i} is the tangent function. This proves (i).

The class. The Class Comprehension Theorem for Predicative Formulas (i), applied to φ\varphi with x0x_{0} as its single variable and the parameters of the statement as its parameters, gives a class TT whose set elements are exactly the sets that are the tangent function (the one-entry tuple ⟨a⟩\langle a\rangle is aa, The Ordered Pair of Two Sets and Nested Tuples (ii)). It serves as the TT of (ii), since every element of a class is a set (Classes, Membership, Sets and Proper Classes (i)), and so is tan⁡\tan, as shown in the paragraph on the tangent.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…