Nuprl Lemma : decidable__ses-legal-sequence

prvt:Atom1. ∀pas:ProtocolAction List.  Dec(Legal(pas) given prvt)


Proof




Definitions occuring in Statement :  ses-legal-sequence: Legal(pas) given prvt protocol-action: ProtocolAction list: List atom: Atom$n decidable: Dec(P) all: x:A. B[x]
Definitions unfolded in proof :  ses-legal-sequence: Legal(pas) given prvt all: x:A. B[x] member: t ∈ T uall: [x:A]. B[x] so_lambda: λ2x.t[x] int_seg: {i..j-} uimplies: supposing a guard: {T} lelt: i ≤ j < k and: P ∧ Q decidable: Dec(P) or: P ∨ Q satisfiable_int_formula: satisfiable_int_formula(fmla) exists: x:A. B[x] false: False implies:  Q not: ¬A top: Top prop: less_than: a < b squash: T so_apply: x[s]

Latex:
\mforall{}prvt:Atom1.  \mforall{}pas:ProtocolAction  List.    Dec(Legal(pas)  given  prvt)



Date html generated: 2016_05_17-PM-00_38_14
Last ObjectModification: 2016_01_18-AM-07_41_55

Theory : event-logic-applications


Home Index