Nuprl Lemma : qv-mul_wf
∀[r:ℚ]. ∀[bs:ℚ List]. (qv-mul(r;bs) ∈ ℚ List)
Proof
Definitions occuring in Statement :
qv-mul: qv-mul(r;bs),
rationals: ℚ,
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
qv-mul: qv-mul(r;bs)
Lemmas referenced :
map_wf,
rationals_wf,
qmul_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
hypothesisEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[r:\mBbbQ{}]. \mforall{}[bs:\mBbbQ{} List]. (qv-mul(r;bs) \mmember{} \mBbbQ{} List)
Date html generated:
2016_05_15-PM-11_20_42
Last ObjectModification:
2015_12_27-PM-07_33_10
Theory : rationals
Home
Index