Nuprl Lemma : eo-forward-base-pred
∀[eo,e,x:Top]. (pred1(x) ~ pred1(x))
Proof
Definitions occuring in Statement :
eo-forward: eo.e,
es-base-pred: pred1(e),
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-base-pred: pred1(e),
eo-forward: eo.e,
eo-restrict: eo-restrict(eo;P),
all: ∀x:A. B[x],
top: Top,
eq_atom: x =a y,
ifthenelse: if b then t else f fi ,
bfalse: ff
Latex:
\mforall{}[eo,e,x:Top]. (pred1(x) \msim{} pred1(x))
Date html generated:
2016_05_16-PM-01_04_48
Last ObjectModification:
2015_12_29-PM-01_46_53
Theory : event-ordering
Home
Index