Nuprl Lemma : stdEO-eq-E
∀[M:Type ─→ Type]
∀S0:InitialSystem(P.M[P]). ∀n2m:ℕ ─→ pMsg(P.M[P]). ∀l2m:Id ─→ pMsg(P.M[P]). ∀env:pEnvType(P.M[P]). ∀e1,e2:E.
(e1 = e2 ∈ E ⇐⇒ (run-event-loc(e1) = run-event-loc(e2) ∈ Id) ∧ (run-event-step(e1) = run-event-step(e2) ∈ ℤ))
supposing Continuous+(P.M[P])
Proof
Definitions occuring in Statement :
stdEO: stdEO(n2m;l2m;env;S),
InitialSystem: InitialSystem(P.M[P]),
run-event-step: run-event-step(e),
run-event-loc: run-event-loc(e),
pEnvType: pEnvType(T.M[T]),
pMsg: pMsg(P.M[P]),
es-E: E,
Id: Id,
strong-type-continuous: Continuous+(T.F[T]),
nat: ℕ,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
function: x:A ─→ B[x],
int: ℤ,
universe: Type,
equal: s = t ∈ T
Lemmas :
assert_wf,
true_wf,
sq_stable__le,
le_wf,
is-run-event_wf,
pRun_wf2
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]
\mforall{}S0:InitialSystem(P.M[P]). \mforall{}n2m:\mBbbN{} {}\mrightarrow{} pMsg(P.M[P]). \mforall{}l2m:Id {}\mrightarrow{} pMsg(P.M[P]). \mforall{}env:pEnvType(P.M[P]).
\mforall{}e1,e2:E.
(e1 = e2
\mLeftarrow{}{}\mRightarrow{} (run-event-loc(e1) = run-event-loc(e2)) \mwedge{} (run-event-step(e1) = run-event-step(e2)))
supposing Continuous+(P.M[P])
Date html generated:
2015_07_23-AM-11_16_27
Last ObjectModification:
2015_01_28-PM-11_18_40
Home
Index