AFTD Auto-Formalizing Theoretical Domains

truncation_exposed_pair_not_mem

theoremverified

Sanity: the internal colour h_v(e) opposite the port (v, e) is not in the exposed pair P_v(e).

Statement

theorem truncation_exposed_pair_not_mem {V E Ω : Type*} (ends : E → Sym2 V) (c h : V → E → Ω)
    (v : V) (e : E) : h v e ∉ truncation_exposed_pair ends c h v e
Source
sanity lemma for truncation_exposed_pair
Verified
04 Nov 2026
Axioms
Quot.soundpropext
Built on 1
  • truncation_exposed_pairFor a multigraph given by ends : E → Sym2 V and colour assignments c h : V → E → Ω (c v e is the external colour at the port (v, e), h v e…

The proof, explained

The theorem states that the colour $h(v, e)$ cannot belong to the set $\mathrm{truncation\_exposed\_pair}(\mathrm{ends}, c, h, v, e)$. By definition, every element $\omega$ of that set must satisfy $\omega \neq h(v, e)$. Therefore, assuming $h(v, e)$ is in the set yields $h(v, e) \neq h(v, e)$, which contradicts reflexivity of equality.

  1. $h(v, e) \notin \mathrm{truncation\_exposed\_pair}(\mathrm{ends}, c, h, v, e)$

    Assume for contradiction that $h(v, e)$ belongs to $\mathrm{truncation\_exposed\_pair}(\mathrm{ends}, c, h, v, e)$ (hypothesised as $hm$). By definition of the set, this membership implies a conjunction whose second conjunct ($hm.2$) is $h(v, e) \neq h(v, e)$. Applying this inequality to the reflexive equality $h(v, e) = h(v, e)$ (given by `rfl`) produces a contradiction.

    line 3

    uses rfl

      fun hm => hm.2 rfl
rfl
Every element is equal to itself ($a = a$).

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

theorem truncation_exposed_pair_not_mem {V E Ω : Type*} (ends : E → Sym2 V) (c h : V → E → Ω)    (v : V) (e : E) : h v e ∉ truncation_exposed_pair ends c h v e :=  fun hm => hm.2 rfl
See it in the graphDiscuss this resultChallenge it