Nuprl Lemma : cut-of_wf

[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:sys-antecedent(es;X)]. ∀[s:fset(E(X))].  (cut(X;f;s) ∈ Cut(X;f))


Proof




Definitions occuring in Statement :  cut-of: cut(X;f;s) es-cut: Cut(X;f) sys-antecedent: sys-antecedent(es;Sys) es-E-interface: E(X) eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) fset: fset(T) uall: [x:A]. B[x] top: Top member: t ∈ T universe: Type
Definitions unfolded in proof :  pi1: fst(t) exists: x:A. B[x] implies:  Q all: x:A. B[x] so_apply: x[s] uimplies: supposing a es-cut: Cut(X;f) and: P ∧ Q prop: so_apply: x[s1;s2] subtype_rel: A ⊆B so_lambda: λ2y.t[x; y] so_lambda: λ2x.t[x] cut-of: cut(X;f;s) member: t ∈ T uall: [x:A]. B[x]

Latex:
\mforall{}[Info:Type].  \mforall{}[es:EO+(Info)].  \mforall{}[X:EClass(Top)].  \mforall{}[f:sys-antecedent(es;X)].  \mforall{}[s:fset(E(X))].
    (cut(X;f;s)  \mmember{}  Cut(X;f))



Date html generated: 2016_05_17-AM-07_31_38
Last ObjectModification: 2015_12_28-PM-11_45_36

Theory : event-ordering


Home Index