Nuprl Lemma : sq_stable__valueall-type
∀[T:Type]. SqStable(valueall-type(T))
Proof
Definitions occuring in Statement :
valueall-type: valueall-type(T),
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
sq_stable: SqStable(P),
implies: P ⇒ Q,
valueall-type: valueall-type(T),
uimplies: b supposing a,
squash: ↓T,
has-value: (a)↓,
prop: ℙ,
guard: {T}
Lemmas referenced :
equal-wf-base,
base_wf,
squash_wf,
valueall-type_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lambdaFormation,
sqequalHypSubstitution,
sqequalRule,
isect_memberEquality,
imageElimination,
axiomSqleEquality,
hypothesis,
lemma_by_obid,
isectElimination,
thin,
hypothesisEquality,
because_Cache,
lambdaEquality,
dependent_functionElimination,
equalityTransitivity,
equalitySymmetry,
universeEquality,
independent_isectElimination
Latex:
\mforall{}[T:Type]. SqStable(valueall-type(T))
Date html generated:
2016_05_13-PM-03_24_27
Last ObjectModification:
2015_12_26-AM-09_30_01
Theory : call!by!value_1
Home
Index