Nuprl Lemma : tree-flow_wf
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[f:E(X) ⟶ E(X)]. (tree-flow{i:l}(es;X;f) ∈ ℙ')
Proof
Definitions occuring in Statement :
tree-flow: tree-flow{i:l}(es;X;f),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
uall: ∀[x:A]. B[x],
top: Top,
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
tree-flow: tree-flow{i:l}(es;X;f),
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ,
and: P ∧ Q,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
es-E-interface: E(X),
so_apply: x[s],
all: ∀x:A. B[x],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
exists: ∃x:A. B[x]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[f:E(X) {}\mrightarrow{} E(X)]. (tree-flow\{i:l\}(es;X;f) \mmember{} \mBbbP{}')
Date html generated:
2016_05_16-PM-10_16_51
Last ObjectModification:
2015_12_29-AM-11_16_32
Theory : event-ordering
Home
Index