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
Lemmas :
exists_wf,
es-E-interface_wf,
Id_wf,
es-loc_wf,
event-ordering+_subtype,
not_wf,
equal_wf,
fun-connected_wf,
eclass_wf,
top_wf,
es-E_wf,
event-ordering+_wf
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:
2015_07_21-PM-04_17_28
Last ObjectModification:
2015_01_27-PM-05_19_52
Home
Index