Nuprl Lemma : lnk-decls-compatible
∀[l1,l2:IdLnk]. ∀[d1,d2:tg:Id fp-> Type]. lnk-decl(l1;d1) || lnk-decl(l2;d2) supposing (l1 = l2 ∈ IdLnk) ⇒ d1 || d2
Proof
Definitions occuring in Statement :
lnk-decl: lnk-decl(l;dt),
fpf-compatible: f || g,
fpf: a:A fp-> B[a],
Kind-deq: KindDeq,
Knd: Knd,
IdLnk: IdLnk,
id-deq: IdDeq,
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
decidable: Dec(P),
or: P ∨ Q,
and: P ∧ Q,
uall: ∀[x:A]. B[x],
subtype_rel: A ⊆r B,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
top: Top,
implies: P ⇒ Q,
fpf-compatible: f || g,
IdLnk: IdLnk,
Id: Id,
sq_type: SQType(T),
guard: {T},
lnk-decl: lnk-decl(l;dt),
fpf-dom: x ∈ dom(f),
pi1: fst(t),
fpf: a:A fp-> B[a],
iff: P ⇐⇒ Q,
exists: ∃x:A. B[x],
Knd: Knd,
rcv: rcv(l,tg),
fpf-ap: f(x),
pi2: snd(t),
outl: outl(x),
cand: A c∧ B,
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
rev_implies: P ⇐ Q,
not: ¬A,
false: False
Latex:
\mforall{}[l1,l2:IdLnk]. \mforall{}[d1,d2:tg:Id fp-> Type].
lnk-decl(l1;d1) || lnk-decl(l2;d2) supposing (l1 = l2) {}\mRightarrow{} d1 || d2
Date html generated:
2016_05_16-AM-11_36_15
Last ObjectModification:
2015_12_29-AM-09_31_04
Theory : event-ordering
Home
Index