Nuprl Lemma : before_cons_lemma
∀vs,v,u,a:Top. (before(u;[v / vs]) ~ v <b u)
Proof
Definitions occuring in Statement :
before: before(u;ps),
cons: [a / b],
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t,
set_blt: a <b b
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
before: before(u;ps),
top: Top,
bor: p ∨bq,
ifthenelse: if b then t else f fi ,
bfalse: ff
Lemmas referenced :
top_wf,
null_cons_lemma,
reduce_hd_cons_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{}vs,v,u,a:Top. (before(u;[v / vs]) \msim{} v <\msubb{} u)
Date html generated:
2016_05_16-AM-08_14_57
Last ObjectModification:
2015_12_28-PM-06_28_51
Theory : polynom_2
Home
Index