Nuprl Lemma : es-base-pred-le
∀es:EO. ∀e:es-base-E(es). ((pred1(e) < e) ∨ (pred1(e) = e ∈ es-base-E(es)))
Proof
Definitions occuring in Statement :
es-causl: (e < e'),
es-base-pred: pred1(e),
es-base-E: es-base-E(es),
event_ordering: EO,
all: ∀x:A. B[x],
or: P ∨ Q,
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
guard: {T},
deq: EqDecider(T),
decidable: Dec(P),
or: P ∨ Q,
prop: ℙ,
es-eq-E: e = e',
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
implies: P ⇒ Q
Latex:
\mforall{}es:EO. \mforall{}e:es-base-E(es). ((pred1(e) < e) \mvee{} (pred1(e) = e))
Date html generated:
2016_05_16-AM-09_15_57
Last ObjectModification:
2015_12_28-PM-09_57_02
Theory : new!event-ordering
Home
Index