Nuprl Lemma : es-causl-swellfnd
∀es:EO. SWellFounded((e < e'))
Proof
Definitions occuring in Statement :
es-causl: (e < e'),
es-E: E,
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,
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
es-E: E,
es-base-E: es-base-E(es),
prop: ℙ,
implies: P ⇒ Q,
nat: ℕ
Latex:
\mforall{}es:EO. SWellFounded((e < e'))
Date html generated:
2016_05_16-AM-09_15_06
Last ObjectModification:
2015_12_28-PM-09_58_11
Theory : new!event-ordering
Home
Index