Nuprl Lemma : loc-on-path-append
∀es:EO. ∀L1,L2:E List. ∀i:Id. (loc-on-path(es;i;L1 @ L2) ⇐⇒ loc-on-path(es;i;L1) ∨ loc-on-path(es;i;L2))
Proof
Definitions occuring in Statement :
loc-on-path: loc-on-path(es;i;L),
es-E: E,
event_ordering: EO,
Id: Id,
append: as @ bs,
list: T List,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
or: P ∨ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
loc-on-path: loc-on-path(es;i;L),
uall: ∀[x:A]. B[x],
member: t ∈ T,
top: Top,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
prop: ℙ,
rev_implies: P ⇐ Q,
or: P ∨ Q
Latex:
\mforall{}es:EO. \mforall{}L1,L2:E List. \mforall{}i:Id.
(loc-on-path(es;i;L1 @ L2) \mLeftarrow{}{}\mRightarrow{} loc-on-path(es;i;L1) \mvee{} loc-on-path(es;i;L2))
Date html generated:
2016_05_16-AM-09_53_46
Last ObjectModification:
2015_12_28-PM-09_32_53
Theory : new!event-ordering
Home
Index