Nuprl Lemma : add-graph-decls_wf

[dd:DeclSet]. ∀[G:Graph(|dd|)]. ∀[T:Type]. ∀[a:Id ⟶ Id ⟶ Id]. ∀[b:Id].  (add-graph-decls(dd;G;T;a;b) ∈ DeclSet)


Proof




Definitions occuring in Statement :  add-graph-decls: add-graph-decls(dd;G;T;a;b) es-decl-set-domain: |dd| es-decl-set: DeclSet id-graph: Graph(S) Id: Id 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 es-decl-set: DeclSet add-graph-decls: add-graph-decls(dd;G;T;a;b) es-decl-set-domain: |dd| pi1: fst(t) spreadn: spread3 all: x:A. B[x] prop: subtype_rel: A ⊆B so_lambda: λ2x.t[x] so_apply: x[s] uimplies: supposing a

Latex:
\mforall{}[dd:DeclSet].  \mforall{}[G:Graph(|dd|)].  \mforall{}[T:Type].  \mforall{}[a:Id  {}\mrightarrow{}  Id  {}\mrightarrow{}  Id].  \mforall{}[b:Id].
    (add-graph-decls(dd;G;T;a;b)  \mmember{}  DeclSet)



Date html generated: 2016_05_16-PM-00_58_53
Last ObjectModification: 2015_12_29-PM-01_43_17

Theory : event-ordering


Home Index