Nuprl Lemma : event-has*-transitive-encrypt
∀s:SES. ∀es:EO+(Info). ∀a:Atom1. ∀e1,e2:E. e1 has* a ⇒ e2 has* cipherText(e1) ⇒ e2 has* a supposing ↑e1 ∈b Encrypt
Proof
Definitions occuring in Statement :
event-has*: e has* a,
ses-crypt: cipherText(e),
ses-encrypt: Encrypt,
ses-info: Info,
security-event-structure: SES,
in-eclass: e ∈b X,
event-ordering+: EO+(Info),
es-E: E,
atom: Atom$n,
assert: ↑b,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
uimplies: b supposing a,
member: t ∈ T,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top,
implies: P ⇒ Q,
prop: ℙ,
es-E-interface: E(X),
event-has*: e has* a,
rel_star: R^*,
infix_ap: x f y,
exists: ∃x:A. B[x],
and: P ∧ Q,
cand: A c∧ B,
so_lambda: λ2x.t[x],
so_apply: x[s],
nat: ℕ,
ge: i ≥ j ,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
not: ¬A,
le: A ≤ B,
less_than': less_than'(a;b),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
ses-info-flow: ->>
Latex:
\mforall{}s:SES. \mforall{}es:EO+(Info). \mforall{}a:Atom1. \mforall{}e1,e2:E.
e1 has* a {}\mRightarrow{} e2 has* cipherText(e1) {}\mRightarrow{} e2 has* a supposing \muparrow{}e1 \mmember{}\msubb{} Encrypt
Date html generated:
2016_05_17-AM-11_48_18
Last ObjectModification:
2016_01_18-AM-07_45_09
Theory : event-logic-applications
Home
Index