Nuprl Lemma : path-goes-thru-last_wf
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[Sys:EClass(Top)]. ∀[f:E(Sys) ⟶ E(Sys)]. ∀[x,y:E(Sys)]. ∀[i:Id].
(x-f*-y goes thru i last ∈ ℙ)
Proof
Definitions occuring in Statement :
path-goes-thru-last: x-f*-y goes thru i last,
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
Id: Id,
uall: ∀[x:A]. B[x],
top: Top,
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
so_apply: x[s1;s2],
so_lambda: λ2x y.t[x; y],
so_apply: x[s],
es-E-interface: E(X),
subtype_rel: A ⊆r B,
and: P ∧ Q,
prop: ℙ,
so_lambda: λ2x.t[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
path-goes-thru-last: x-f*-y goes thru i last
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[Sys:EClass(Top)]. \mforall{}[f:E(Sys) {}\mrightarrow{} E(Sys)]. \mforall{}[x,y:E(Sys)]. \mforall{}[i:Id].
(x-f*-y goes thru i last \mmember{} \mBbbP{})
Date html generated:
2016_05_17-AM-08_05_13
Last ObjectModification:
2015_12_28-PM-11_16_55
Theory : event-ordering
Home
Index