propm_edges_between_symm
lemmaverified
Parallel classes are symmetric: the edges between i and j are the edges between j and i.
Statement
lemma propm_edges_between_symm {m n : ℕ} (ends : Fin m → Fin n × Fin n) (i j : Fin n) :
edges_between ends i j = edges_between ends j i- Source
- step towards propm_orientation_of_out_degree_two (PROPm orientations, arXiv:2602.18098 v2, Sec. 6)
- Verified
- 06 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- edges_betweenThe parallel class of edges joining agents i and j.
- Used by 1
- propm_orientation_of_out_degree_twoIf the simple graph underlying a loopless multigraph has an orientation with every out-degree at most two, then for nonnegative additive…
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- Parallel classes are symmetric. -/lemma propm_edges_between_symm {m n : ℕ} (ends : Fin m → Fin n × Fin n) (i j : Fin n) : edges_between ends i j = edges_between ends j i := by ext e; simp only [edges_between, Finset.mem_filter, Finset.mem_univ, true_and]; exact or_comm