Nuprl Lemma : Form_size_wf
∀[C:Type]. ∀[p:Form(C)]. (Form_size(p) ∈ ℕ)
Proof
Definitions occuring in Statement :
Form_size: Form_size(p),
Form: Form(C),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
Form_size: Form_size(p),
Formco_size: Formco_size(p),
Form: Form(C),
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,
Formco_size_wf,
Form_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
cut,
sqequalRule,
sqequalHypSubstitution,
setElimination,
thin,
rename,
introduction,
extract_by_obid,
isectElimination,
hypothesis,
independent_isectElimination,
intEquality,
lambdaEquality,
natural_numberEquality,
hypothesisEquality,
cumulativity,
universeEquality
Latex:
\mforall{}[C:Type]. \mforall{}[p:Form(C)]. (Form\_size(p) \mmember{} \mBbbN{})
Date html generated:
2018_05_21-PM-10_42_13
Last ObjectModification:
2017_10_13-PM-06_56_40
Theory : PZF
Home
Index