Nuprl Lemma : RankEx1_size_wf
∀[T:Type]. ∀[p:RankEx1(T)]. (RankEx1_size(p) ∈ ℕ)
Proof
Definitions occuring in Statement :
RankEx1_size: RankEx1_size(p),
RankEx1: RankEx1(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
RankEx1_size: RankEx1_size(p),
RankEx1co_size: RankEx1co_size(p),
RankEx1: RankEx1(T),
uimplies: b supposing a,
nat: ℕ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
termination,
nat_wf,
set-value-type,
le_wf,
int-value-type,
RankEx1co_size_wf,
RankEx1_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
sqequalRule,
sqequalHypSubstitution,
setElimination,
thin,
rename,
lemma_by_obid,
isectElimination,
hypothesis,
independent_isectElimination,
intEquality,
lambdaEquality,
natural_numberEquality,
hypothesisEquality,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[p:RankEx1(T)]. (RankEx1\_size(p) \mmember{} \mBbbN{})
Date html generated:
2016_05_16-AM-08_56_25
Last ObjectModification:
2015_12_28-PM-06_52_26
Theory : C-semantics
Home
Index