Theorem: Groth16TypeI.is_sound
Proof state before:
case intro.intro.intro
F : Type
inst✝ : Field F
n_stmt n_wit n_var : ℕ
u_stmt : Fin n_stmt → Polynomial F
u_wit : Fin n_wit → Polynomial F
v_stmt : Fin n_stmt → Polynomial F
v_wit : Fin n_wit → Polynomial F
w_stmt : Fin n_stmt → Polynomial F
w_wit : Fin n_wit → Polynomial F
r : Fin n_wit → F
stmt : Groth16TypeI.Stmt
prover : Prover F Groth16TypeI
t : Polynomial F := ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))
h0012 :
  -0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-0 + -0 +
                          -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * w_stmt x)
                                  (List.finRange n_stmt)).sum *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum) +
                        (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0021 :
  -0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-((List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                              (List.finRange (n_var - 1))).sum *
                          (List.map
                              (fun x =>
                                Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                              (List.finRange n_var)).sum) +
                      (-0 + -0 + -0 +
                        (-0 + -0 +
                          -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * w_wit x)
                                  (List.finRange n_wit)).sum *
                              (List.map
                                  (fun x =>
                                    Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                                  (List.finRange n_var)).sum))))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0022 :
  -0 +
              (-0 +
                (-0 +
                  (-((List.map
                            (fun x =>
                              Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                            (List.finRange n_var)).sum *
                        (List.map
                            (fun x =>
                              Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                            (List.finRange n_var)).sum) +
                    (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-((List.map
                              (fun x =>
                                Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow_times_t x)) *
                                  (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                              (List.finRange (n_var - 1))).sum *
                          Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ)) +
                      (-0 + -0 + -0 +
                        (-0 + -0 +
                          -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * w_wit x)
                                  (List.finRange n_wit)).sum *
                              Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ))))))))) +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 + -0 +
                        -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * w_stmt x)
                                (List.finRange n_stmt)).sum *
                            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.γ)) +
                      (-0 + -0 + -0))))))) +
        (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 +
        (0 + 0 + (List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum +
          (0 +
            (0 +
              (0 +
                (0 +
                  ((List.map
                        (fun x =>
                          Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow_times_t x)) *
                            (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                        (List.finRange (n_var - 1))).sum +
                    (0 + 0 + 0 +
                      (0 + 0 +
                        (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * w_wit x)
                            (List.finRange n_wit)).sum))))))))) =
    0
h0112 :
  -0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * u_stmt x)
                                    (List.finRange n_stmt)).sum *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum) +
                            -0 +
                          -0 +
                        (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 + -0 +
                      -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * w_stmt x)
                              (List.finRange n_stmt)).sum *
                          Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
                    (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0121 :
  -0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-0 + -0 + -0 +
                        (-((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * u_wit x)
                                    (List.finRange n_wit)).sum *
                                (List.map
                                    (fun x =>
                                      Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) *
                                        Polynomial.X ^ ↑x)
                                    (List.finRange n_var)).sum) +
                            -0 +
                          -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-((List.map
                          (fun x =>
                            Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow_times_t x)) *
                              (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                          (List.finRange (n_var - 1))).sum *
                      Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
                  (-0 + -0 + -0 +
                    (-0 + -0 +
                      -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * w_wit x)
                              (List.finRange n_wit)).sum *
                          Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β))))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0122 :
  -0 +
              (-(Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.β) *
                    (List.map
                        (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                        (List.finRange n_var)).sum) +
                (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-0 + -0 + -0 +
                        (-((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * u_wit x)
                                    (List.finRange n_wit)).sum *
                                Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ)) +
                            -0 +
                          -0))))))) +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * u_stmt x)
                                  (List.finRange n_stmt)).sum *
                              Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.γ)) +
                          -0 +
                        -0 +
                      (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                        (List.finRange n_var)).sum *
                    Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
                (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 +
        ((List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum + 0 + 0 +
          (0 +
            (0 +
              (0 +
                (0 +
                  (0 +
                    (0 + 0 + 0 +
                      ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * u_wit x)
                              (List.finRange n_wit)).sum +
                          0 +
                        0))))))))) =
    0
h0212 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * u_stmt x)
                                (List.finRange n_stmt)).sum *
                            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
                        -0 +
                      -0 +
                    (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0221 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 + -0 + -0 +
                    (-((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * u_wit x)
                                (List.finRange n_wit)).sum *
                            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
                        -0 +
                      -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h0222 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-(Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.β) *
                Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
            (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h1022 :
  -(Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.α) *
                  (List.map
                      (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                      (List.finRange n_var)).sum) +
              (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                      (-0 + -0 + -0 +
                        (-0 +
                            -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * v_wit x)
                                    (List.finRange n_wit)).sum *
                                Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ)) +
                          -0))))))) +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                    (-0 +
                          -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * v_stmt x)
                                  (List.finRange n_stmt)).sum *
                              Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.γ)) +
                        -0 +
                      (-0 + -0 + -0))))))) +
        (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (0 +
        (0 + (List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum + 0 +
          (0 +
            (0 +
              (0 +
                (0 +
                  (0 +
                    (0 + 0 + 0 +
                      (0 +
                          (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * v_wit x)
                              (List.finRange n_wit)).sum +
                        0))))))))) =
    0
h1112 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 +
                        -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * v_stmt x)
                                (List.finRange n_stmt)).sum *
                            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
                      -0 +
                    (-0 + -0 + -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h1121 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-0 +
          (-0 +
            (-0 +
              (-0 +
                (-0 +
                  (-0 + -0 + -0 +
                    (-0 +
                        -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * v_wit x)
                                (List.finRange n_wit)).sum *
                            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
                      -0))))))) +
      (0 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
h1122 :
  -0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0)))))) +
            (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
          (-0 + (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
        (-(Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.α) *
              Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
          (-0 + (-0 + (-0 + (-0 + (-0 + -0 + -0 + (-0 + -0 + -0))))))) +
      (1 + (0 + 0 + 0 + (0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0))))))))) =
    0
hA1011 :
  Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.α) + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hA0111 :
  0 + (Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.β) + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    Polynomial.C (prover.2 Proof_Idx.A SRS_Elements_Idx.β) + (0 + (0 + 0))
hA0012 :
  0 + (0 + (Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.δ) + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (0 + (Polynomial.C (prover.2 Proof_Idx.A SRS_Elements_Idx.δ) + 0))
hA0011 :
  0 +
      (0 +
        (0 +
          ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                (List.finRange n_var)).sum +
            (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 +
      (0 +
        (0 +
          (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.A (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
              (List.finRange n_var)).sum))
hA0010 :
  0 +
      (0 +
        (0 +
          (0 +
            ((List.map
                  (fun x =>
                    Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow_times_t x)) *
                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                  (List.finRange (n_var - 1))).sum +
              (0 + 0 + 0 +
                (0 + 0 +
                  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * w_wit x)
                      (List.finRange n_wit)).sum)))))) =
    0 + (0 + (0 + 0))
hA0101 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * u_stmt x)
                        (List.finRange n_stmt)).sum +
                    0 +
                  0 +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hA1001 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 +
                    (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * v_stmt x)
                        (List.finRange n_stmt)).sum +
                  0 +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hA0001 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 +
                  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * w_stmt x)
                      (List.finRange n_stmt)).sum +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hA0110 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 + 0 +
                ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * u_wit x)
                        (List.finRange n_wit)).sum +
                    0 +
                  0)))))) =
    0 + (0 + (0 + 0))
hA1010 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 + 0 +
                (0 +
                    (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * v_wit x)
                        (List.finRange n_wit)).sum +
                  0)))))) =
    0 + (0 + (0 + 0))
hA0021 :
  0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (Polynomial.C (prover.2 Proof_Idx.A SRS_Elements_Idx.γ) + (0 + 0))
hB1011 :
  Polynomial.C (prover.1 Proof_Idx.B SRS_Elements_Idx.α) + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hB0111 :
  0 + (Polynomial.C (prover.1 Proof_Idx.B SRS_Elements_Idx.β) + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β) + (0 + (0 + 0))
hB0012 :
  0 + (0 + (Polynomial.C (prover.1 Proof_Idx.B SRS_Elements_Idx.δ) + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (0 + (Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ) + 0))
hB0011 :
  0 +
      (0 +
        (0 +
          ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                (List.finRange n_var)).sum +
            (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 +
      (0 +
        (0 +
          (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
              (List.finRange n_var)).sum))
hB0010 :
  0 +
      (0 +
        (0 +
          (0 +
            ((List.map
                  (fun x =>
                    Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.x_pow_times_t x)) *
                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                  (List.finRange (n_var - 1))).sum +
              (0 + 0 + 0 +
                (0 + 0 +
                  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.q x)) * w_wit x)
                      (List.finRange n_wit)).sum)))))) =
    0 + (0 + (0 + 0))
hB0101 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.y x)) * u_stmt x)
                        (List.finRange n_stmt)).sum +
                    0 +
                  0 +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hB1001 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 +
                    (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.y x)) * v_stmt x)
                        (List.finRange n_stmt)).sum +
                  0 +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hB0001 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 +
                  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.y x)) * w_stmt x)
                      (List.finRange n_stmt)).sum +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hB0110 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 + 0 +
                ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.q x)) * u_wit x)
                        (List.finRange n_wit)).sum +
                    0 +
                  0)))))) =
    0 + (0 + (0 + 0))
hB1010 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 + 0 +
                (0 +
                    (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.q x)) * v_wit x)
                        (List.finRange n_wit)).sum +
                  0)))))) =
    0 + (0 + (0 + 0))
hB0021 :
  0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.γ) + (0 + 0))
hC1011 :
  Polynomial.C (prover.1 Proof_Idx.C SRS_Elements_Idx.α) + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hC0111 :
  0 + (Polynomial.C (prover.1 Proof_Idx.C SRS_Elements_Idx.β) + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    Polynomial.C (prover.2 Proof_Idx.C SRS_Elements_Idx.β) + (0 + (0 + 0))
hC0012 :
  0 + (0 + (Polynomial.C (prover.1 Proof_Idx.C SRS_Elements_Idx.δ) + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (0 + (Polynomial.C (prover.2 Proof_Idx.C SRS_Elements_Idx.δ) + 0))
hC0011 :
  0 +
      (0 +
        (0 +
          ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                (List.finRange n_var)).sum +
            (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 +
      (0 +
        (0 +
          (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.C (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
              (List.finRange n_var)).sum))
hC0010 :
  0 +
      (0 +
        (0 +
          (0 +
            ((List.map
                  (fun x =>
                    Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow_times_t x)) *
                      (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                  (List.finRange (n_var - 1))).sum +
              (0 + 0 + 0 +
                (0 + 0 +
                  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * w_wit x)
                      (List.finRange n_wit)).sum)))))) =
    0 + (0 + (0 + 0))
hC0101 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.y x)) * u_stmt x)
                        (List.finRange n_stmt)).sum +
                    0 +
                  0 +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hC1001 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 +
                    (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.y x)) * v_stmt x)
                        (List.finRange n_stmt)).sum +
                  0 +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hC0001 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 +
                  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.y x)) * w_stmt x)
                      (List.finRange n_stmt)).sum +
                (0 + 0 + 0)))))) =
    0 + (0 + (0 + 0))
hC0110 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 + 0 +
                ((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * u_wit x)
                        (List.finRange n_wit)).sum +
                    0 +
                  0)))))) =
    0 + (0 + (0 + 0))
hC1010 :
  0 +
      (0 +
        (0 +
          (0 +
            (0 +
              (0 + 0 + 0 +
                (0 +
                    (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * v_wit x)
                        (List.finRange n_wit)).sum +
                  0)))))) =
    0 + (0 + (0 + 0))
hC0021 :
  0 + (0 + (0 + (0 + (0 + (0 + 0 + 0 + (0 + 0 + 0)))))) =
    0 + (Polynomial.C (prover.2 Proof_Idx.C SRS_Elements_Idx.γ) + (0 + 0))
⊢ ((List.map (fun i => Polynomial.C (stmt i) * u_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q i)) * u_wit i)
            (List.finRange n_wit)).sum) *
      ((List.map (fun i => Polynomial.C (stmt i) * v_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q i)) * v_wit i)
            (List.finRange n_wit)).sum) =
    (List.map (fun i => Polynomial.C (stmt i) * w_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q i)) * w_wit i)
            (List.finRange n_wit)).sum +
      (List.map
          (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow_times_t x)) * (Polynomial.X ^ ↑x * t))
          (List.finRange (n_var - 1))).sum
Tactic:
simp only [neg_zero, add_zero, zero_add] at h0012 h0021 h0022 h0112 h0121 h0122 h0212 h0221 h0222 h1022 h1112 h1121 h1122 hA1011 hA0111 hA0012 hA0011 hA0010 hA0101 hA1001 hA0001 hA0110 hA1010 hA0021 hB1011 hB0111 hB0012 hB0011 hB0010 hB0101 hB1001 hB0001 hB0110 hB1010 hB0021 hC1011 hC0111 hC0012 hC0011 hC0010 hC0101 hC1001 hC0001 hC0110 hC1010 hC0021
Proof state after:
case intro.intro.intro
F : Type
inst✝ : Field F
n_stmt n_wit n_var : ℕ
u_stmt : Fin n_stmt → Polynomial F
u_wit : Fin n_wit → Polynomial F
v_stmt : Fin n_stmt → Polynomial F
v_wit : Fin n_wit → Polynomial F
w_stmt : Fin n_stmt → Polynomial F
w_wit : Fin n_wit → Polynomial F
r : Fin n_wit → F
stmt : Groth16TypeI.Stmt
prover : Prover F Groth16TypeI
t : Polynomial F := ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))
h0012 :
  -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * w_stmt x)
            (List.finRange n_stmt)).sum *
        (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
            (List.finRange n_var)).sum) =
    0
h0021 :
  -((List.map
              (fun x =>
                Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow_times_t x)) *
                  (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
              (List.finRange (n_var - 1))).sum *
          (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
              (List.finRange n_var)).sum) +
      -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * w_wit x)
              (List.finRange n_wit)).sum *
          (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
              (List.finRange n_var)).sum) =
    0
h0022 :
  -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                  (List.finRange n_var)).sum *
              (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                  (List.finRange n_var)).sum) +
          (-((List.map
                    (fun x =>
                      Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow_times_t x)) *
                        (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                    (List.finRange (n_var - 1))).sum *
                Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ)) +
            -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * w_wit x)
                    (List.finRange n_wit)).sum *
                Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ))) +
        -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * w_stmt x)
                (List.finRange n_stmt)).sum *
            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.γ)) +
      ((List.map (fun x => Polynomial.C (stmt x) * w_stmt x) (List.finRange n_stmt)).sum +
        ((List.map
              (fun x =>
                Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow_times_t x)) *
                  (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
              (List.finRange (n_var - 1))).sum +
          (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * w_wit x)
              (List.finRange n_wit)).sum)) =
    0
h0112 :
  -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * u_stmt x)
              (List.finRange n_stmt)).sum *
          (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
              (List.finRange n_var)).sum) +
      -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * w_stmt x)
              (List.finRange n_stmt)).sum *
          Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) =
    0
h0121 :
  -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * u_wit x)
              (List.finRange n_wit)).sum *
          (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
              (List.finRange n_var)).sum) +
      (-((List.map
                (fun x =>
                  Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow_times_t x)) *
                    (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
                (List.finRange (n_var - 1))).sum *
            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
        -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * w_wit x)
                (List.finRange n_wit)).sum *
            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β))) =
    0
h0122 :
  -(Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.β) *
                (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                    (List.finRange n_var)).sum) +
            -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * u_wit x)
                    (List.finRange n_wit)).sum *
                Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ)) +
          -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * u_stmt x)
                  (List.finRange n_stmt)).sum *
              Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.γ)) +
        -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                (List.finRange n_var)).sum *
            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
      ((List.map (fun x => Polynomial.C (stmt x) * u_stmt x) (List.finRange n_stmt)).sum +
        (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * u_wit x)
            (List.finRange n_wit)).sum) =
    0
h0212 :
  -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * u_stmt x)
            (List.finRange n_stmt)).sum *
        Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) =
    0
h0221 :
  -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * u_wit x)
            (List.finRange n_wit)).sum *
        Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) =
    0
h0222 :
  -(Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.β) * Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) = 0
h1022 :
  -(Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.α) *
              (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
                  (List.finRange n_var)).sum) +
          -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * v_wit x)
                  (List.finRange n_wit)).sum *
              Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ)) +
        -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * v_stmt x)
                (List.finRange n_stmt)).sum *
            Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.γ)) +
      ((List.map (fun x => Polynomial.C (stmt x) * v_stmt x) (List.finRange n_stmt)).sum +
        (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * v_wit x)
            (List.finRange n_wit)).sum) =
    0
h1112 :
  -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * v_stmt x)
            (List.finRange n_stmt)).sum *
        Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) =
    0
h1121 :
  -((List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * v_wit x)
            (List.finRange n_wit)).sum *
        Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) =
    0
h1122 :
  -(Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.α) * Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)) +
      1 =
    0
hA1011 : Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.α) = 0
hA0111 : Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.β) = Polynomial.C (prover.2 Proof_Idx.A SRS_Elements_Idx.β)
hA0012 : Polynomial.C (prover.1 Proof_Idx.A SRS_Elements_Idx.δ) = Polynomial.C (prover.2 Proof_Idx.A SRS_Elements_Idx.δ)
hA0011 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
        (List.finRange n_var)).sum =
    (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.A (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
        (List.finRange n_var)).sum
hA0010 :
  (List.map
          (fun x =>
            Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.x_pow_times_t x)) *
              (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
          (List.finRange (n_var - 1))).sum +
      (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * w_wit x)
          (List.finRange n_wit)).sum =
    0
hA0101 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * u_stmt x)
        (List.finRange n_stmt)).sum =
    0
hA1001 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * v_stmt x)
        (List.finRange n_stmt)).sum =
    0
hA0001 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.y x)) * w_stmt x)
        (List.finRange n_stmt)).sum =
    0
hA0110 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * u_wit x) (List.finRange n_wit)).sum =
    0
hA1010 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.A (SRS_Elements_Idx.q x)) * v_wit x) (List.finRange n_wit)).sum =
    0
hA0021 : 0 = Polynomial.C (prover.2 Proof_Idx.A SRS_Elements_Idx.γ)
hB1011 : Polynomial.C (prover.1 Proof_Idx.B SRS_Elements_Idx.α) = 0
hB0111 : Polynomial.C (prover.1 Proof_Idx.B SRS_Elements_Idx.β) = Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.β)
hB0012 : Polynomial.C (prover.1 Proof_Idx.B SRS_Elements_Idx.δ) = Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.δ)
hB0011 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
        (List.finRange n_var)).sum =
    (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.B (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
        (List.finRange n_var)).sum
hB0010 :
  (List.map
          (fun x =>
            Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.x_pow_times_t x)) *
              (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
          (List.finRange (n_var - 1))).sum +
      (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.q x)) * w_wit x)
          (List.finRange n_wit)).sum =
    0
hB0101 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.y x)) * u_stmt x)
        (List.finRange n_stmt)).sum =
    0
hB1001 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.y x)) * v_stmt x)
        (List.finRange n_stmt)).sum =
    0
hB0001 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.y x)) * w_stmt x)
        (List.finRange n_stmt)).sum =
    0
hB0110 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.q x)) * u_wit x) (List.finRange n_wit)).sum =
    0
hB1010 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.B (SRS_Elements_Idx.q x)) * v_wit x) (List.finRange n_wit)).sum =
    0
hB0021 : 0 = Polynomial.C (prover.2 Proof_Idx.B SRS_Elements_Idx.γ)
hC1011 : Polynomial.C (prover.1 Proof_Idx.C SRS_Elements_Idx.α) = 0
hC0111 : Polynomial.C (prover.1 Proof_Idx.C SRS_Elements_Idx.β) = Polynomial.C (prover.2 Proof_Idx.C SRS_Elements_Idx.β)
hC0012 : Polynomial.C (prover.1 Proof_Idx.C SRS_Elements_Idx.δ) = Polynomial.C (prover.2 Proof_Idx.C SRS_Elements_Idx.δ)
hC0011 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
        (List.finRange n_var)).sum =
    (List.map (fun x => Polynomial.C (prover.2 Proof_Idx.C (SRS_Elements_Idx.x_pow x)) * Polynomial.X ^ ↑x)
        (List.finRange n_var)).sum
hC0010 :
  (List.map
          (fun x =>
            Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow_times_t x)) *
              (Polynomial.X ^ ↑x * ∏ i : Fin n_wit, (Polynomial.X - Polynomial.C (r i))))
          (List.finRange (n_var - 1))).sum +
      (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * w_wit x)
          (List.finRange n_wit)).sum =
    0
hC0101 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.y x)) * u_stmt x)
        (List.finRange n_stmt)).sum =
    0
hC1001 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.y x)) * v_stmt x)
        (List.finRange n_stmt)).sum =
    0
hC0001 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.y x)) * w_stmt x)
        (List.finRange n_stmt)).sum =
    0
hC0110 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * u_wit x) (List.finRange n_wit)).sum =
    0
hC1010 :
  (List.map (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q x)) * v_wit x) (List.finRange n_wit)).sum =
    0
hC0021 : 0 = Polynomial.C (prover.2 Proof_Idx.C SRS_Elements_Idx.γ)
⊢ ((List.map (fun i => Polynomial.C (stmt i) * u_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q i)) * u_wit i)
            (List.finRange n_wit)).sum) *
      ((List.map (fun i => Polynomial.C (stmt i) * v_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q i)) * v_wit i)
            (List.finRange n_wit)).sum) =
    (List.map (fun i => Polynomial.C (stmt i) * w_stmt i) (List.finRange n_stmt)).sum +
        (List.map (fun i => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.q i)) * w_wit i)
            (List.finRange n_wit)).sum +
      (List.map
          (fun x => Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow_times_t x)) * (Polynomial.X ^ ↑x * t))
          (List.finRange (n_var - 1))).sum