Nuprl Lemma : es-interface-prior-vals_wf
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[T:Type]. ∀[X:EClass(T)]. ∀[e:E]. (X(≤e) ∈ T List)
Proof
Definitions occuring in Statement :
es-interface-prior-vals: X(≤e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
list: T List,
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than': less_than'(a;b),
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
squash: ↓T,
es-interface-prior-vals: X(≤e),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[T:Type]. \mforall{}[X:EClass(T)]. \mforall{}[e:E]. (X(\mleq{}e) \mmember{} T List)
Date html generated:
2016_05_16-PM-11_04_19
Last ObjectModification:
2016_01_17-PM-07_15_11
Theory : event-ordering
Home
Index