Nuprl Lemma : global-eo_wf
∀[Info:Type]. ∀L:(Id × Info) List. (global-eo(L) ∈ EO+(Info))
Proof
Definitions occuring in Statement :
global-eo: global-eo(L),
event-ordering+: EO+(Info),
Id: Id,
list: T List,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
member: t ∈ T,
product: x:A × B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
global-eo: global-eo(L),
int_seg: {i..j-},
uimplies: b supposing a,
guard: {T},
lelt: i ≤ j < k,
and: P ∧ Q,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
prop: ℙ,
less_than: a < b,
squash: ↓T,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
has-value: (a)↓,
Id: Id,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
uiff: uiff(P;Q),
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
int_iseg: {i...j},
ge: i ≥ j ,
nequal: a ≠ b ∈ T ,
pi1: fst(t),
nat: ℕ,
le: A ≤ B,
less_than': less_than'(a;b),
infix_ap: x f y,
true: True,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
rev_uimplies: rev_uimplies(P;Q),
cand: A c∧ B,
l_exists: (∃x∈L. P[x])
Latex:
\mforall{}[Info:Type]. \mforall{}L:(Id \mtimes{} Info) List. (global-eo(L) \mmember{} EO+(Info))
Date html generated:
2016_05_17-AM-08_25_48
Last ObjectModification:
2016_01_17-PM-02_46_21
Theory : event-ordering
Home
Index