Nuprl Lemma : run-event-local-pred_wf

[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. ∀[e:runEvents(r)].  (run-event-local-pred(r;e) ∈ runEvents(r)?)


Proof




Definitions occuring in Statement :  run-event-local-pred: run-event-local-pred(r;e) runEvents: runEvents(r) pRunType: pRunType(T.M[T]) uall: [x:A]. B[x] so_apply: x[s] unit: Unit member: t ∈ T function: x:A ⟶ B[x] union: left right universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T run-event-local-pred: run-event-local-pred(r;e) so_lambda: λ2x.t[x] so_apply: x[s] subtype_rel: A ⊆B uimplies: supposing a top: Top all: x:A. B[x] implies:  Q exposed-bfalse: exposed-bfalse bool: 𝔹 unit: Unit it: btrue: tt uiff: uiff(P;Q) and: P ∧ Q ifthenelse: if then else fi  bfalse: ff iff: ⇐⇒ Q not: ¬A prop: rev_implies:  Q

Latex:
\mforall{}[M:Type  {}\mrightarrow{}  Type].  \mforall{}[r:pRunType(P.M[P])].  \mforall{}[e:runEvents(r)].
    (run-event-local-pred(r;e)  \mmember{}  runEvents(r)?)



Date html generated: 2016_05_17-AM-10_44_10
Last ObjectModification: 2015_12_29-PM-05_23_05

Theory : process-model


Home Index