Nuprl Lemma : lg-is-source_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. ∀[i:ℕ]. (lg-is-source(g;i) ∈ 𝔹)
Proof
Definitions occuring in Statement :
lg-is-source: lg-is-source(g;i),
labeled-graph: LabeledGraph(T),
nat: ℕ,
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
lg-is-source: lg-is-source(g;i),
nat: ℕ,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
prop: ℙ,
top: Top,
bfalse: ff,
guard: {T}
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[i:\mBbbN{}]. (lg-is-source(g;i) \mmember{} \mBbbB{})
Date html generated:
2016_05_17-AM-10_10_41
Last ObjectModification:
2015_12_29-PM-05_32_28
Theory : process-model
Home
Index