TheoremBase

Each bracket is the value of the canonical projection, a map onto the quotient, at a pair term, so the typing of values of maps and of pairs applies.

Proof

Terms under γ\gamma, their values and terms of a type are as in Terms and Typed Terms under a Guard (i) and Terms and Typed Terms under a Guard (ii); throughout, the parameters have their fixed values, as in Conditions Expressed by a Predicative Formula, and Guards (i).

Proof of (i). PP is a set by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii), N\mathbb{N} being a set by The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion (ii), and ∼\sim is an equivalence relation on PP by Construction of the Integers: Pairs of Natural Numbers up to Equal Differences, with Sum, Product, Negation and Order (i). So by Equivalence Classes Partition the Set: Cover, Disjointness and Representatives; the Quotient Is a Set and the Canonical Projection Is a Surjection (vi), π∼\pi_{\sim} is a map from PP to P/∼=ZP/{\sim}=\mathbb{Z} with π∼(p)=[p]∼\pi_{\sim}(p)=[p]_{\sim}, the equivalence class of pp, for every p∈Pp\in P. By Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iv), (s,t)(s,t) is a term of type N×N=P\mathbb{N}\times\mathbb{N}=P under γ\gamma, and by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iii), with π∼\pi_{\sim} for FF, π∼((s,t))\pi_{\sim}((s,t)) is a term of type Z\mathbb{Z} under γ\gamma. Its value, for values aa and bb of ss and tt, is [(a,b)]∼[(a,b)]_{\sim}, which is the class [a,b][a,b] of Construction of the Integers: Pairs of Natural Numbers up to Equal Differences, with Sum, Product, Negation and Order (i).

Proof of (ii). Z\mathbb{Z} is a set by The Integers (i), so QQ is a set by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii), and ≈\approx, which satisfies the condition of Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order (i) by The Relation, Operations, Order and Embedding Defining the Rational Numbers Exist (i), is an equivalence relation on QQ by Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order (i). Here the relation ≈\approx of The Rational Numbers (i), from which Q=Q/≈\mathbb{Q}=Q/{\approx} is formed, is the relation on QQ introduced in Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order, the one with (x,m)≈(y,n)(x,m)\approx(y,n) if and only if x ι(n)=y ι(m)x\,\iota(n)=y\,\iota(m), with ι\iota as in The Integers (v): by The Relation, Operations, Order and Embedding Defining the Rational Numbers Exist (i), it is the unique relation on QQ with this property. So by Equivalence Classes Partition the Set: Cover, Disjointness and Representatives; the Quotient Is a Set and the Canonical Projection Is a Surjection (vi), π≈\pi_{\approx} is a map from QQ to Q/≈=QQ/{\approx}=\mathbb{Q} with π≈(p)=[p]≈\pi_{\approx}(p)=[p]_{\approx} for every p∈Qp\in Q. By Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iv), (s,t)(s,t) is a term of type Z×N=Q\mathbb{Z}\times\mathbb{N}=Q under γ\gamma, and by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iii), with π≈\pi_{\approx} for FF, π≈((s,t))\pi_{\approx}((s,t)) is a term of type Q\mathbb{Q} under γ\gamma, whose value, for values xx and mm of ss and tt, is [(x,m)]≈[(x,m)]_{\approx}, the class [x,m][x,m] of Construction of the Rationals: Pairs of an Integer and a Natural Number up to Equal Ratios, with Sum, Product, Negation and Order (i).

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…