Nuprl Lemma : candidate-type-system_wf
∀[Term:Type]. (candidate-type-system{i:l,j:l}(Term) ∈ 𝕌{[i' | j']})
Proof
Definitions occuring in Statement :
candidate-type-system: candidate-type-system{i:l,j:l}(Term),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
candidate-type-system: candidate-type-system{i:l,j:l}(Term)
Lemmas referenced :
term-equality_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
functionEquality,
cumulativity,
hypothesisEquality,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
universeEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[Term:Type]. (candidate-type-system\{i:l,j:l\}(Term) \mmember{} \mBbbU{}\{[i' | j']\})
Date html generated:
2016_05_15-PM-01_49_06
Last ObjectModification:
2015_12_27-AM-00_11_56
Theory : parameterized!rec
Home
Index