Nuprl Lemma : lg-remove_wf
∀[T:Type]. ∀[g:LabeledGraph(T)]. ∀[x:ℕ]. (lg-remove(g;x) ∈ LabeledGraph(T))
Proof
Definitions occuring in Statement :
lg-remove: lg-remove(g;n),
labeled-graph: LabeledGraph(T),
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
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-remove: lg-remove(g;n),
guard: {T},
nat: ℕ,
spreadn: spread3,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
int_seg: {i..j-},
top: Top,
int_iseg: {i...j},
cand: A c∧ B,
ge: i ≥ j ,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
less_than: a < b,
squash: ↓T,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
lelt: i ≤ j < k
Latex:
\mforall{}[T:Type]. \mforall{}[g:LabeledGraph(T)]. \mforall{}[x:\mBbbN{}]. (lg-remove(g;x) \mmember{} LabeledGraph(T))
Date html generated:
2016_05_17-AM-10_08_37
Last ObjectModification:
2016_01_18-AM-00_23_56
Theory : process-model
Home
Index