Definition cbv_cache_entry (proof_tree : cbv) := (proj_left proof_tree, proj_right proof_tree).

Lemma nb_nodes_bound i s p' c1 t c2 v :
let p := cbv_update i s p' c1 t c2 v in
nb_nodes p <= suml (map nb_judgements_sub (activations p)) + length (activations p).