Nuprl Lemma : ireal-approx_wf

[j:ℕ]. ∀[x:ℝ]. ∀[M:ℕ+]. ∀[z:ℤ].  (j-approx(x;M;z) ∈ ℙ)


Proof




Definitions occuring in Statement :  ireal-approx: j-approx(x;M;z) real: nat_plus: + nat: uall: [x:A]. B[x] prop: member: t ∈ T int:
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T ireal-approx: j-approx(x;M;z) nat_plus: + uimplies: supposing a rneq: x ≠ y guard: {T} or: P ∨ Q all: x:A. B[x] iff: ⇐⇒ Q and: P ∧ Q rev_implies:  Q implies:  Q nat: ge: i ≥  decidable: Dec(P) not: ¬A satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] false: False top: Top prop:
Lemmas referenced :  rleq_wf rabs_wf rsub_wf rdiv_wf int-to-real_wf rless-int nat_plus_properties nat_properties decidable__lt full-omega-unsat intformand_wf intformnot_wf intformless_wf itermConstant_wf itermMultiply_wf itermVar_wf int_formula_prop_and_lemma int_formula_prop_not_lemma int_formula_prop_less_lemma int_term_value_constant_lemma int_term_value_mul_lemma int_term_value_var_lemma int_formula_prop_wf rless_wf nat_plus_wf real_wf nat_wf
Rules used in proof :  sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation introduction cut sqequalRule extract_by_obid sqequalHypSubstitution isectElimination thin hypothesisEquality hypothesis multiplyEquality natural_numberEquality setElimination rename because_Cache independent_isectElimination inrFormation dependent_functionElimination productElimination independent_functionElimination unionElimination approximateComputation dependent_pairFormation lambdaEquality int_eqEquality intEquality isect_memberEquality voidElimination voidEquality independent_pairFormation axiomEquality equalityTransitivity equalitySymmetry

Latex:
\mforall{}[j:\mBbbN{}].  \mforall{}[x:\mBbbR{}].  \mforall{}[M:\mBbbN{}\msupplus{}].  \mforall{}[z:\mBbbZ{}].    (j-approx(x;M;z)  \mmember{}  \mBbbP{})



Date html generated: 2018_05_22-PM-01_58_43
Last ObjectModification: 2017_10_25-AM-10_19_21

Theory : reals


Home Index