Nuprl Lemma : length-reverse
∀[L:Top]. (||rev(L)|| ~ ||L||)
Proof
Definitions occuring in Statement :
length: ||as||,
reverse: rev(as),
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
reverse: rev(as),
top: Top,
uimplies: b supposing a,
implies: P ⇒ Q,
all: ∀x:A. B[x],
prop: ℙ
Lemmas referenced :
top_wf,
has-value_wf_base,
base_wf,
length_wf,
list-if-has-value-length,
add-zero-base,
length_of_nil_lemma,
length-rev-append
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
baseApply,
closedConclusion,
baseClosed,
independent_isectElimination,
lambdaFormation,
dependent_functionElimination,
sqequalAxiom
Latex:
\mforall{}[L:Top]. (||rev(L)|| \msim{} ||L||)
Date html generated:
2016_05_14-AM-06_41_15
Last ObjectModification:
2016_01_14-PM-08_19_37
Theory : list_0
Home
Index