Nuprl Lemma : polyform_wf
∀[n:ℤ]. (polyform(n) ∈ Type)
Proof
Definitions occuring in Statement :
polyform: polyform(n),
uall: ∀[x:A]. B[x],
member: t ∈ T,
int: ℤ,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
polyform: polyform(n),
prop: ℙ
Lemmas referenced :
tree_wf,
assert_wf,
ispolyform_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
setEquality,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
intEquality,
hypothesis,
applyEquality,
hypothesisEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry
Latex:
\mforall{}[n:\mBbbZ{}]. (polyform(n) \mmember{} Type)
Date html generated:
2017_10_01-AM-08_32_15
Last ObjectModification:
2017_05_02-AM-11_41_48
Theory : integer!polynomial!trees
Home
Index