Nuprl Lemma : es-interface-history-iseg
∀[Info:Type]
∀es:EO+(Info)
∀[A:Type]. ∀X:EClass(A List). ∀e',e:E. (e ≤loc e' ⇒ es-interface-history(es;X;e) ≤ es-interface-history(es;X;e'))
Proof
Definitions occuring in Statement :
es-interface-history: es-interface-history(es;X;e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-E: E,
iseg: l1 ≤ l2,
list: T List,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
universe: Type
Definitions unfolded in proof :
member: t ∈ T,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
wellfounded: WellFnd{i}(A;x,y.R[x; y]),
guard: {T},
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
btrue: tt,
and: P ∧ Q,
es-le: e ≤loc e' ,
squash: ↓T,
true: True,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
top: Top,
bool: 𝔹,
unit: Unit,
it: ⋅,
uiff: uiff(P;Q),
bfalse: ff
Latex:
\mforall{}[Info:Type]
\mforall{}es:EO+(Info)
\mforall{}[A:Type]
\mforall{}X:EClass(A List). \mforall{}e',e:E.
(e \mleq{}loc e' {}\mRightarrow{} es-interface-history(es;X;e) \mleq{} es-interface-history(es;X;e'))
Date html generated:
2016_05_16-PM-11_00_14
Last ObjectModification:
2016_01_17-PM-07_15_27
Theory : event-ordering
Home
Index