Nuprl Lemma : bar-base_wf
∀[T:Type]. (bar-base(T) ∈ Type)
Proof
Definitions occuring in Statement :
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-base: bar-base(T),
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
corec_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
lambdaEquality,
unionEquality,
hypothesisEquality,
universeEquality,
hypothesis,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[T:Type]. (bar-base(T) \mmember{} Type)
Date html generated:
2016_05_14-AM-06_19_31
Last ObjectModification:
2015_12_26-PM-00_02_01
Theory : co-recursion
Home
Index