Nuprl Lemma : is-dag-remove
∀[T:Type]. ∀[g:LabeledGraph(T)]. ∀[x:ℕlg-size(g)]. is-dag(lg-remove(g;x)) supposing is-dag(g)
Proof
Definitions occuring in Statement :
is-dag: is-dag(g),
lg-remove: lg-remove(g;n),
lg-size: lg-size(g),
labeled-graph: LabeledGraph(T),
int_seg: {i..j-},
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
is-dag: is-dag(g),
all: ∀x:A. B[x],
implies: P ⇒ Q,
int_seg: {i..j-},
lelt: i ≤ j < k,
and: P ∧ Q,
guard: {T},
subtype_rel: A ⊆r B,
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
prop: ℙ,
le: A ≤ B,
iff: P ⇐⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
nat: ℕ,
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
subtract: n - m,
less_than': less_than'(a;b),
rev_implies: P ⇐ Q
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[x:\mBbbN{}lg-size(g)]. is-dag(lg-remove(g;x)) supposing is-dag(g)
Date html generated:
2016_05_17-AM-10_11_30
Last ObjectModification:
2016_01_18-AM-00_22_42
Theory : process-model
Home
Index