Nuprl Lemma : len-length
∀[as:Top List]. (||as|| ~ len(as))
Proof
Definitions occuring in Statement : 
len: len(as)
, 
length: ||as||
, 
list: T List
, 
uall: ∀[x:A]. B[x]
, 
top: Top
, 
sqequal: s ~ t
Definitions unfolded in proof : 
len: len(as)
, 
length: ||as||
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
Lemmas referenced : 
list_wf, 
top_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalRule, 
sqequalReflexivity, 
sqequalTransitivity, 
computationStep, 
isect_memberFormation, 
introduction, 
cut, 
sqequalAxiom, 
lemma_by_obid, 
sqequalHypSubstitution, 
isectElimination, 
thin, 
hypothesis
Latex:
\mforall{}[as:Top  List].  (||as||  \msim{}  len(as))
Date html generated:
2016_05_14-AM-07_41_07
Last ObjectModification:
2015_12_26-PM-02_51_11
Theory : list_1
Home
Index