Nuprl Lemma : cut-order_weakening
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:sys-antecedent(es;X)]. ∀[a,b:E(X)].
a ≤(X;f) b supposing a = b ∈ E(X)
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),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
so_apply: x[s1;s2],
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
prop: ℙ,
implies: P ⇒ Q,
and: P ∧ Q,
uiff: uiff(P;Q),
cut-order: a ≤(X;f) b,
uimplies: b supposing a,
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{}[a,b:E(X)].
a \mleq{}(X;f) b supposing a = b
Date html generated:
2016_05_17-AM-07_34_10
Last ObjectModification:
2015_12_28-PM-11_39_22
Theory : event-ordering
Home
Index