Nuprl Lemma : retrace_wf

[Info:Type]. ∀[es:EO+(Info)]. ∀[Q:E ⟶ E ⟶ ℙ]. ∀[X:EClass(Top)].  (retrace(es;Q;X) ∈ ℙ)


Proof




Definitions occuring in Statement :  retrace: retrace(es;Q;X) eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-E: E uall: [x:A]. B[x] top: Top prop: member: t ∈ T function: x:A ⟶ B[x] universe: Type
Definitions unfolded in proof :  so_apply: x[s1;s2] so_lambda: λ2y.t[x; y] exists: x:A. B[x] rev_implies:  Q iff: ⇐⇒ Q or: P ∨ Q es-E-interface: E(X) all: x:A. B[x] so_apply: x[s] implies:  Q so_lambda: λ2x.t[x] subtype_rel: A ⊆B and: P ∧ Q prop: member: t ∈ T uall: [x:A]. B[x] retrace: retrace(es;Q;X)

Latex:
\mforall{}[Info:Type].  \mforall{}[es:EO+(Info)].  \mforall{}[Q:E  {}\mrightarrow{}  E  {}\mrightarrow{}  \mBbbP{}].  \mforall{}[X:EClass(Top)].    (retrace(es;Q;X)  \mmember{}  \mBbbP{})



Date html generated: 2016_05_17-AM-08_06_51
Last ObjectModification: 2015_12_28-PM-11_15_42

Theory : event-ordering


Home Index