Nuprl Lemma : eager_map_nil_lemma
∀f:Top. (eager-map(f;[]) ~ [])
Proof
Definitions occuring in Statement :
eager-map: eager-map(f;as),
nil: [],
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
eager-map: eager-map(f;as),
so_lambda: so_lambda(x,y,z.t[x; y; z]),
member: t ∈ T,
top: Top,
so_apply: x[s1;s2;s3]
Lemmas referenced :
istype-top,
list_ind_nil_lemma,
istype-void
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
Error :lambdaFormation_alt,
cut,
hypothesis,
introduction,
extract_by_obid,
sqequalRule,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
Error :isect_memberEquality_alt,
voidElimination
Latex:
\mforall{}f:Top. (eager-map(f;[]) \msim{} [])
Date html generated:
2019_06_20-PM-00_38_55
Last ObjectModification:
2019_02_28-PM-01_01_13
Theory : list_0
Home
Index