Nuprl Lemma : bar-delay_wf
∀[T:Type]. ∀[x:bar-base(T)]. (bar-delay(x) ∈ bar-base(T))
Proof
Definitions occuring in Statement :
bar-delay: bar-delay(b),
bar-base: bar-base(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
bar-delay: bar-delay(b),
subtype_rel: A ⊆r B
Lemmas referenced :
bar-base_subtype,
bar-base_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
inrEquality,
hypothesisEquality,
applyEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[x:bar-base(T)]. (bar-delay(x) \mmember{} bar-base(T))
Date html generated:
2016_05_14-AM-06_20_05
Last ObjectModification:
2015_12_26-PM-00_01_31
Theory : co-recursion
Home
Index