Nuprl Lemma : decidable__cut-order
∀[Info:Type]. ∀es:EO+(Info). ∀X:EClass(Top). ∀f:sys-antecedent(es;X). ∀a,b:E(X). Dec(a ≤(X;f) b)
Proof
Definitions occuring in Statement :
cut-order: a ≤(X;f) b,
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
decidable: Dec(P),
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
universe: Type
Definitions unfolded in proof :
so_apply: x[s1;s2],
so_lambda: λ2x y.t[x; y],
es-cut: Cut(X;f),
subtype_rel: A ⊆r B,
member: t ∈ T,
cut-order: a ≤(X;f) b,
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x]
Latex:
\mforall{}[Info:Type]. \mforall{}es:EO+(Info). \mforall{}X:EClass(Top). \mforall{}f:sys-antecedent(es;X). \mforall{}a,b:E(X). Dec(a \mleq{}(X;f) b)
Date html generated:
2016_05_17-AM-07_33_52
Last ObjectModification:
2015_12_28-PM-11_42_24
Theory : event-ordering
Home
Index