Nuprl Lemma : fpf-disjoint-compatible
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[f,g:a:A fp-> B[a]]. f || g supposing l_disjoint(A;fst(f);fst(g))
Proof
Definitions occuring in Statement :
fpf-compatible: f || g,
fpf: a:A fp-> B[a],
l_disjoint: l_disjoint(T;l1;l2),
deq: EqDecider(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
pi1: fst(t),
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
fpf-compatible: f || g,
fpf: a:A fp-> B[a],
fpf-ap: f(x),
fpf-dom: x ∈ dom(f),
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
pi1: fst(t),
pi2: snd(t),
prop: ℙ,
so_apply: x[s],
iff: P ⇐⇒ Q,
l_disjoint: l_disjoint(T;l1;l2),
not: ¬A,
cand: A c∧ B,
false: False
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f,g:a:A fp-> B[a]].
f || g supposing l\_disjoint(A;fst(f);fst(g))
Date html generated:
2016_05_16-AM-11_28_40
Last ObjectModification:
2015_12_29-AM-09_25_05
Theory : event-ordering
Home
Index