{ 
[A:Type]. [eq:EqDecider(A)]. [B:A 
Type]. [f,g,h:a:A fp-> B[a]].
(h || f 
g) supposing (h || g and h || f) }
{ Proof }
Definitions occuring in Statement :
fpf-join: f g,
fpf-compatible: f || g,
fpf: a:A fp-> B[a],
uimplies: b supposing a,
uall: [x:A]. B[x],
so_apply: x[s],
function: x:A B[x],
universe: Type,
deq: EqDecider(T)
Definitions :
uall: [x:A]. B[x],
so_apply: x[s],
uimplies: b supposing a,
fpf-compatible: f || g,
member: t 
T,
all: x:A. B[x],
implies: P 
Q,
and: P 
Q,
so_lambda: 
x.t[x],
prop: 
,
rev_implies: P 
Q,
ifthenelse: if b then t else f fi ,
iff: P Q,
btrue: tt,
bfalse: ff,
bool: 
,
unit: Unit,
not: 
A,
or: P 
Q,
false: False,
it: 
Lemmas :
assert_wf,
fpf-dom_wf,
fpf-trivial-subtype-top,
fpf-join_wf,
top_wf,
fpf-compatible_wf,
fpf_wf,
deq_wf,
bool_wf,
not_wf,
bnot_wf,
fpf-ap_wf,
fpf-join-ap,
iff_weakening_uiff,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
fpf-join-dom
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f,g,h:a:A fp-> B[a]].
(h || f \moplus{} g) supposing (h || g and h || f)
Date html generated:
2011_08_10-AM-08_05_34
Last ObjectModification:
2011_06_18-AM-08_23_20
Home
Index