`BookProof.FockDegreesOfFreedom.card_ghost_eq_two_mul` (k : ℕ) : Fintype.card (Fin (k + 1) → ZMod 2) = 2 * Fintype.card (Fin k → ZMod 2)
ProvedBookProof.FockDegreesOfFreedom.card_ghost_eq_two_multheoremstimepiece
Prove the following Lean 4 theorem from ChapterFockDegreesOfFreedom.
BookProof.FockDegreesOfFreedom.card_ghost_eq_two_mul (k : ℕ) : Fintype.card (Fin (k + 1) → ZMod 2) = 2 * Fintype.card (Fin k → ZMod 2)
Formalization note: Lean 4 identifier BookProof.FockDegreesOfFreedom.card_ghost_eq_two_mul.
Preamble
-- Generated from ChapterFockDegreesOfFreedom.lean — theorem BookProof.FockDegreesOfFreedom.card_ghost_eq_two_mul import Mathlib import Definitions.Def_ChapterFockDegreesOfFreedom open BookProof.FockDegreesOfFreedom open Fintype
Formal statement
theorem BookProof.FockDegreesOfFreedom.card_ghost_eq_two_mul (k : ℕ) :
Fintype.card (Fin (k + 1) → ZMod 2) = 2 * Fintype.card (Fin k → ZMod 2) := by sorry