Nuprl Lemma : eq_knd_self
∀[k:Knd]. (k = k ~ tt)
Proof
Definitions occuring in Statement :
eq_knd: a = b,
Knd: Knd,
btrue: tt,
uall: ∀[x:A]. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
uiff: uiff(P;Q),
and: P ∧ Q,
sq_type: SQType(T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
guard: {T},
eq_knd: a = b,
rev_uimplies: rev_uimplies(P;Q)
Latex:
\mforall{}[k:Knd]. (k = k \msim{} tt)
Date html generated:
2016_05_16-AM-10_58_12
Last ObjectModification:
2015_12_29-AM-09_09_30
Theory : event-ordering
Home
Index