Nuprl Lemma : causal-weak-predecessor_wf
∀[es:EO]. ∀[p:E ⟶ (E + Top)]. (causal-weak-predecessor(es;p) ∈ ℙ)
Proof
Definitions occuring in Statement :
causal-weak-predecessor: causal-weak-predecessor(es;p),
es-E: E,
event_ordering: EO,
uall: ∀[x:A]. B[x],
top: Top,
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x],
union: left + right
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
causal-weak-predecessor: causal-weak-predecessor(es;p),
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top
Latex:
\mforall{}[es:EO]. \mforall{}[p:E {}\mrightarrow{} (E + Top)]. (causal-weak-predecessor(es;p) \mmember{} \mBbbP{})
Date html generated:
2016_05_16-AM-10_29_24
Last ObjectModification:
2015_12_28-PM-09_16_00
Theory : new!event-ordering
Home
Index