Nuprl Lemma : oal_merge_right_nil_lemma
∀ps,p,b,a:Top. ([p / ps] ++ [] ~ [p / ps])
Proof
Definitions occuring in Statement :
oal_merge: ps ++ qs,
cons: [a / b],
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,
top: Top,
ifthenelse: if b then t else f fi ,
bfalse: ff,
btrue: tt
Lemmas referenced :
top_wf,
null_cons_lemma,
null_nil_lemma,
reduce_hd_cons_lemma,
reduce_tl_cons_lemma,
reduce_tl_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{}ps,p,b,a:Top. ([p / ps] ++ [] \msim{} [p / ps])
Date html generated:
2016_05_16-AM-08_17_28
Last ObjectModification:
2015_12_28-PM-06_27_11
Theory : polynom_2
Home
Index