val lemma_monomial_define_all (_:unit) : Lemma
  (forall (n:nat) (i:int).{:pattern (monomial n).[i]} (monomial n).[i] == (i = n))
let lemma_monomial_define_all () =
  FStar.Classical.forall_intro_with_pat (fun n -> monomial n) lemma_monomial_define
val lemma_monomial_define_all (_:unit) : Lemma
  (forall (n:nat) (i:int).{:pattern (monomial n).[i]} (monomial n).[i] == (i = n))
let lemma_monomial_define_all () =
FStar.Classical.forall_intro_with_pat (fun n -> monomial n) lemma_monomial_define
Vale.Math.Poly2.Lemmas.fst.checked
prims.fst.checked FStar.Pervasives.fsti.checked FStar.Mul.fst.checked FStar.Math.Lib.fst.checked FStar.List.fst.checked FStar.Classical.fsti.checked FStar.Calc.fsti.checked
Vale.Math.Poly2.Lemmas.fst
Prims.unit FStar.Classical.forall_intro_with_pat Prims.nat Vale.Math.Poly2_s.poly Prims.l_Forall Prims.int Prims.eq2 Prims.bool Vale.Math.Poly2_s.op_String_Access Vale.Math.Poly2_s.monomial Prims.op_Equality Vale.Math.Poly2.Lemmas.lemma_monomial_define
module Vale.Math.Poly2.Lemmas
open FStar.Mul

let lemma_pointwise_equal a b pf =
  FStar.Classical.forall_intro pf;
  lemma_equal a b

let lemma_index a =
  FStar.Classical.forall_intro (lemma_index_i a)

let lemma_index_all () =
  FStar.Classical.forall_intro_2 lemma_index_i

let lemma_zero_define () =
  FStar.Classical.forall_intro lemma_zero_define_i

let lemma_one_define () =
  FStar.Classical.forall_intro lemma_one_define_i

let lemma_monomial_define n =
  FStar.Classical.forall_intro (lemma_monomial_define_i n)
val lemma_monomial_define_all (_:unit) : Lemma
  (forall (n:nat) (i:int).{:pattern (monomial n).[i]} (monomial n).[i] == (i = n))
_: Prims.unit
  -> FStar.Pervasives.Lemma
    (ensures
      forall (n: Prims.nat) (i: Prims.int). {:pattern (Vale.Math.Poly2_s.monomial n).[ i ]}
        (Vale.Math.Poly2_s.monomial n).[ i ] == (i = n))