AFTD Auto-Formalizing Theoretical Domains

WickContraction.mem_erase_uncontracted_iff

theoremverifiedformalizationimported Lean

WickContraction.mem_erase_uncontracted_iff

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open WickContraction in
variable {𝓕 : FieldSpecification} in
variable {n : ℕ} (c : WickContraction n) in
set_option backward.isDefEq.respectTransparency false in
lemma WickContraction.mem_erase_uncontracted_iff (c : WickContraction n.succ) (i : Fin n.succ) (j : Fin n) :
    j ∈ (c.erase i).uncontracted ↔
    i.succAbove j ∈ c.uncontracted ∨ c.getDual? (i.succAbove j) = some i
Formalizes
Physlib, `WickContraction.mem_erase_uncontracted_iff`
Lean proof
By Joseph Tooby-Smith, from github.com/leanprover-community/physlib at e411c6e89692 (Copyright (c) 2025 Joseph Tooby-Smith. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.34.1.
Verified
10 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 30

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen WickContraction invariable {𝓕 : FieldSpecification} invariable {n : ℕ} (c : WickContraction n) inset_option backward.isDefEq.respectTransparency false inlemma WickContraction.mem_erase_uncontracted_iff (c : WickContraction n.succ) (i : Fin n.succ) (j : Fin n) :    j ∈ (c.erase i).uncontracted ↔    i.succAbove j ∈ c.uncontracted ∨ c.getDual? (i.succAbove j) = some i := by  rw [getDual?_eq_some_iff_mem]  simp only [uncontracted, getDual?, erase, Nat.succ_eq_add_one, Finset.mem_filter, Finset.mem_univ,    Finset.map_insert, Fin.succAboveEmb_apply, Finset.map_singleton, true_and]  rw [Fin.find?_eq_none_iff, Fin.find?_eq_none_iff]  apply Iff.intro  · intro h    by_cases hi : {i.succAbove j, i} ∈ c.1    · simp [hi]    · apply Or.inl      intro k      by_cases hi' : k = i      · subst hi'        simpa using hi      · simp only [← Fin.exists_succAbove_eq_iff] at hi'        obtain ⟨z, hz⟩ := hi'        subst hz        exact h z  · intro h k    rcases h with h | h    · exact h (i.succAbove k)    · by_contra hn      have hc := c.2.2 _ h _ (by simpa using hn)      simp only [Nat.succ_eq_add_one, Finset.disjoint_insert_right, Finset.mem_insert,        Finset.mem_singleton, true_or, not_true_eq_false, Finset.disjoint_singleton_right, not_or,        false_and, or_false] at hc      have hi : i ∈ ({i.succAbove j, i.succAbove k} : Finset (Fin n.succ)) := by        simp [← hc]      simp only [Nat.succ_eq_add_one, Finset.mem_insert, Finset.mem_singleton] at hi      rcases hi with hi | hi      · exact False.elim (Fin.succAbove_ne _ _ hi.symm)      · exact False.elim (Fin.succAbove_ne _ _ hi.symm)
See it in the graphDiscuss this resultChallenge it