Nuprl Lemma : pi-new-trans_wf
∀[x:Name]. ∀[P:pi_term()]. ∀[g:{Q:pi_term()| pi-rank(Q) < pi-rank(pinew(x;P))}
─→ Id
─→ Name
─→ (Name List)
─→ pi-process()].
(pi-new-trans(x;P;g) ∈ Id ─→ Name ─→ (Name List) ─→ pi-process())
Proof
Definitions occuring in Statement :
pi-new-trans: pi-new-trans(x;P;g),
pi-process: pi-process(),
pi-rank: pi-rank(p),
pinew: pinew(name;body),
pi_term: pi_term(),
Id: Id,
name: Name,
list: T List,
less_than: a < b,
uall: ∀[x:A]. B[x],
member: t ∈ T,
set: {x:A| B[x]} ,
function: x:A ─→ B[x]
Lemmas :
top_wf,
fix_wf_corec_3parameter,
piM_wf,
ldag_wf,
Com_wf,
continuous-constant,
list_wf,
name_wf,
Id_wf,
pi_term_wf,
less_than_wf,
pi-rank_wf,
pinew_wf,
nat_wf,
pi-process_wf,
pDVfire?_wf,
bool_wf,
eqtt_to_assert,
l-union_wf,
name-deq_wf,
pi-names_wf,
sq_stable__subtype_rel,
make-lg_wf_dag,
cons_wf,
mk-tagged_wf_pCom_msg,
PiDataVal_wf,
subtype_rel_wf,
pDVfire_wf,
subtype_rel_self,
pi_prefix_wf,
unit_wf2,
nil_wf,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
pi-simple-subst_wf,
maybe-new-local_wf,
pi-rank-pi-simple-subst,
rank-new,
iff_weakening_equal,
decidable__lt,
false_wf,
le_antisymmetry_iff,
condition-implies-le,
minus-add,
minus-one-mul,
add-swap,
add-commutes,
add_functionality_wrt_le,
add-associates,
le-add-cancel
Latex:
\mforall{}[x:Name]. \mforall{}[P:pi\_term()]. \mforall{}[g:\{Q:pi\_term()| pi-rank(Q) < pi-rank(pinew(x;P))\}
{}\mrightarrow{} Id
{}\mrightarrow{} Name
{}\mrightarrow{} (Name List)
{}\mrightarrow{} pi-process()].
(pi-new-trans(x;P;g) \mmember{} Id {}\mrightarrow{} Name {}\mrightarrow{} (Name List) {}\mrightarrow{} pi-process())
Date html generated:
2015_07_23-AM-11_59_15
Last ObjectModification:
2015_02_04-PM-03_40_34
Home
Index