Nuprl Lemma : es-quiet-until_wf
∀[es:EO]. ∀[i:Id]. ∀[P:E ⟶ ℙ]. (es-quiet-until(es;i;e.P[e]) ∈ ℙ)
Proof
Definitions occuring in Statement :
es-quiet-until: es-quiet-until(es;i;e.P[e]),
es-E: E,
event_ordering: EO,
Id: Id,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-quiet-until: es-quiet-until(es;i;e.P[e]),
so_lambda: λ2x.t[x],
prop: ℙ,
and: P ∧ Q,
implies: P ⇒ Q,
so_apply: x[s],
subtype_rel: A ⊆r B,
exists: ∃x:A. B[x],
all: ∀x:A. B[x]
Latex:
\mforall{}[es:EO]. \mforall{}[i:Id]. \mforall{}[P:E {}\mrightarrow{} \mBbbP{}]. (es-quiet-until(es;i;e.P[e]) \mmember{} \mBbbP{})
Date html generated:
2016_05_16-AM-10_36_16
Last ObjectModification:
2015_12_28-PM-09_14_06
Theory : new!event-ordering
Home
Index