Nuprl Lemma : es-causl-swellfnd-base
∀es:EO. SWellFounded((e < e'))
Proof
Definitions occuring in Statement :
es-causl: (e < e'),
es-base-E: es-base-E(es),
event_ordering: EO,
strongwellfounded: SWellFounded(R[x; y]),
all: ∀x:A. B[x]
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
and: P ∧ Q,
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
prop: ℙ,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
nat: ℕ,
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}es:EO. SWellFounded((e < e'))
Date html generated:
2016_05_16-AM-09_15_05
Last ObjectModification:
2015_12_28-PM-09_57_37
Theory : new!event-ordering
Home
Index