Nuprl Lemma : cut-order-step
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:sys-antecedent(es;X)]. ∀[a:E(X)]. f a ≤(X;f) a
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),
uall: ∀[x:A]. B[x],
top: Top,
apply: f a,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
sys-antecedent: sys-antecedent(es;Sys),
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
decidable: Dec(P),
or: P ∨ Q,
prop: ℙ,
guard: {T},
es-E-interface: E(X),
uimplies: b supposing a,
top: Top,
cand: A c∧ B,
sq_stable: SqStable(P),
squash: ↓T,
es-causle: e c≤ e',
not: ¬A,
label: ...$L... t,
sq_type: SQType(T),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
false: False
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:sys-antecedent(es;X)]. \mforall{}[a:E(X)]. f a \mleq{}(X;f) a
Date html generated:
2016_05_17-AM-07_42_42
Last ObjectModification:
2016_01_17-PM-02_48_58
Theory : event-ordering
Home
Index