Nuprl Lemma : rev-append-property-top
∀[as,bs,cs:Top]. (rev(as) + bs @ cs ~ rev(as) + bs @ cs)
Proof
Definitions occuring in Statement :
rev-append: rev(as) + bs,
append: as @ bs,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
rev-append: rev(as) + bs,
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,
prop: ℙ,
guard: {T},
or: P ∨ Q,
squash: ↓T,
append: as @ bs,
list_ind: list_ind,
has-value: (a)↓,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
so_lambda: so_lambda(x,y,z.t[x; y; z]),
top: Top,
so_apply: x[s1;s2;s3]
Lemmas referenced :
top_wf,
sqle_wf_base,
list_ind_cons_lemma,
is-exception_wf,
base_wf,
has-value_wf_base,
sqequal-list_accum
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,
hypothesis,
baseApply,
closedConclusion,
hypothesisEquality,
inrFormation,
imageMemberEquality,
callbyvalueCallbyvalue,
callbyvalueReduce,
callbyvalueExceptionCases,
inlFormation,
imageElimination,
exceptionSqequal,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
divergentSqle,
sqleRule,
sqleReflexivity,
because_Cache,
sqequalAxiom
Latex:
\mforall{}[as,bs,cs:Top]. (rev(as) + bs @ cs \msim{} rev(as) + bs @ cs)
Date html generated:
2016_05_14-AM-06_54_18
Last ObjectModification:
2016_01_14-PM-08_14_30
Theory : list_0
Home
Index