Nuprl Lemma : before_nil_lemma
∀u,a:Top. (before(u;[]) ~ tt)
Proof
Definitions occuring in Statement :
before: before(u;ps),
nil: [],
btrue: tt,
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
before: before(u;ps),
member: t ∈ T,
top: Top
Lemmas referenced :
null_nil_lemma,
testxxx_lemma,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
sqequalRule,
lemma_by_obid,
hypothesis,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
\mforall{}u,a:Top. (before(u;[]) \msim{} tt)
Date html generated:
2016_05_16-AM-08_14_56
Last ObjectModification:
2015_12_28-PM-06_28_50
Theory : polynom_2
Home
Index