Nuprl Lemma : exp-convex
∀[a,b,c:ℕ]. ∀[n:ℕ+].  |a - b| ≤ c supposing |a^n - b^n| ≤ c^n
Proof
Definitions occuring in Statement : 
exp: i^n
, 
absval: |i|
, 
nat_plus: ℕ+
, 
nat: ℕ
, 
uimplies: b supposing a
, 
uall: ∀[x:A]. B[x]
, 
le: A ≤ B
, 
subtract: n - m
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
all: ∀x:A. B[x]
, 
nat_plus: ℕ+
, 
implies: P 
⇒ Q
, 
uimplies: b supposing a
, 
le: A ≤ B
, 
and: P ∧ Q
, 
not: ¬A
, 
false: False
, 
nat: ℕ
, 
subtype_rel: A ⊆r B
, 
prop: ℙ
, 
ge: i ≥ j 
, 
decidable: Dec(P)
, 
or: P ∨ Q
, 
satisfiable_int_formula: satisfiable_int_formula(fmla)
, 
exists: ∃x:A. B[x]
, 
top: Top
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
true: True
, 
less_than': less_than'(a;b)
, 
iff: P 
⇐⇒ Q
, 
rev_implies: P 
⇐ Q
, 
uiff: uiff(P;Q)
, 
subtract: n - m
, 
squash: ↓T
, 
guard: {T}
, 
bool: 𝔹
, 
unit: Unit
, 
it: ⋅
, 
btrue: tt
, 
ifthenelse: if b then t else f fi 
, 
bfalse: ff
, 
sq_type: SQType(T)
, 
bnot: ¬bb
, 
assert: ↑b
, 
less_than: a < b
Lemmas referenced : 
mul_preserves_le, 
less_than_transitivity2, 
mul_preserves_lt, 
int_term_value_mul_lemma, 
itermMultiply_wf, 
set_subtype_base, 
exp_preserves_lt, 
imin_unfold, 
assert-bnot, 
bool_subtype_base, 
bool_cases_sqequal, 
equal_wf, 
eqff_to_assert, 
assert_of_le_int, 
eqtt_to_assert, 
bool_wf, 
le_int_wf, 
imax_unfold, 
int_subtype_base, 
subtype_base_sq, 
absval-diff-symmetry, 
exp_preserves_le, 
exp_wf4, 
absval-diff-product-bound, 
multiply-is-int-iff, 
exp_step, 
iff_weakening_equal, 
exp1, 
true_wf, 
squash_wf, 
add-subtract-cancel, 
less_than_wf, 
le-add-cancel, 
add-zero, 
add-associates, 
add_functionality_wrt_le, 
add-commutes, 
minus-one-mul-top, 
zero-add, 
minus-one-mul, 
minus-add, 
condition-implies-le, 
less-iff-le, 
not-lt-2, 
decidable__lt, 
false_wf, 
nat_wf, 
nat_plus_wf, 
nat_plus_subtype_nat, 
primrec-wf-nat-plus, 
isect_wf, 
int_formula_prop_wf, 
int_formula_prop_less_lemma, 
int_term_value_var_lemma, 
int_term_value_add_lemma, 
int_term_value_constant_lemma, 
int_formula_prop_le_lemma, 
int_formula_prop_not_lemma, 
int_formula_prop_and_lemma, 
intformless_wf, 
itermVar_wf, 
itermAdd_wf, 
itermConstant_wf, 
intformle_wf, 
intformnot_wf, 
intformand_wf, 
satisfiable-full-omega-tt, 
decidable__le, 
nat_properties, 
exp_wf2, 
le_wf, 
subtract_wf, 
absval_wf, 
less_than'_wf, 
nat_plus_properties
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
thin, 
lambdaFormation, 
rename, 
lemma_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
hypothesisEquality, 
hypothesis, 
setElimination, 
sqequalRule, 
productElimination, 
independent_pairEquality, 
lambdaEquality, 
dependent_functionElimination, 
voidElimination, 
applyEquality, 
because_Cache, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry, 
dependent_set_memberEquality, 
addEquality, 
natural_numberEquality, 
unionElimination, 
independent_isectElimination, 
dependent_pairFormation, 
int_eqEquality, 
intEquality, 
isect_memberEquality, 
voidEquality, 
independent_pairFormation, 
computeAll, 
cumulativity, 
universeEquality, 
isectEquality, 
independent_functionElimination, 
minusEquality, 
addLevel, 
imageElimination, 
imageMemberEquality, 
baseClosed, 
pointwiseFunctionality, 
promote_hyp, 
baseApply, 
closedConclusion, 
multiplyEquality, 
instantiate, 
equalityEquality, 
equalityElimination, 
setEquality
Latex:
\mforall{}[a,b,c:\mBbbN{}].  \mforall{}[n:\mBbbN{}\msupplus{}].    |a  -  b|  \mleq{}  c  supposing  |a\^{}n  -  b\^{}n|  \mleq{}  c\^{}n
Date html generated:
2016_05_15-PM-04_45_33
Last ObjectModification:
2016_01_16-AM-11_25_32
Theory : general
Home
Index