Nuprl Lemma : iPolynomial_wf
iPolynomial() ∈ Type
Proof
Definitions occuring in Statement :
iPolynomial: iPolynomial(),
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
iPolynomial: iPolynomial(),
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
int_seg: {i..j-},
uimplies: b supposing a,
sq_stable: SqStable(P),
implies: P ⇒ Q,
lelt: i ≤ j < k,
and: P ∧ Q,
squash: ↓T,
guard: {T},
all: ∀x:A. B[x],
so_apply: x[s],
prop: ℙ
Lemmas referenced :
le_weakening2,
less_than_transitivity2,
sq_stable__le,
select_wf,
imonomial-less_wf,
length_wf,
int_seg_wf,
all_wf,
iMonomial_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
setEquality,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
natural_numberEquality,
hypothesisEquality,
lambdaEquality,
because_Cache,
setElimination,
rename,
independent_isectElimination,
independent_functionElimination,
introduction,
productElimination,
imageMemberEquality,
baseClosed,
imageElimination,
dependent_functionElimination
Latex:
iPolynomial() \mmember{} Type
Date html generated:
2016_05_14-AM-07_00_30
Last ObjectModification:
2016_01_14-PM-08_42_32
Theory : omega
Home
Index