Nuprl Lemma : prior-val-cases
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[e:E].
((X)' es e ~ if first(e) then {}
if pred(e) ∈b X then {X(pred(e))}
else (X)' es pred(e)
fi )
Proof
Definitions occuring in Statement :
es-prior-val: (X)',
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-first: first(e),
es-pred: pred(e),
es-E: E,
ifthenelse: if b then t else f fi ,
uall: ∀[x:A]. B[x],
top: Top,
apply: f a,
universe: Type,
sqequal: s ~ t,
single-bag: {x},
empty-bag: {}
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
es-prior-val: (X)',
in-eclass: e ∈b X,
es-prior-interface: prior(X),
local-pred-class: local-pred-class(P),
eclass-val: X(e),
eclass: EClass(A[eo; e]),
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
es-local-pred: last(P),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
eq_int: (i =z j),
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[e:E].
((X)' es e \msim{} if first(e) then \{\}
if pred(e) \mmember{}\msubb{} X then \{X(pred(e))\}
else (X)' es pred(e)
fi )
Date html generated:
2016_05_17-AM-06_30_38
Last ObjectModification:
2016_01_17-PM-06_38_36
Theory : event-ordering
Home
Index