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
Lemmas :
Id_wf,
es-loc_wf,
event-ordering+_subtype,
path-goes-thru_wf,
not_wf,
equal_wf,
es-E-interface_wf,
sys-antecedent_wf,
eclass_wf,
top_wf,
es-E_wf,
event-ordering+_wf,
chain-pullback,
squash_wf,
true_wf,
iff_weakening_equal,
fun-connected_transitivity,
fun-connected_wf
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:
2015_07_21-PM-04_17_54
Last ObjectModification:
2015_02_04-PM-06_04_15
Home
Index