Nuprl Lemma : run-command_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[t,n:ℕ].
  run-command(r;t;n) ∈ pInTransit(P.M[P]) supposing run-command-node(r;t;n)
Proof
Definitions occuring in Statement : 
run-command: run-command(r;t;n)
, 
run-command-node: run-command-node(r;t;n)
, 
pRunType: pRunType(T.M[T])
, 
pInTransit: pInTransit(P.M[P])
, 
nat: ℕ
, 
uimplies: b supposing a
, 
uall: ∀[x:A]. B[x]
, 
so_apply: x[s]
, 
member: t ∈ T
, 
function: x:A ⟶ B[x]
, 
universe: Type
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
uimplies: b supposing a
, 
member: t ∈ T
, 
all: ∀x:A. B[x]
, 
implies: P 
⇒ Q
, 
prop: ℙ
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
pRunType: pRunType(T.M[T])
, 
run-command: run-command(r;t;n)
, 
run-command-node: run-command-node(r;t;n)
, 
ldag: LabeledDAG(T)
, 
pi2: snd(t)
, 
nat: ℕ
, 
int_seg: {i..j-}
, 
lelt: i ≤ j < k
, 
and: P ∧ Q
, 
le: A ≤ B
, 
subtype_rel: A ⊆r B
Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:pRunType(P.M[P])].  \mforall{}[t,n:\mBbbN{}].
    run-command(r;t;n)  \mmember{}  pInTransit(P.M[P])  supposing  run-command-node(r;t;n)
Date html generated:
2016_05_17-AM-10_56_06
Last ObjectModification:
2015_12_29-PM-05_17_53
Theory : process-model
Home
Index