Nuprl Lemma : ml-reduce_wf
∀[A,B:Type].
(∀[f:A ⟶ B ⟶ B]. ∀[l:A List]. ∀[b:B]. (ml-reduce(f;b;l) ∈ B)) supposing
((valueall-type(A) ∧ A) and
valueall-type(B))
Proof
Definitions occuring in Statement :
ml-reduce: ml-reduce(f;b;l),
list: T List,
valueall-type: valueall-type(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
and: P ∧ Q,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
and: P ∧ Q
Lemmas referenced :
ml-reduce-sq,
reduce_wf,
list_wf,
valueall-type_wf
Rules used in proof :
cut,
introduction,
extract_by_obid,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
hypothesis,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
independent_isectElimination,
sqequalRule,
cumulativity,
functionExtensionality,
applyEquality,
productElimination,
functionEquality,
because_Cache,
isect_memberEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
productEquality,
universeEquality
Latex:
\mforall{}[A,B:Type].
(\mforall{}[f:A {}\mrightarrow{} B {}\mrightarrow{} B]. \mforall{}[l:A List]. \mforall{}[b:B]. (ml-reduce(f;b;l) \mmember{} B)) supposing
((valueall-type(A) \mwedge{} A) and
valueall-type(B))
Date html generated:
2017_09_29-PM-05_51_01
Last ObjectModification:
2017_05_10-PM-06_59_12
Theory : ML
Home
Index