deleteVerts_mono — Mathlib

English

If G' ≤ G'' (subgraph inclusion), then deleting s preserves the inclusion: G'.deleteVerts s ≤ G''.deleteVerts s.

Русский

Если G' ≤ G'', то удаление s сохраняет включение: G'.deleteVerts s ≤ G''.deleteVerts s.

LaTeX

$$$ (G'.deleteVerts s) ≤ (G''.deleteVerts s) $$$

Lean4

@[gcongr, mono]
theorem deleteVerts_mono {G' G'' : G.Subgraph} (h : G' ≤ G'') : G'.deleteVerts s ≤ G''.deleteVerts s :=
  induce_mono h (Set.diff_subset_diff_left h.1)

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