Nuprl Lemma : mon_for_nil_lemma
∀f,g,T:Top. (For{g} x ∈ []. f[x] ~ e)
Proof
Definitions occuring in Statement :
mon_for: For{g} x ∈ as. f[x],
nil: [],
top: Top,
so_apply: x[s],
all: ∀x:A. B[x],
sqequal: s ~ t,
grp_id: e
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
mon_for: For{g} x ∈ as. f[x],
so_lambda: λ2x.t[x],
top: Top,
so_apply: x[s]
Lemmas referenced :
top_wf,
for_nil_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
\mforall{}f,g,T:Top. (For\{g\} x \mmember{} []. f[x] \msim{} e)
Date html generated:
2016_05_16-AM-07_35_56
Last ObjectModification:
2015_12_28-PM-05_45_41
Theory : list_2
Home
Index