Nuprl Lemma : pi-trans_wf

[l_loc:Id]. ∀[P:pi_term()].  (pi-trans(l_loc;P) ∈ Id ─→ Name ─→ (Name List) ─→ pi-process())


Proof




Definitions occuring in Statement :  pi-trans: pi-trans(l_loc;P) pi-process: pi-process() pi_term: pi_term() Id: Id name: Name list: List uall: [x:A]. B[x] member: t ∈ T function: x:A ─→ B[x]
Lemmas :  nat_properties less_than_transitivity1 less_than_irreflexivity ge_wf less_than_wf pi-rank_wf nat_wf pi_term_wf decidable__le subtract_wf false_wf not-ge-2 less-iff-le condition-implies-le minus-one-mul zero-add minus-add minus-minus add-associates add-swap add-commutes add_functionality_wrt_le add-zero le-add-cancel pi_term-ext eq_atom_wf bool_wf eqtt_to_assert assert_of_eq_atom subtype_base_sq atom_subtype_base unit_wf2 unit_subtype_base it_wf pi-null-trans_wf list_wf name_wf Id_wf eqff_to_assert equal_wf bool_cases_sqequal bool_subtype_base assert-bnot neg_assert_of_eq_atom pi-guarded-trans_wf pi-choices_wf picomm_wf l_exists_wf pi_prefix_wf l_member_wf le_wf pioption_wf pi-bar-trans_wf pipar_wf decidable__lt le-add-cancel2 pi-rep-trans_wf pirep_wf pi-new-trans_wf pinew_wf l_exists_iff rank-pi-choices

Latex:
\mforall{}[l$_{loc}$:Id].  \mforall{}[P:pi\_term()].    (pi-trans(l$_{loc}$;P)  \mmember{}  I\000Cd  {}\mrightarrow{}  Name  {}\mrightarrow{}  (Name  List)  {}\mrightarrow{}  pi-process())



Date html generated: 2015_07_23-AM-11_59_32
Last ObjectModification: 2015_01_29-AM-07_49_14

Home Index