Nuprl Lemma : ranked-eo-pred
∀[L,rk:Top]. ∀[e:Top × Top]. (pred(e) ~ if snd(e)=0 then e else <fst(e), (snd(e)) - 1>)
Proof
Definitions occuring in Statement :
ranked-eo: ranked-eo(L;rk),
es-pred: pred(e),
uall: ∀[x:A]. B[x],
top: Top,
pi1: fst(t),
pi2: snd(t),
int_eq: if a=b then c else d,
pair: <a, b>,
product: x:A × B[x],
subtract: n - m,
natural_number: $n,
sqequal: s ~ t
Definitions unfolded in proof :
btrue: tt,
mk-eo-record: mk-eo-record(E;dom;l;R;locless;pred;rank),
mk-eo: mk-eo(E;dom;l;R;locless;pred;rank),
bfalse: ff,
ifthenelse: if b then t else f fi ,
eq_atom: x =a y,
top: Top,
all: ∀x:A. B[x],
mk-extended-eo: mk-extended-eo,
let: let,
es-base-pred: pred1(e),
es-dom: es-dom(es),
ranked-eo: ranked-eo(L;rk),
es-pred: pred(e),
pi1: fst(t),
pi2: snd(t),
member: t ∈ T,
uall: ∀[x:A]. B[x]
Latex:
\mforall{}[L,rk:Top]. \mforall{}[e:Top \mtimes{} Top]. (pred(e) \msim{} if snd(e)=0 then e else <fst(e), (snd(e)) - 1>)
Date html generated:
2016_05_17-AM-08_44_06
Last ObjectModification:
2015_12_28-PM-10_42_58
Theory : event-ordering
Home
Index