Nuprl Lemma : lg-size_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. (lg-size(g) ∈ ℕ)
Proof
Definitions occuring in Statement :
lg-size: lg-size(g),
labeled-graph: LabeledGraph(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
labeled-graph: LabeledGraph(T),
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
lg-size: lg-size(g)
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. (lg-size(g) \mmember{} \mBbbN{})
Date html generated:
2016_05_17-AM-10_07_47
Last ObjectModification:
2015_12_29-PM-05_34_20
Theory : process-model
Home
Index