Nuprl Lemma : qexp-positive
∀[n:ℕ]. ∀[r:ℚ]. 0 < r ↑ n supposing 0 < r
Proof
Definitions occuring in Statement :
qexp: r ↑ n,
qless: r < s,
rationals: ℚ,
nat: ℕ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
natural_number: $n
Definitions unfolded in proof :
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,
all: ∀x:A. B[x],
top: Top,
and: P ∧ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
squash: ↓T,
true: True,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
qless: r < s,
grp_lt: a < b,
set_lt: a <p b,
assert: ↑b,
ifthenelse: if b then t else f fi ,
set_blt: a <b b,
band: p ∧b q,
infix_ap: x f y,
set_le: ≤b,
pi2: snd(t),
oset_of_ocmon: g↓oset,
dset_of_mon: g↓set,
grp_le: ≤b,
pi1: fst(t),
qadd_grp: <ℚ+>,
q_le: q_le(r;s),
callbyvalueall: callbyvalueall,
evalall: evalall(t),
bor: p ∨bq,
qpositive: qpositive(r),
qsub: r - s,
qadd: r + s,
qmul: r * s,
btrue: tt,
lt_int: i <z j,
bnot: ¬bb,
bfalse: ff,
qeq: qeq(r;s),
eq_int: (i =z j),
le: A ≤ B,
less_than': less_than'(a;b),
decidable: Dec(P),
or: P ∨ Q,
nat_plus: ℕ+,
cand: A c∧ B
Lemmas referenced :
nat_wf,
int-subtype-rationals,
qmul_wf,
qmul-positive,
exp_unroll_q,
int_term_value_subtract_lemma,
int_formula_prop_not_lemma,
itermSubtract_wf,
intformnot_wf,
subtract_wf,
decidable__le,
le_wf,
false_wf,
iff_weakening_equal,
qexp-zero,
true_wf,
squash_wf,
rationals_wf,
qless_wf,
qexp_wf,
qless_witness,
less_than_wf,
ge_wf,
int_formula_prop_wf,
int_formula_prop_less_lemma,
int_term_value_var_lemma,
int_term_value_constant_lemma,
int_formula_prop_le_lemma,
int_formula_prop_and_lemma,
intformless_wf,
itermVar_wf,
itermConstant_wf,
intformle_wf,
intformand_wf,
satisfiable-full-omega-tt,
nat_properties
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
setElimination,
rename,
intWeakElimination,
lambdaFormation,
natural_numberEquality,
independent_isectElimination,
dependent_pairFormation,
lambdaEquality,
int_eqEquality,
intEquality,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
sqequalRule,
independent_pairFormation,
computeAll,
independent_functionElimination,
applyEquality,
because_Cache,
equalityTransitivity,
equalitySymmetry,
imageElimination,
imageMemberEquality,
baseClosed,
universeEquality,
productElimination,
dependent_set_memberEquality,
unionElimination,
inlFormation,
productEquality,
minusEquality
Latex:
\mforall{}[n:\mBbbN{}]. \mforall{}[r:\mBbbQ{}]. 0 < r \muparrow{} n supposing 0 < r
Date html generated:
2016_05_15-PM-11_09_05
Last ObjectModification:
2016_01_16-PM-09_27_02
Theory : rationals
Home
Index