edgeSet — Mathlib

English

For any graph hom f, Subgraph.comap f is monotone: H ≤ H' implies comap f H ≤ comap f H'.

Русский

Для отображения графов f.subgraph comap f монотонно: H ≤ H' ⇒ comap f H ≤ comap f H'.

LaTeX

$$$ H \le H' \Rightarrow Subgraph.comap f H \le Subgraph.comap f H' $$$

Lean4

theorem _root_.Disjoint.edgeSet {H₁ H₂ : Subgraph G} (h : Disjoint H₁ H₂) : Disjoint H₁.edgeSet H₂.edgeSet :=
  disjoint_iff_inf_le.mpr <| by simpa using edgeSet_mono h.le_bot

Похожие утверждения