Nuprl Lemma : retracer_wf
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[Q:E ⟶ E ⟶ ℙ]. ∀[X:EClass(Top)]. ∀[p:retrace(es;Q;X)].
(retracer(p) ∈ E ⟶ (E(X) List))
Proof
Definitions occuring in Statement :
retracer: retracer(p),
retrace: retrace(es;Q;X),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
retracer: retracer(p),
retrace: retrace(es;Q;X),
and: P ∧ Q,
pi2: snd(t),
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
prop: ℙ,
so_apply: x[s],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
exists: ∃x:A. B[x],
es-E-interface: E(X),
uimplies: b supposing a,
l_all: (∀x∈L.P[x]),
top: Top,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
int_seg: {i..j-},
guard: {T},
lelt: i ≤ j < k,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
not: ¬A,
less_than: a < b,
squash: ↓T
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[Q:E {}\mrightarrow{} E {}\mrightarrow{} \mBbbP{}]. \mforall{}[X:EClass(Top)]. \mforall{}[p:retrace(es;Q;X)].
(retracer(p) \mmember{} E {}\mrightarrow{} (E(X) List))
Date html generated:
2016_05_17-AM-08_07_28
Last ObjectModification:
2016_01_17-PM-02_40_58
Theory : event-ordering
Home
Index