Nuprl Lemma : lg-edge-lg-connected
∀[T:Type]. ∀g:LabeledGraph(T). ∀a,b:ℕlg-size(g). (lg-edge(g;a;b) ⇒ lg-connected(g;a;b))
Proof
Definitions occuring in Statement :
lg-connected: lg-connected(g;a;b),
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],
all: ∀x:A. B[x],
implies: P ⇒ Q,
natural_number: $n,
universe: Type
Lemmas :
lg-edge_wf,
int_seg_wf,
lg-size_wf,
nat_wf,
labeled-graph_wf,
rel_star_weakening,
infix_ap_wf,
rel_star_wf,
rel_plus_iff
Latex:
\mforall{}[T:Type]. \mforall{}g:LabeledGraph(T). \mforall{}a,b:\mBbbN{}lg-size(g). (lg-edge(g;a;b) {}\mRightarrow{} lg-connected(g;a;b))
Date html generated:
2015_07_22-PM-00_29_05
Last ObjectModification:
2015_01_28-PM-11_32_54
Home
Index