Nuprl Lemma : sd_ordered_nil_lemma
∀s:Top. (sd_ordered([]) ~ tt)
Proof
Definitions occuring in Statement :
sd_ordered: sd_ordered(as),
nil: [],
btrue: tt,
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
sd_ordered: sd_ordered(as),
ycomb: Y,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
top: Top,
so_apply: x[s1;s2;s3]
Lemmas referenced :
top_wf,
list_ind_nil_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
\mforall{}s:Top. (sd\_ordered([]) \msim{} tt)
Date html generated:
2016_05_16-AM-08_15_06
Last ObjectModification:
2015_12_28-PM-06_28_46
Theory : polynom_2
Home
Index