Nuprl Lemma : remove-repeats-fun-nil
∀[eq,f:Top]. (remove-repeats-fun(eq;f;[]) ~ [])
Proof
Definitions occuring in Statement :
remove-repeats-fun: remove-repeats-fun(eq;f;L),
nil: [],
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
remove-repeats-fun: remove-repeats-fun(eq;f;L),
all: ∀x:A. B[x],
so_lambda: so_lambda(x,y,z.t[x; y; z]),
member: t ∈ T,
top: Top,
so_apply: x[s1;s2;s3],
uall: ∀[x:A]. B[x]
Lemmas referenced :
list_ind_nil_lemma,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
cut,
lemma_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
isect_memberFormation,
introduction,
sqequalAxiom,
isectElimination,
hypothesisEquality,
because_Cache
Latex:
\mforall{}[eq,f:Top]. (remove-repeats-fun(eq;f;[]) \msim{} [])
Date html generated:
2016_05_14-PM-03_28_23
Last ObjectModification:
2015_12_26-PM-06_24_03
Theory : decidable!equality
Home
Index