Nuprl Lemma : pDVrequest-counter_wf
∀[x:PiDataVal()]. pDVrequest-counter(x) ∈ ℕ supposing ↑pDVrequest?(x)
Proof
Definitions occuring in Statement : 
pDVrequest-counter: pDVrequest-counter(x)
, 
pDVrequest?: pDVrequest?(x)
, 
PiDataVal: PiDataVal()
, 
nat: ℕ
, 
assert: ↑b
, 
uimplies: b supposing a
, 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
uimplies: b supposing a
, 
pDVrequest-counter: pDVrequest-counter(x)
, 
PiDataVal: PiDataVal()
, 
pDVloc: pDVloc(id)
, 
pDVrequest?: pDVrequest?(x)
, 
all: ∀x:A. B[x]
, 
so_lambda: λ2x y.t[x; y]
, 
top: Top
, 
so_apply: x[s1;s2]
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
assert: ↑b
, 
ifthenelse: if b then t else f fi 
, 
bfalse: ff
, 
implies: P 
⇒ Q
, 
false: False
, 
prop: ℙ
, 
pDVloc_tag: pDVloc_tag(id;name)
, 
pDVguards: pDVguards(from;preList)
, 
pDVmsg: pDVmsg(val;index)
, 
unit: Unit
, 
it: ⋅
, 
pDVfire: pDVfire()
, 
pDVcontinue: pDVcontinue()
, 
pDVselex: pDVselex(rndv1)
, 
pDVrequest: pDVrequest(rndv2;counter)
, 
btrue: tt
Latex:
\mforall{}[x:PiDataVal()].  pDVrequest-counter(x)  \mmember{}  \mBbbN{}  supposing  \muparrow{}pDVrequest?(x)
Date html generated:
2016_05_17-AM-11_30_08
Last ObjectModification:
2015_12_29-PM-06_50_47
Theory : event-logic-applications
Home
Index