Nuprl Lemma : sq_stable__is-list-if-has-value-fun
∀[t:Base]. ∀[n:ℕ]. SqStable(is-list-if-has-value-fun(t;n))
Proof
Definitions occuring in Statement :
is-list-if-has-value-fun: is-list-if-has-value-fun(t;n),
nat: ℕ,
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
base: Base
Definitions unfolded in proof :
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
member: t ∈ T,
squash: ↓T,
uimplies: b supposing a,
prop: ℙ
Lemmas referenced :
is-list-if-has-value-fun-ax-mem,
squash_wf,
is-list-if-has-value-fun_wf,
nat_wf,
base_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
lambdaFormation,
introduction,
sqequalHypSubstitution,
imageElimination,
cut,
lemma_by_obid,
isectElimination,
thin,
hypothesisEquality,
independent_isectElimination,
hypothesis
Latex:
\mforall{}[t:Base]. \mforall{}[n:\mBbbN{}]. SqStable(is-list-if-has-value-fun(t;n))
Date html generated:
2016_05_15-PM-10_08_34
Last ObjectModification:
2015_12_27-PM-06_00_06
Theory : eval!all
Home
Index