Nuprl Lemma : es-knows-trans

[poss:EO ⟶ ℙ']. ∀[R:PossibleEvent(poss) ⟶ PossibleEvent(poss) ⟶ ℙ']. ∀[P,Q:PossibleEvent(poss) ⟶ ℙ'].
  ((∀e:PossibleEvent(poss). ((P e)  (Q e)))  (∀e:PossibleEvent(poss). (K(P)@e  K(Q)@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:  Q apply: a function: x:A ⟶ B[x]
Definitions unfolded in proof :  es-knows: K(P)@e uall: [x:A]. B[x] implies:  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,Q:PossibleEvent(poss)  {}\mrightarrow{}  \mBbbP{}'].
    ((\mforall{}e:PossibleEvent(poss).  ((P  e)  {}\mRightarrow{}  (Q  e)))  {}\mRightarrow{}  (\mforall{}e:PossibleEvent(poss).  (K(P)@e  {}\mRightarrow{}  K(Q)@e)))



Date html generated: 2016_05_16-AM-09_52_55
Last ObjectModification: 2015_12_28-PM-09_34_06

Theory : new!event-ordering


Home Index