Nuprl Lemma : eq_lnk_self
∀[l:IdLnk]. l = l = tt
Proof
Definitions occuring in Statement :
eq_lnk: a = b,
IdLnk: IdLnk,
btrue: tt,
bool: 𝔹,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
true: True,
prop: ℙ,
rev_implies: P ⇐ Q,
uiff: uiff(P;Q),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt
Latex:
\mforall{}[l:IdLnk]. l = l = tt
Date html generated:
2016_05_16-AM-10_57_45
Last ObjectModification:
2015_12_29-AM-09_09_22
Theory : event-ordering
Home
Index