Theorems · Theorem · combinatorics
SimpleGraph.edgeFinset_mono
∀ {V : Type u_1} {G₁ G₂ : SimpleGraph V} [inst : Fintype ↑G₁.edgeSet] [inst_1 : Fintype ↑G₂.edgeSet],
G₁ ≤ G₂ → G₁.edgeFinset ⊆ G₂.edgeFinsetAlias of the reverse direction of SimpleGraph.edgeFinset_subset_edgeFinset.
- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Fintypestatement and proof · cited by 7,736
- Set.Elemstatement and proof · cited by 7,166
- SimpleGraphstatement and proof · cited by 3,072
- Sym2statement · cited by 737
- SimpleGraph.edgeSetstatement and proof · cited by 199
- SimpleGraph.edgeFinsetstatement · cited by 116
- SimpleGraph.edgeFinset_subset_edgeFinsetproof · cited by 2
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.farFromTriangleFree_of_disjoint_trianglesproof · cited by 2
- SimpleGraph.deleteFar_iffproof · cited by 2
- SimpleGraph.card_edgeFinset_le_card_choose_twoproof · cited by 2