Nuprl Lemma : sdata-free-from-atom

[d:SecurityData]. ∀[a:Atom1].  uiff(a#d:SecurityData;¬(a ∈ sdata-atoms(d)))


Proof




Definitions occuring in Statement :  sdata-atoms: sdata-atoms(d) sdata: SecurityData l_member: (x ∈ l) free-from-atom: a#x:T atom: Atom$n uiff: uiff(P;Q) uall: [x:A]. B[x] not: ¬A
Definitions unfolded in proof :  sdata: SecurityData uall: [x:A]. B[x] member: t ∈ T so_lambda: λ2x.t[x] so_apply: x[s] implies:  Q guard: {T} all: x:A. B[x] sdata-atoms: sdata-atoms(d) tree_leaf: tree_leaf(value) tree_ind: tree_ind isl: isl(x) outr: outr(x) bnot: ¬bb ifthenelse: if then else fi  btrue: tt bfalse: ff id-sdata: data(x) and: P ∧ Q cand: c∧ B iff: ⇐⇒ Q not: ¬A false: False uimplies: supposing a prop: rev_implies:  Q true: True uiff: uiff(P;Q) atom-sdata: data(a) decidable: Dec(P) or: P ∨ Q tree_node: tree_node(left;right) sdata-pair: <d1, d2>

Latex:
\mforall{}[d:SecurityData].  \mforall{}[a:Atom1].    uiff(a\#d:SecurityData;\mneg{}(a  \mmember{}  sdata-atoms(d)))



Date html generated: 2016_05_17-AM-11_39_53
Last ObjectModification: 2015_12_29-PM-06_48_41

Theory : event-logic-applications


Home Index