Nuprl Lemma : binary-treeco-ext
binary-treeco() ≡ lbl:Atom × if lbl =a "Leaf" then ℤ
if lbl =a "Node" then left:binary-treeco() × binary-treeco()
else Void
fi
Proof
Definitions occuring in Statement :
binary-treeco: binary-treeco(),
ifthenelse: if b then t else f fi ,
eq_atom: x =a y,
ext-eq: A ≡ B,
product: x:A × B[x],
int: ℤ,
token: "$token",
atom: Atom,
void: Void
Lemmas :
corec-ext,
eq_atom_wf,
bool_wf,
eqtt_to_assert,
assert_of_eq_atom,
eqff_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
assert-bnot,
neg_assert_of_eq_atom,
subtype_rel_product,
subtype_rel_self,
subtype_rel_wf,
strong-continuous-depproduct,
continuous-constant,
strong-continuous-product,
continuous-id,
subtype_rel_weakening,
nat_wf
binary-treeco() \mequiv{} lbl:Atom \mtimes{} if lbl =a "Leaf" then \mBbbZ{}
if lbl =a "Node" then left:binary-treeco() \mtimes{} binary-treeco()
else Void
fi
Date html generated:
2015_07_17-AM-07_51_31
Last ObjectModification:
2015_01_27-AM-09_36_43
Home
Index