Nuprl Lemma : fresh-sig-protocol1_property
∀[s:SES]
(∀[bss:Basic1 List]. UniqueSignatures(bss) supposing FreshSignatures(bss)) supposing
(PropertyS and
PropertyO and
ActionsDisjoint)
Proof
Definitions occuring in Statement :
unique-sig-protocol: UniqueSignatures(bss),
fresh-sig-protocol1: FreshSignatures(bss),
ses-basic-sequence1: Basic1,
ses-disjoint: ActionsDisjoint,
ses-S: PropertyS,
ses-ordering: PropertyO,
security-event-structure: SES,
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
unique-sig-protocol: UniqueSignatures(bss),
all: ∀x:A. B[x],
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
member: t ∈ T,
ses-act: Act,
es-E-interface: E(X),
ses-action: Action(e),
or: P ∨ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
prop: ℙ,
noncelike-signatures: noncelike-signatures(s;es;thr),
ses-thread-member: e ∈ thr,
ses-thread: Thread,
exists: ∃x:A. B[x],
fresh-sig-protocol1: FreshSignatures(bss),
and: P ∧ Q,
ses-fresh-thread: ses-fresh-thread(s;es;f;A;thr),
squash: ↓T,
label: ...$L... t,
sq_stable: SqStable(P),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
ses-S: PropertyS,
ses-protocol1: Protocol1(bss),
cand: A c∧ B,
event-has: (e has a),
ses-ordering: PropertyO,
so_lambda: λ2x.t[x],
so_apply: x[s],
ses-signer: signer(e),
ses-NU: PropertyNU,
int_seg: {i..j-},
lelt: i ≤ j < k,
decidable: Dec(P),
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
not: ¬A,
less_than: a < b,
ses-signed: signed(e),
ses-thread-loc: loc(thr)= A,
le: A ≤ B,
compat: l1 || l2,
less_than': less_than'(a;b),
uiff: uiff(P;Q),
rev_uimplies: rev_uimplies(P;Q)
Latex:
\mforall{}[s:SES]
(\mforall{}[bss:Basic1 List]. UniqueSignatures(bss) supposing FreshSignatures(bss)) supposing
(PropertyS and
PropertyO and
ActionsDisjoint)
Date html generated:
2016_05_17-PM-00_44_36
Last ObjectModification:
2016_01_18-AM-07_51_46
Theory : event-logic-applications
Home
Index