Nuprl Lemma : lg-out-edges_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. ∀[x:ℕlg-size(g)]. (lg-out-edges(g;x) ∈ ℕlg-size(g) List)
Proof
Definitions occuring in Statement :
lg-out-edges: lg-out-edges(g;x),
lg-size: lg-size(g),
labeled-graph: LabeledGraph(T),
list: T List,
int_seg: {i..j-},
uall: ∀[x:A]. B[x],
member: t ∈ T,
natural_number: $n,
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),
lg-out-edges: lg-out-edges(g;x),
guard: {T},
nat: ℕ,
int_seg: {i..j-},
uimplies: b supposing a,
prop: ℙ,
ge: i ≥ j ,
lelt: i ≤ j < k,
and: P ∧ Q,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
pi2: snd(t)
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[x:\mBbbN{}lg-size(g)]. (lg-out-edges(g;x) \mmember{} \mBbbN{}lg-size(g) List)
Date html generated:
2016_05_17-AM-10_09_24
Last ObjectModification:
2016_01_18-AM-00_22_39
Theory : process-model
Home
Index