Nuprl Lemma : is_list_fun_pair_lemma
∀b,a,f:Top. (is-list-fun() f <a, b> ~ f (snd(<a, b>)))
Proof
Definitions occuring in Statement :
is-list-fun: is-list-fun(),
top: Top,
pi2: snd(t),
all: ∀x:A. B[x],
apply: f a,
pair: <a, b>,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
is-list-fun: is-list-fun()
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}b,a,f:Top. (is-list-fun() f <a, b> \msim{} f (snd(<a, b>)))
Date html generated:
2016_05_15-PM-10_09_43
Last ObjectModification:
2015_12_27-PM-05_59_19
Theory : eval!all
Home
Index