Nuprl Lemma : s_tl_cons_lemma
∀b,a:Top. (s-tl(a.b) ~ b)
Proof
Definitions occuring in Statement :
s-cons: x.s,
s-tl: s-tl(s),
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
s-cons: x.s,
s-tl: s-tl(s),
pi2: snd(t)
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}b,a:Top. (s-tl(a.b) \msim{} b)
Date html generated:
2016_05_14-AM-06_22_34
Last ObjectModification:
2015_12_26-AM-11_59_18
Theory : co-recursion
Home
Index