Nuprl Lemma : ts-type_wf
∀[ts:transition-system{i:l}]. (ts-type(ts) ∈ Type)
Proof
Definitions occuring in Statement :
ts-type: ts-type(ts),
transition-system: transition-system{i:l},
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
transition-system: transition-system{i:l},
ts-type: ts-type(ts),
pi1: fst(t)
Lemmas referenced :
transition-system_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalHypSubstitution,
productElimination,
thin,
sqequalRule,
hypothesisEquality,
axiomEquality,
equalityTransitivity,
hypothesis,
equalitySymmetry,
lemma_by_obid
Latex:
\mforall{}[ts:transition-system\{i:l\}]. (ts-type(ts) \mmember{} Type)
Date html generated:
2016_05_15-PM-05_38_15
Last ObjectModification:
2015_12_27-PM-02_05_17
Theory : general
Home
Index