Theorem: Groth16TypeI.is_sound
Proof state before:
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))
eqn :
  (List.map
        (fun pairing =>
          ((List.map
                  (fun pf_elem =>
                    C (Groth16TypeI.verificationPairingProof_G1 stmt () pairing pf_elem) *
                      (List.map
                          (fun SRS_elem => C (prover.1 pf_elem SRS_elem) * Groth16TypeI.SRSElementValue_G1 SRS_elem)
                          Groth16TypeI.ListSRSElements_G1).sum)
                  Groth16TypeI.ListProof_G1).sum +
              (List.map
                  (fun SRS_elem =>
                    C (Groth16TypeI.verificationPairingSRS_G1 stmt () pairing SRS_elem) *
                      Groth16TypeI.SRSElementValue_G1 SRS_elem)
                  Groth16TypeI.ListSRSElements_G1).sum) *
            ((List.map
                  (fun pf_elem =>
                    C (Groth16TypeI.verificationPairingProof_G2 stmt () pairing pf_elem) *
                      (List.map
                          (fun SRS_elem => C (prover.2 pf_elem SRS_elem) * Groth16TypeI.SRSElementValue_G2 SRS_elem)
                          Groth16TypeI.ListSRSElements_G2).sum)
                  Groth16TypeI.ListProof_G2).sum +
              (List.map
                  (fun SRS_elem =>
                    C (Groth16TypeI.verificationPairingSRS_G2 stmt () pairing SRS_elem) *
                      Groth16TypeI.SRSElementValue_G2 SRS_elem)
                  Groth16TypeI.ListSRSElements_G2).sum))
        (Groth16TypeI.ListPairings ())).sum =
    0
eqnA :
  (List.map (fun SRS_elem => C (prover.1 Proof_Idx.A SRS_elem) * Groth16TypeI.SRSElementValue_G1 SRS_elem)
        Groth16TypeI.ListSRSElements_G1).sum =
    (List.map (fun SRS_elem => C (prover.2 Proof_Idx.A SRS_elem) * Groth16TypeI.SRSElementValue_G2 SRS_elem)
        Groth16TypeI.ListSRSElements_G2).sum
eqnB :
  (List.map (fun SRS_elem => C (prover.1 Proof_Idx.B SRS_elem) * Groth16TypeI.SRSElementValue_G1 SRS_elem)
        Groth16TypeI.ListSRSElements_G1).sum =
    (List.map (fun SRS_elem => C (prover.2 Proof_Idx.B SRS_elem) * Groth16TypeI.SRSElementValue_G2 SRS_elem)
        Groth16TypeI.ListSRSElements_G2).sum
eqnC :
  (List.map (fun SRS_elem => C (prover.1 Proof_Idx.C SRS_elem) * Groth16TypeI.SRSElementValue_G1 SRS_elem)
        Groth16TypeI.ListSRSElements_G1).sum =
    (List.map (fun SRS_elem => C (prover.2 Proof_Idx.C SRS_elem) * Groth16TypeI.SRSElementValue_G2 SRS_elem)
        Groth16TypeI.ListSRSElements_G2).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.modByMonic
      t =
    0
Tactic:
simp only [mul_comm _ (t), <-mul_assoc]
Proof state after:
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))
eqn :
  (List.map
        (fun pairing =>
          ((List.map
                  (fun pf_elem =>
                    C (Groth16TypeI.verificationPairingProof_G1 stmt () pairing pf_elem) *
                      (List.map
                          (fun SRS_elem => C (prover.1 pf_elem SRS_elem) * Groth16TypeI.SRSElementValue_G1 SRS_elem)
                          Groth16TypeI.ListSRSElements_G1).sum)
                  Groth16TypeI.ListProof_G1).sum +
              (List.map
                  (fun SRS_elem =>
                    C (Groth16TypeI.verificationPairingSRS_G1 stmt () pairing SRS_elem) *
                      Groth16TypeI.SRSElementValue_G1 SRS_elem)
                  Groth16TypeI.ListSRSElements_G1).sum) *
            ((List.map
                  (fun pf_elem =>
                    C (Groth16TypeI.verificationPairingProof_G2 stmt () pairing pf_elem) *
                      (List.map
                          (fun SRS_elem => C (prover.2 pf_elem SRS_elem) * Groth16TypeI.SRSElementValue_G2 SRS_elem)
                          Groth16TypeI.ListSRSElements_G2).sum)
                  Groth16TypeI.ListProof_G2).sum +
              (List.map
                  (fun SRS_elem =>
                    C (Groth16TypeI.verificationPairingSRS_G2 stmt () pairing SRS_elem) *
                      Groth16TypeI.SRSElementValue_G2 SRS_elem)
                  Groth16TypeI.ListSRSElements_G2).sum))
        (Groth16TypeI.ListPairings ())).sum =
    0
eqnA :
  (List.map (fun SRS_elem => C (prover.1 Proof_Idx.A SRS_elem) * Groth16TypeI.SRSElementValue_G1 SRS_elem)
        Groth16TypeI.ListSRSElements_G1).sum =
    (List.map (fun SRS_elem => C (prover.2 Proof_Idx.A SRS_elem) * Groth16TypeI.SRSElementValue_G2 SRS_elem)
        Groth16TypeI.ListSRSElements_G2).sum
eqnB :
  (List.map (fun SRS_elem => C (prover.1 Proof_Idx.B SRS_elem) * Groth16TypeI.SRSElementValue_G1 SRS_elem)
        Groth16TypeI.ListSRSElements_G1).sum =
    (List.map (fun SRS_elem => C (prover.2 Proof_Idx.B SRS_elem) * Groth16TypeI.SRSElementValue_G2 SRS_elem)
        Groth16TypeI.ListSRSElements_G2).sum
eqnC :
  (List.map (fun SRS_elem => C (prover.1 Proof_Idx.C SRS_elem) * Groth16TypeI.SRSElementValue_G1 SRS_elem)
        Groth16TypeI.ListSRSElements_G1).sum =
    (List.map (fun SRS_elem => C (prover.2 Proof_Idx.C SRS_elem) * Groth16TypeI.SRSElementValue_G2 SRS_elem)
        Groth16TypeI.ListSRSElements_G2).sum
⊢ (List.map (fun x => t * Polynomial.C (prover.1 Proof_Idx.C (SRS_Elements_Idx.x_pow_times_t x)) * Polynomial.X ^ ↑x)
            (List.finRange (n_var - 1))).sum.modByMonic
      t =
    0