Nuprl Lemma : has-valueall-append-nil
∀[l:Base]. l @ [] ~ l supposing has-valueall(l @ [])
Proof
Definitions occuring in Statement :
append: as @ bs,
nil: [],
has-valueall: has-valueall(a),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
base: Base,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
has-valueall: has-valueall(a),
prop: ℙ
Lemmas referenced :
base_wf,
has-valueall_wf_base,
evalall-append-nil,
evalall-sqequal
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalHypSubstitution,
lemma_by_obid,
isectElimination,
thin,
sqequalRule,
baseApply,
closedConclusion,
baseClosed,
hypothesisEquality,
independent_isectElimination,
hypothesis,
sqequalAxiom,
isect_memberEquality,
because_Cache,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[l:Base]. l @ [] \msim{} l supposing has-valueall(l @ [])
Date html generated:
2016_05_14-AM-06_32_37
Last ObjectModification:
2016_01_14-PM-08_23_41
Theory : list_0
Home
Index