Nuprl Lemma : mklist_length
∀[f:Top]. ∀[n:ℕ]. (||mklist(n;f)|| ~ n)
Proof
Definitions occuring in Statement :
mklist: mklist(n;f),
length: ||as||,
nat: ℕ,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top
Lemmas referenced :
mklist_defn2,
mklist-general-length,
nat_wf,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
isect_memberEquality,
voidElimination,
voidEquality,
because_Cache,
sqequalAxiom
Latex:
\mforall{}[f:Top]. \mforall{}[n:\mBbbN{}]. (||mklist(n;f)|| \msim{} n)
Date html generated:
2016_05_14-PM-01_44_32
Last ObjectModification:
2015_12_26-PM-05_32_41
Theory : list_1
Home
Index