Nuprl Lemma : lg-edge_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. ∀[a,b:ℕlg-size(g)]. (lg-edge(g;a;b) ∈ ℙ)
Proof
Definitions occuring in Statement :
lg-edge: lg-edge(g;a;b),
lg-size: lg-size(g),
labeled-graph: LabeledGraph(T),
int_seg: {i..j-},
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
lg-edge: lg-edge(g;a;b),
int_seg: {i..j-},
subtype_rel: A ⊆r B,
uimplies: b supposing a,
nat: ℕ
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[a,b:\mBbbN{}lg-size(g)]. (lg-edge(g;a;b) \mmember{} \mBbbP{})
Date html generated:
2016_05_17-AM-10_09_28
Last ObjectModification:
2015_12_29-PM-05_33_04
Theory : process-model
Home
Index