Nuprl Lemma : eager-append_assoc
∀[as,bs,cs:Top List]. (eager-append(eager-append(as;bs);cs) ~ eager-append(as;eager-append(bs;cs)))
Proof
Definitions occuring in Statement :
eager-append: eager-append(as;bs),
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top
Lemmas referenced :
list_wf,
top_wf,
eager-append_wf,
append_assoc,
eager-append-is-append
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
because_Cache,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
hypothesisEquality,
isect_memberEquality,
voidElimination,
voidEquality,
sqequalRule
Latex:
\mforall{}[as,bs,cs:Top List]. (eager-append(eager-append(as;bs);cs) \msim{} eager-append(as;eager-append(bs;cs)))
Date html generated:
2017_09_29-PM-05_48_28
Last ObjectModification:
2017_05_12-PM-11_35_42
Theory : list_0
Home
Index