Nuprl Lemma : RankEx2co_wf
∀[S,T:Type]. (RankEx2co(S;T) ∈ Type)
Proof
Definitions occuring in Statement :
RankEx2co: RankEx2co(S;T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
RankEx2co: RankEx2co(S;T),
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
corec_wf,
ifthenelse_wf,
eq_atom_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
lambdaEquality,
productEquality,
atomEquality,
instantiate,
hypothesisEquality,
tokenEquality,
hypothesis,
universeEquality,
unionEquality,
voidEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
isect_memberEquality,
because_Cache
Latex:
\mforall{}[S,T:Type]. (RankEx2co(S;T) \mmember{} Type)
Date html generated:
2016_05_16-AM-08_59_06
Last ObjectModification:
2015_12_28-PM-06_51_30
Theory : C-semantics
Home
Index