Nuprl Lemma : lg-map_wf
∀[T,S:Type]. ∀[f:T ⟶ S]. ∀[g:LabeledGraph(T)]. (lg-map(f;g) ∈ LabeledGraph(S))
Proof
Definitions occuring in Statement :
lg-map: lg-map(f;g),
labeled-graph: LabeledGraph(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
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-map: lg-map(f;g),
guard: {T},
nat: ℕ,
spreadn: spread3,
uimplies: b supposing a,
top: Top,
and: P ∧ Q,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
squash: ↓T,
true: True,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
ge: i ≥ j ,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x]
Latex:
\mforall{}[T,S:Type]. \mforall{}[f:T {}\mrightarrow{} S]. \mforall{}[g:LabeledGraph(T)]. (lg-map(f;g) \mmember{} LabeledGraph(S))
Date html generated:
2016_05_17-AM-10_12_15
Last ObjectModification:
2016_01_18-AM-00_21_57
Theory : process-model
Home
Index