Nuprl Lemma : classfun-res-base-classrel

[f:Name ⟶ Type]. ∀[T:Type]. ∀[es:EO+(Message(f))]. ∀[e:E]. ∀[hdr:Name]. ∀[v:T].
  (Base(hdr)@e v ∈ T) supposing (v ∈ Base(hdr)(e) and hdr encodes T)


Proof




Definitions occuring in Statement :  base-headers-msg-val: Base(hdr) encodes-msg-type: hdr encodes T Message: Message(f) classfun-res: X@e classrel: v ∈ X(e) event-ordering+: EO+(Info) es-E: E name: Name uimplies: supposing a uall: [x:A]. B[x] function: x:A ⟶ B[x] universe: Type equal: t ∈ T
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T uimplies: supposing a iff: ⇐⇒ Q and: P ∧ Q rev_implies:  Q implies:  Q exists: x:A. B[x] prop: squash: T uiff: uiff(P;Q) subtype_rel: A ⊆B

Latex:
\mforall{}[f:Name  {}\mrightarrow{}  Type].  \mforall{}[T:Type].  \mforall{}[es:EO+(Message(f))].  \mforall{}[e:E].  \mforall{}[hdr:Name].  \mforall{}[v:T].
    (Base(hdr)@e  =  v)  supposing  (v  \mmember{}  Base(hdr)(e)  and  hdr  encodes  T)



Date html generated: 2016_05_17-AM-11_15_52
Last ObjectModification: 2016_01_18-AM-00_09_33

Theory : process-model


Home Index