Nuprl Lemma : es-knows-valid
∀[poss:EO ⟶ ℙ']. ∀[R:PossibleEvent(poss) ⟶ PossibleEvent(poss) ⟶ ℙ']. ∀[P:PossibleEvent(poss) ⟶ ℙ'].
((∀e:PossibleEvent(poss). (P e)) ⇒ (∀e:PossibleEvent(poss). K(P)@e))
Proof
Definitions occuring in Statement :
es-knows: K(P)@e,
possible-event: PossibleEvent(poss),
event_ordering: EO,
uall: ∀[x:A]. B[x],
prop: ℙ,
all: ∀x:A. B[x],
implies: P ⇒ Q,
apply: f a,
function: x:A ⟶ B[x]
Definitions unfolded in proof :
es-knows: K(P)@e,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
all: ∀x:A. B[x],
member: t ∈ T,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
guard: {T}
Latex:
\mforall{}[poss:EO {}\mrightarrow{} \mBbbP{}']. \mforall{}[R:PossibleEvent(poss) {}\mrightarrow{} PossibleEvent(poss) {}\mrightarrow{} \mBbbP{}'].
\mforall{}[P:PossibleEvent(poss) {}\mrightarrow{} \mBbbP{}'].
((\mforall{}e:PossibleEvent(poss). (P e)) {}\mRightarrow{} (\mforall{}e:PossibleEvent(poss). K(P)@e))
Date html generated:
2016_05_16-AM-09_53_02
Last ObjectModification:
2015_12_28-PM-09_33_22
Theory : new!event-ordering
Home
Index