Nuprl Lemma : goes-thru-goes-thru-last
∀[Info:Type]
∀es:EO+(Info). ∀Sys:EClass(Top). ∀f:sys-antecedent(es;Sys). ∀x,y:E(Sys). ∀i:Id.
x-f*-y thru i ⇒ x-f*-y goes thru i last supposing ¬(loc(x) = i ∈ Id)
Proof
Definitions occuring in Statement :
path-goes-thru-last: x-f*-y goes thru i last,
path-goes-thru: x-f*-y thru i,
sys-antecedent: sys-antecedent(es;Sys),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-loc: loc(e),
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
all: ∀x:A. B[x],
not: ¬A,
implies: P ⇒ Q,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
uimplies: b supposing a,
member: t ∈ T,
not: ¬A,
implies: P ⇒ Q,
false: False,
subtype_rel: A ⊆r B,
es-E-interface: E(X),
prop: ℙ,
sys-antecedent: sys-antecedent(es;Sys),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
path-goes-thru: x-f*-y thru i,
exists: ∃x:A. B[x],
and: P ∧ Q,
path-goes-thru-last: x-f*-y goes thru i last,
squash: ↓T,
true: True,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
cand: A c∧ B
Latex:
\mforall{}[Info:Type]
\mforall{}es:EO+(Info). \mforall{}Sys:EClass(Top). \mforall{}f:sys-antecedent(es;Sys). \mforall{}x,y:E(Sys). \mforall{}i:Id.
x-f*-y thru i {}\mRightarrow{} x-f*-y goes thru i last supposing \mneg{}(loc(x) = i)
Date html generated:
2016_05_17-AM-08_06_08
Last ObjectModification:
2016_01_17-PM-02_42_44
Theory : event-ordering
Home
Index