Nuprl Lemma : sdata-pair-has-atom
∀[d1,d2:SecurityData]. ∀[b:Atom1]. uiff(b#<d1, d2>:SecurityData;b#d1:SecurityData ∧ b#d2:SecurityData)
Proof
Definitions occuring in Statement :
sdata-pair: <d1, d2>,
sdata: SecurityData,
free-from-atom: a#x:T,
atom: Atom$n,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
and: P ∧ Q
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
prop: ℙ,
all: ∀x:A. B[x],
top: Top,
ifthenelse: if b then t else f fi ,
btrue: tt,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
bfalse: ff
Latex:
\mforall{}[d1,d2:SecurityData]. \mforall{}[b:Atom1].
uiff(b\#<d1, d2>:SecurityData;b\#d1:SecurityData \mwedge{} b\#d2:SecurityData)
Date html generated:
2016_05_17-AM-11_39_12
Last ObjectModification:
2015_12_29-PM-06_45_56
Theory : event-logic-applications
Home
Index