Nuprl Lemma : select-nil
∀[i:Top]. ([][i] ~ ⊥)
Proof
Definitions occuring in Statement :
select: L[n],
nil: [],
bottom: ⊥,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
so_apply: x[s1;s2],
top: Top,
so_lambda: λ2x y.t[x; y],
it: ⋅,
nil: [],
all: ∀x:A. B[x],
uimplies: b supposing a,
member: t ∈ T,
uall: ∀[x:A]. B[x],
select: L[n]
Lemmas referenced :
stuck-spread,
base_wf,
top_wf
Rules used in proof :
sqequalAxiom,
introduction,
isect_memberFormation,
voidEquality,
voidElimination,
isect_memberEquality,
hypothesis,
lambdaFormation,
independent_isectElimination,
baseClosed,
thin,
isectElimination,
sqequalHypSubstitution,
lemma_by_obid,
cut,
computationStep,
sqequalTransitivity,
sqequalReflexivity,
sqequalRule,
sqequalSubstitution
Latex:
\mforall{}[i:Top]. ([][i] \msim{} \mbot{})
Date html generated:
2016_05_14-AM-06_35_52
Last ObjectModification:
2016_01_12-PM-01_56_19
Theory : list_0
Home
Index