{ 
[l_loc:Id]. [P,Q:Pi_term]. [g:{R:Pi_term| pi-rank(R) < pi-rank((P | Q))}
Id
Name
Name List
pi-process()].
(pi-bar-trans(l_loc;P;Q;g) 
Id Name Name List pi-process()) }
{ Proof }
Definitions occuring in Statement :
pi-bar-trans: pi-bar-trans(l_loc;P;Q;g),
pi-process: pi-process(),
pi-rank: pi-rank(p),
pipar: (left | right),
pi_term: Pi_term,
Id: Id,
name: Name,
uall: [x:A]. B[x],
member: t T,
less_than: a < b,
set: {x:A| B[x]} ,
function: x:A B[x],
list: type List
Definitions :
uall: [x:A]. B[x],
member: t T,
pi-bar-trans: pi-bar-trans(l_loc;P;Q;g),
int_seg: {i..j
},
lelt: i 
j < k,
and: P 
Q,
le: A B,
not: 
A,
implies: P 
Q,
false: False,
so_lambda: 
x y.t[x; y],
piM: piM(T),
ifthenelse: if b then t else f fi ,
band: p 
q,
eq_int: (i =
j),
make-lg: make-lg(L),
let: let,
all: x:A. B[x],
uimplies: b supposing a,
btrue: tt,
bfalse: ff,
PiDataVal: PiDataVal(),
assert: 
b,
prop: 
,
type-monotone: Monotone(T.F[T]),
pMsg: pMsg(P.M[P]),
so_lambda: x.t[x],
lg-size: lg-size(g),
length: ||as||,
map: map(f;as),
ycomb: Y,
eq_atom: x =a y,
top: Top,
rev_implies: P 
Q,
iff: P Q,
nat: 
,
so_apply: x[s1;s2],
decidable: Dec(P),
or: P 
Q,
sq_type: SQType(T),
guard: {T},
bool: 
,
unit: Unit,
so_apply: x[s],
pi-process: pi-process(),
it: 
Lemmas :
pi_term_wf,
pi-rank_wf,
nat_wf,
pipar_wf,
Id_wf,
name_wf,
pi-process_wf,
rec-process_wf_pi_simple_state,
int_seg_wf,
le_wf,
decidable__equal_int,
subtype_base_sq,
int_subtype_base,
pDVfire?_wf,
bool_wf,
iff_weakening_uiff,
assert_wf,
eqtt_to_assert,
make-lg_wf_dag,
mk-tagged_wf_pCom_msg,
pDVloc_wf,
not_wf,
uiff_transitivity,
bnot_wf,
eqff_to_assert,
assert_of_bnot,
Com_wf,
piM_wf,
pDVloc_tag?_wf,
ifthenelse_wf,
band_wf,
eq_int_wf,
ldag_wf,
pDVloc_tag-id_wf,
pDVloc_tag-name_wf,
pDVfire_wf,
eq_atom_wf,
not_functionality_wrt_uiff,
uiff_inversion,
assert_of_eq_atom,
false_wf,
lg-add_wf_dag,
mk-tagged_wf_pCom_create,
PiDataVal_wf,
lg-size_wf,
tag-case_wf,
make-lg_wf,
mk-tagged_wf_unequal,
mk-tagged_wf,
rank-par
\mforall{}[l$_{loc}$:Id]. \mforall{}[P,Q:Pi\_term]. \mforall{}[g:\{R:Pi\_term| pi-rank(R) < pi-rank((P | Q))\}
{}\mrightarrow{} Id
{}\mrightarrow{} Name
{}\mrightarrow{} Name List
{}\mrightarrow{} pi-process()].
(pi-bar-trans(l$_{loc}$;P;Q;g) \mmember{} Id {}\mrightarrow{} Name {}\mrightarrow{} Name List {}\mrightarrow{} pi-process())
Date html generated:
2011_08_17-PM-07_03_17
Last ObjectModification:
2011_06_18-PM-12_45_11
Home
Index