Nuprl Lemma : quicksort-int-nil
quicksort-int([]) ~ []
Proof
Definitions occuring in Statement :
quicksort-int: quicksort-int(L),
nil: [],
sqequal: s ~ t
Definitions unfolded in proof :
quicksort-int: quicksort-int(L),
quicksort: quicksort(cmp;L),
callbyvalueall: callbyvalueall,
evalall: evalall(t),
filter: filter(P;l),
reduce: reduce(f;k;as),
list_ind: list_ind,
nil: [],
it: ⋅,
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
ifthenelse: if b then t else f fi ,
btrue: tt
Lemmas referenced :
null_nil_lemma,
filter_nil_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
sqequalRule,
cut,
lemma_by_obid,
hypothesis,
callbyvalueReduce,
sqleReflexivity,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
quicksort-int([]) \msim{} []
Date html generated:
2016_05_15-PM-04_30_30
Last ObjectModification:
2015_12_27-PM-02_50_10
Theory : general
Home
Index