Nuprl Lemma : lg-size-nil
∀[T:Type]. ∀[g:LabeledGraph(T)]. uiff(lg-size(g) = 0 ∈ ℤ;g = lg-nil() ∈ LabeledGraph(T))
Proof
Definitions occuring in Statement :
lg-nil: lg-nil(),
lg-size: lg-size(g),
labeled-graph: LabeledGraph(T),
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
natural_number: $n,
int: ℤ,
universe: Type,
equal: s = t ∈ T
Lemmas :
equal-wf-T-base,
lg-size_wf,
nat_wf,
labeled-graph_wf,
dep-isect-subtype,
list_wf,
top_wf,
int_seg_wf,
length_wf,
list-cases,
length_of_nil_lemma,
nil_wf,
equal-wf-base,
product_subtype_list,
length_of_cons_lemma,
non_neg_length,
length_wf_nat
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. uiff(lg-size(g) = 0;g = lg-nil())
Date html generated:
2015_07_22-PM-00_28_30
Last ObjectModification:
2015_01_28-PM-11_32_42
Home
Index