Nuprl Lemma : polynomial-constraints_wf
polynomial-constraints() ∈ Type
Proof
Definitions occuring in Statement :
polynomial-constraints: polynomial-constraints(),
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
polynomial-constraints: polynomial-constraints(),
member: t ∈ T,
uall: ∀[x:A]. B[x]
Lemmas referenced :
list_wf,
iPolynomial_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
productEquality,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis
Latex:
polynomial-constraints() \mmember{} Type
Date html generated:
2016_05_14-AM-07_07_51
Last ObjectModification:
2015_12_26-PM-01_08_22
Theory : omega
Home
Index