Nuprl Lemma : length-rev-append
∀[as,bs:Top]. (||rev(as) + bs|| ~ ||as|| + ||bs||)
Proof
Definitions occuring in Statement :
length: ||as||,
rev-append: rev(as) + bs,
uall: ∀[x:A]. B[x],
top: Top,
add: n + m,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
rev-append: rev(as) + bs,
length: ||as||,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
strict1: strict1(F),
and: P ∧ Q,
all: ∀x:A. B[x],
implies: P ⇒ Q,
list_ind: list_ind,
has-value: (a)↓,
prop: ℙ,
or: P ∨ Q,
squash: ↓T,
guard: {T},
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top,
false: False,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3]
Lemmas referenced :
sqle_wf_base,
exception-not-value,
sqequal-list_ind,
add-commutes,
add-associates,
int-value-type,
value-type-has-value,
top_wf,
length_of_cons_lemma,
is-exception_wf,
base_wf,
has-value_wf_base,
sqequal-list_accum-list_ind
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
thin,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
baseClosed,
independent_isectElimination,
independent_pairFormation,
lambdaFormation,
callbyvalueCallbyvalue,
hypothesis,
callbyvalueReduce,
baseApply,
closedConclusion,
hypothesisEquality,
callbyvalueExceptionCases,
inlFormation,
imageMemberEquality,
imageElimination,
exceptionSqequal,
inrFormation,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
because_Cache,
sqequalAxiom,
callbyvalueAdd,
productElimination,
equalityTransitivity,
equalitySymmetry,
addExceptionCases,
intEquality,
natural_numberEquality,
sqleReflexivity,
independent_functionElimination,
divergentSqle,
sqleRule
Latex:
\mforall{}[as,bs:Top]. (||rev(as) + bs|| \msim{} ||as|| + ||bs||)
Date html generated:
2016_05_14-AM-06_35_29
Last ObjectModification:
2016_01_14-PM-08_22_58
Theory : list_0
Home
Index