Nuprl Lemma : is_list_pair_lemma
∀b,a:Top. (is-list(<a, b>) ~ is-list(snd(<a, b>)))
Proof
Definitions occuring in Statement :
is-list: is-list(t),
top: Top,
pi2: snd(t),
all: ∀x:A. B[x],
pair: <a, b>,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
is-list: is-list(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. (is-list(<a, b>) \msim{} is-list(snd(<a, b>)))
Date html generated:
2016_05_15-PM-10_07_31
Last ObjectModification:
2015_12_27-PM-06_00_46
Theory : eval!all
Home
Index