Nuprl Lemma : intdeq_reduce_lemma
∀y,x:Top. (IntDeq x y ~ (x =z y))
Proof
Definitions occuring in Statement :
int-deq: IntDeq,
eq_int: (i =z j),
top: Top,
all: ∀x:A. B[x],
apply: f a,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
int-deq: IntDeq
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}y,x:Top. (IntDeq x y \msim{} (x =\msubz{} y))
Date html generated:
2016_05_14-AM-06_06_56
Last ObjectModification:
2015_12_26-AM-11_46_26
Theory : equality!deciders
Home
Index