Nuprl Lemma : sq_stable__sqntype
∀[T:Type]. ∀[n:ℕ]. SqStable(sqntype(n;T))
Proof
Definitions occuring in Statement :
sqntype: sqntype(n;T),
nat: ℕ,
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
universe: Type
Definitions unfolded in proof :
sqntype: sqntype(n;T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x]
Lemmas referenced :
sq_stable__all,
base_wf,
all_wf,
equal-wf-base,
sqequal_n_wf,
sq_stable__sqequal_n,
nat_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
lambdaEquality,
functionEquality,
hypothesisEquality,
independent_functionElimination,
lambdaFormation,
because_Cache,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[n:\mBbbN{}]. SqStable(sqntype(n;T))
Date html generated:
2019_06_20-AM-11_33_57
Last ObjectModification:
2018_08_17-PM-03_54_28
Theory : int_1
Home
Index