Nuprl Lemma : es-causl-wellfnd
∀the_es:EO. WellFnd{i}(E;x,y.(x < y))
Proof
Definitions occuring in Statement :
es-causl: (e < e'),
es-E: E,
event_ordering: EO,
wellfounded: WellFnd{i}(A;x,y.R[x; y]),
all: ∀x:A. B[x]
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
and: P ∧ Q,
uall: ∀[x:A]. B[x],
so_lambda: λ2x y.t[x; y],
prop: ℙ,
so_apply: x[s1;s2],
implies: P ⇒ Q
Latex:
\mforall{}the$_{es}$:EO. WellFnd\{i\}(E;x,y.(x < y))
Date html generated:
2016_05_16-AM-09_21_13
Last ObjectModification:
2015_12_28-PM-09_53_30
Theory : new!event-ordering
Home
Index