Nuprl Lemma : es-until_wf
∀[es:EO]. ∀[P,Q:E ⟶ ℙ]. ((P ⋃ Q) ∈ E ⟶ ℙ)
Proof
Definitions occuring in Statement :
es-until: (P ⋃ Q),
es-E: E,
event_ordering: EO,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-until: (P ⋃ Q),
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
so_apply: x[s]
Latex:
\mforall{}[es:EO]. \mforall{}[P,Q:E {}\mrightarrow{} \mBbbP{}]. ((P \mcup{} Q) \mmember{} E {}\mrightarrow{} \mBbbP{})
Date html generated:
2016_05_16-AM-09_47_29
Last ObjectModification:
2015_12_28-PM-09_37_42
Theory : new!event-ordering
Home
Index