Nuprl Lemma : less-fast-fib-ext
∀n:ℕ. {m:ℕ| m = fib(n) ∈ ℕ}
Proof
Definitions occuring in Statement :
fib: fib(n),
nat: ℕ,
all: ∀x:A. B[x],
set: {x:A| B[x]} ,
equal: s = t ∈ T
Definitions unfolded in proof :
member: t ∈ T,
less-fast-fib
Lemmas referenced :
less-fast-fib
Rules used in proof :
introduction,
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
cut,
instantiate,
extract_by_obid,
hypothesis,
sqequalRule,
thin,
sqequalHypSubstitution,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}n:\mBbbN{}. \{m:\mBbbN{}| m = fib(n)\}
Date html generated:
2018_05_21-PM-00_57_32
Last ObjectModification:
2018_05_19-AM-06_34_50
Theory : num_thy_1
Home
Index