Nuprl Lemma : qexp-qmul
∀[a,b:ℚ]. ∀[n:ℕ]. (a * b ↑ n = (a ↑ n * b ↑ n) ∈ ℚ)
Proof
Definitions occuring in Statement :
qexp: r ↑ n,
qmul: r * s,
rationals: ℚ,
nat: ℕ,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
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: ℙ,
decidable: Dec(P),
or: P ∨ Q,
true: True,
squash: ↓T,
subtype_rel: A ⊆r B,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
nat_plus: ℕ+
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,
decidable__le,
subtract_wf,
intformnot_wf,
itermSubtract_wf,
int_formula_prop_not_lemma,
int_term_value_subtract_lemma,
nat_wf,
rationals_wf,
qmul_wf,
equal_wf,
int-subtype-rationals,
qmul_ident,
iff_weakening_equal,
qexp_wf,
squash_wf,
true_wf,
exp_zero_q,
exp_unroll_q,
le_wf,
qmul_assoc_qrng,
qmul_ac_1_qrng
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
extract_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,
axiomEquality,
unionElimination,
because_Cache,
applyEquality,
imageElimination,
imageMemberEquality,
baseClosed,
equalityTransitivity,
equalitySymmetry,
productElimination,
dependent_set_memberEquality,
universeEquality,
hyp_replacement,
applyLambdaEquality
Latex:
\mforall{}[a,b:\mBbbQ{}]. \mforall{}[n:\mBbbN{}]. (a * b \muparrow{} n = (a \muparrow{} n * b \muparrow{} n))
Date html generated:
2018_05_22-AM-00_01_04
Last ObjectModification:
2017_07_26-PM-06_49_52
Theory : rationals
Home
Index