Nuprl Lemma : sine-approx_wf

∀[x:ℝ]. ∀[k:ℕ]. ∀[N:ℕ+].  (sine-approx(x;k;N) ∈ ℤ)


Proof




Definitions occuring in Statement :  sine-approx: sine-approx(x;k;N),  real: ℝ,  nat_plus: ℕ+,  nat: ℕ,  uall: ∀[x:A]. B[x],  member: t ∈ T,  int: ℤ
Definitions unfolded in proof :  uall: ∀[x:A]. B[x],  member: t ∈ T,  sine-approx: sine-approx(x;k;N),  has-value: (a)↓,  uimplies: b supposing a,  true: True,  nequal: a ≠ b ∈ T ,  not: ¬A,  implies: P ⇒ Q,  sq_type: SQType(T),  all: ∀x:A. B[x],  guard: {T},  false: False,  bool: 𝔹,  unit: Unit,  it: ⋅,  btrue: tt,  uiff: uiff(P;Q),  and: P ∧ Q,  ifthenelse: if b then t else f fi ,  nat: ℕ,  nat_plus: ℕ+,  ge: i ≥ j ,  decidable: Dec(P),  or: P ∨ Q,  satisfiable_int_formula: satisfiable_int_formula(fmla),  exists: ∃x:A. B[x],  top: Top,  prop: ℙ,  subtype_rel: A ⊆r B,  bfalse: ff,  bnot: ¬bb,  assert: ↑b,  real: ℝ,  int_nzero: ℤ-o
Lemmas referenced :  value-type-has-value,  int-value-type,  poly-approx_wf,  subtype_base_sq,  int_subtype_base,  istype-int,  eqtt_to_assert,  assert_of_eq_int,  int-rdiv_wf,  fact_wf,  nat_properties,  nat_plus_properties,  decidable__le,  full-omega-unsat,  intformand_wf,  intformnot_wf,  intformle_wf,  itermConstant_wf,  itermAdd_wf,  itermMultiply_wf,  itermVar_wf,  int_formula_prop_and_lemma,  istype-void,  int_formula_prop_not_lemma,  int_formula_prop_le_lemma,  int_term_value_constant_lemma,  int_term_value_add_lemma,  int_term_value_mul_lemma,  int_term_value_var_lemma,  int_formula_prop_wf,  istype-le,  eqff_to_assert,  bool_cases_sqequal,  bool_subtype_base,  assert-bnot,  neg_assert_of_eq_int,  rnexp_wf,  absval_wf,  add_nat_plus,  decidable__lt,  intformless_wf,  int_formula_prop_less_lemma,  istype-less_than,  add-is-int-iff,  intformeq_wf,  int_formula_prop_eq_lemma,  false_wf,  eq_int_wf,  int-to-real_wf,  bool_wf,  mul_nzero,  nequal_wf,  istype-nat,  nat_plus_wf,  real_wf
Rules used in proof :  sqequalSubstitution,  sqequalTransitivity,  computationStep,  sqequalReflexivity,  isect_memberFormation_alt,  introduction,  cut,  sqequalRule,  callbyvalueReduce,  extract_by_obid,  sqequalHypSubstitution,  isectElimination,  thin,  intEquality,  independent_isectElimination,  hypothesis,  because_Cache,  lambdaEquality_alt,  remainderEquality,  natural_numberEquality,  lambdaFormation_alt,  instantiate,  cumulativity,  dependent_functionElimination,  equalityTransitivity,  equalitySymmetry,  independent_functionElimination,  voidElimination,  equalityIstype,  baseClosed,  sqequalBase,  inhabitedIsType,  unionElimination,  equalityElimination,  productElimination,  dependent_set_memberEquality_alt,  addEquality,  multiplyEquality,  setElimination,  rename,  hypothesisEquality,  approximateComputation,  dependent_pairFormation_alt,  int_eqEquality,  isect_memberEquality_alt,  independent_pairFormation,  universeIsType,  applyEquality,  promote_hyp,  applyLambdaEquality,  pointwiseFunctionality,  baseApply,  closedConclusion,  divideEquality,  minusEquality,  axiomEquality,  isectIsTypeImplies

Latex:
\mforall{}[x:\mBbbR{}].  \mforall{}[k:\mBbbN{}].  \mforall{}[N:\mBbbN{}\msupplus{}].    (sine-approx(x;k;N)  \mmember{}  \mBbbZ{})



Date html generated: 2019_10_29-AM-10_31_15
Last ObjectModification: 2019_01_30-PM-00_35_53

Theory : reals


Home Index