Nuprl Lemma : nil-ndlist
∀[T:Type]. ([] ∈ ndlist(T))
Proof
Definitions occuring in Statement :
ndlist: ndlist(T),
nil: [],
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top,
ndlist: ndlist(T),
prop: ℙ
Lemmas referenced :
no_repeats_nil,
nil_wf,
no_repeats_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
dependent_set_memberEquality,
hypothesisEquality,
sqequalRule,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[T:Type]. ([] \mmember{} ndlist(T))
Date html generated:
2016_05_14-PM-03_31_12
Last ObjectModification:
2015_12_26-PM-06_02_25
Theory : decidable!equality
Home
Index