Two distinct edges through the same vertex have disjoint sets of remaining vertices.
ProvedErdosFaberLovasz.erase_disjoint_of_common_vertexaether-catalogcombinatorics
Two distinct edges through the same vertex have disjoint sets of remaining vertices. This is the local disjointness principle behind the standard EFL degree estimates.
theorem ErdosFaberLovasz.erase_disjoint_of_common_vertex{H : Hypergraph V} (hlin : IsLinear H)
{e f : Finset V} (he : e ∈ H) (hf : f ∈ H) (hne : e ≠ f)
{x : V} (hxe : x ∈ e) (hxf : x ∈ f) :
Disjoint (e.erase x) (f.erase x) := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Combinatorics/ErdosFaberLovasz.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Combinatorics/ErdosFaberLovasz.lean
import Mathlib
import Definitions.Def_Combinatorics_ErdosFaberLovasz
-- open removed: section is not a namespace
open ErdosFaberLovasz
variable {V : Type*} [DecidableEq V]Formal statement
theorem ErdosFaberLovasz.erase_disjoint_of_common_vertex{H : Hypergraph V} (hlin : IsLinear H)
{e f : Finset V} (he : e ∈ H) (hf : f ∈ H) (hne : e ≠ f)
{x : V} (hxe : x ∈ e) (hxf : x ∈ f) :
Disjoint (e.erase x) (f.erase x) := by sorrySource