/*  This is a proof plan for theorem:
    lenmapcar: []==>f:(int=>int)=>l:int list=>length(mapcar(l,f))=length(l)in pnat
    planner = dplan, clam_version(2.7.0), oyster_version(1.20)

    Time taken to find plan: 920ms
    Environment:
    []
 */

/* This is the pretty-printed form
ind_strat([(l:int list)-v1::v0])

*/

proof_plan([]==>f:(int=>int)=>l:int list=>length(mapcar(l,f))=length(l)in pnat,lenmapcar,920,ind_strat(induction(lemma(list_primitive)-[(l:int list)-v1::v0])then[base_case(sym_eval(normalize_term([reduction([1,1,1],[mapcar1,equ(int list,left)]),reduction([1,1],[length1,equ(pnat,left)]),reduction([2,1],[length1,equ(pnat,left)])]))then[elementary(intro(new[f])then[identity,wfftacs])]),step_case(ripple(direction_out,wave(direction_out,[2,1],[length2,equ(pnat,left)],[])then[wave(direction_out,[1,1,1],[mapcar2,equ(int list,left)],[])then[wave(direction_out,[1,1],[length2,equ(pnat,left)],[])then[wave(direction_out,[],[cnc_s,imp(right)],[])]]])then[unblock_then_fertilize(strong,unblock_fertilize_lazy([idtac])then fertilize(strong,v2))])]),dplan).
