Nuprl Lemma : cubic_converge_wf
∀b:{9...}. ∀m:ℕ. (cubic_converge(b;m) ∈ {n:ℕ| m ≤ b^3^n} )
Proof
Definitions occuring in Statement :
cubic_converge: cubic_converge(b;m),
exp: i^n,
int_upper: {i...},
nat: ℕ,
le: A ≤ B,
all: ∀x:A. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
natural_number: $n
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
member: t ∈ T,
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
int_seg: {i..j-},
int_upper: {i...},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
subtype_rel: A ⊆r B,
le: A ≤ B,
less_than': less_than'(a;b),
less_than: a < b,
cubic_converge: cubic_converge(b;m),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
squash: ↓T,
true: True,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
nat_plus: ℕ+,
has-value: (a)↓,
exp: i^n,
primrec: primrec(n;b;c),
subtract: n - m,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
nat_properties,
satisfiable-full-omega-tt,
intformand_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
int_formula_prop_and_lemma,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_var_lemma,
int_formula_prop_less_lemma,
int_formula_prop_wf,
ge_wf,
less_than_wf,
int_seg_wf,
int_seg_properties,
int_upper_properties,
decidable__le,
subtract_wf,
intformnot_wf,
itermSubtract_wf,
int_formula_prop_not_lemma,
int_term_value_subtract_lemma,
decidable__equal_int,
int_seg_subtype,
false_wf,
intformeq_wf,
int_formula_prop_eq_lemma,
le_wf,
decidable__lt,
lelt_wf,
itermAdd_wf,
int_term_value_add_lemma,
nat_wf,
int_upper_wf,
le_int_wf,
bool_wf,
eqtt_to_assert,
assert_of_le_int,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
exp0_lemma,
squash_wf,
true_wf,
exp1,
iff_weakening_equal,
exp_wf2,
exp_wf4,
iroot-property,
iroot_wf,
value-type-has-value,
int-value-type,
add_nat_wf,
member-less_than,
subtract-add-cancel,
int_subtype_base,
exp_preserves_lt,
exp_preserves_le,
le_weakening2,
set_wf,
set-value-type,
int_upper_subtype_nat,
exp_mul,
exp-positive,
not-lt-2,
condition-implies-le,
minus-add,
minus-one-mul,
zero-add,
minus-one-mul-top,
add-commutes,
add_functionality_wrt_le,
add-associates,
add-zero,
le-add-cancel,
exp_add
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
thin,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
setElimination,
rename,
sqequalRule,
intWeakElimination,
natural_numberEquality,
independent_isectElimination,
dependent_pairFormation,
lambdaEquality,
int_eqEquality,
intEquality,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
independent_functionElimination,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
because_Cache,
productElimination,
unionElimination,
applyEquality,
applyLambdaEquality,
hypothesis_subsumption,
dependent_set_memberEquality,
addEquality,
equalityElimination,
promote_hyp,
instantiate,
cumulativity,
imageElimination,
imageMemberEquality,
baseClosed,
universeEquality,
callbyvalueReduce,
productEquality,
setEquality,
equalityUniverse,
levelHypothesis,
minusEquality,
multiplyEquality
Latex:
\mforall{}b:\{9...\}. \mforall{}m:\mBbbN{}. (cubic\_converge(b;m) \mmember{} \{n:\mBbbN{}| m \mleq{} b\^{}3\^{}n\} )
Date html generated:
2017_10_04-PM-10_24_59
Last ObjectModification:
2017_07_28-AM-08_48_58
Theory : reals_2
Home
Index