Nuprl Lemma : oal_merge_left_nil_lemma
∀qs,b,a:Top. ([] ++ qs ~ qs)
Proof
Definitions occuring in Statement :
oal_merge: ps ++ qs,
nil: [],
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
oal_merge: ps ++ qs,
ycomb: Y,
ifthenelse: if b then t else f fi ,
btrue: tt
Lemmas referenced :
top_wf,
null_nil_lemma,
reduce_tl_nil_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}qs,b,a:Top. ([] ++ qs \msim{} qs)
Date html generated:
2016_05_16-AM-08_17_25
Last ObjectModification:
2015_12_28-PM-06_27_16
Theory : polynom_2
Home
Index