Nuprl Lemma : ses-fresh-sequence_wf
∀[f:SecurityData ⟶ (Atom1?)]. ∀[A:Id]. ∀[pas:ProtocolAction List].  (ses-fresh-sequence(f;A;pas) ∈ ℙ)
Proof
Definitions occuring in Statement : 
ses-fresh-sequence: ses-fresh-sequence(f;A;pas)
, 
protocol-action: ProtocolAction
, 
sdata: SecurityData
, 
Id: Id
, 
list: T List
, 
atom: Atom$n
, 
uall: ∀[x:A]. B[x]
, 
prop: ℙ
, 
unit: Unit
, 
member: t ∈ T
, 
function: x:A ⟶ B[x]
, 
union: left + right
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
pa-is-sign-implies: pa-is-sign-implies(a;v.P[v])
, 
pa-is-new-and: pa-is-new-and(a;v.P[v])
, 
ses-fresh-sequence: ses-fresh-sequence(f;A;pas)
, 
so_lambda: λ2x.t[x]
, 
all: ∀x:A. B[x]
, 
int_seg: {i..j-}
, 
uimplies: b 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: P 
⇒ Q
, 
not: ¬A
, 
top: Top
, 
prop: ℙ
, 
less_than: a < b
, 
squash: ↓T
, 
pi1: fst(t)
, 
pi2: snd(t)
, 
subtype_rel: A ⊆r B
, 
so_apply: x[s]
Latex:
\mforall{}[f:SecurityData  {}\mrightarrow{}  (Atom1?)].  \mforall{}[A:Id].  \mforall{}[pas:ProtocolAction  List].
    (ses-fresh-sequence(f;A;pas)  \mmember{}  \mBbbP{})
Date html generated:
2016_05_17-PM-00_38_45
Last ObjectModification:
2016_01_18-AM-07_42_16
Theory : event-logic-applications
Home
Index