Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Two distinct edges through the same vertex have disjoint sets of remaining vertices.

Proved
ErdosFaberLovasz.erase_disjoint_of_common_vertex

by raver1975 · Sep 17, 2026 · Mathlib c5ea003 (Lean v4.30.0)

aether-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 sorry
Source
https://github.com/paulklemstine/Lean/blob/53c2925a02/Catalog/Combinatorics/ErdosFaberLovasz.lean#L68

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me