Nuprl Lemma : primed-class-opt-cases
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[b:Top]. ∀[e:E].
(Prior(X)?b es e ~ if first(e) then b loc(e)
if 0 <z #(X es pred(e)) then X es pred(e)
else Prior(X)?b es pred(e)
fi )
Proof
Definitions occuring in Statement :
primed-class-opt: Prior(X)?b,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-first: first(e),
es-pred: pred(e),
es-loc: loc(e),
es-E: E,
ifthenelse: if b then t else f fi ,
lt_int: i <z j,
uall: ∀[x:A]. B[x],
top: Top,
apply: f a,
natural_number: $n,
universe: Type,
sqequal: s ~ t,
bag-size: #(bs)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
primed-class-opt: Prior(X)?b,
eclass: EClass(A[eo; e]),
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
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 ,
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
Id: Id,
es-E: E,
es-base-E: es-base-E(es),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[b:Top]. \mforall{}[e:E].
(Prior(X)?b es e \msim{} if first(e) then b loc(e)
if 0 <z \#(X es pred(e)) then X es pred(e)
else Prior(X)?b es pred(e)
fi )
Date html generated:
2016_05_16-PM-11_31_13
Last ObjectModification:
2016_01_17-PM-07_10_09
Theory : event-ordering
Home
Index