Theorems · Theorem · combinatorics
SimpleGraph.edgeFinset_subset_edgeFinset
∀ {V : Type u_1} {G₁ G₂ : SimpleGraph V} [inst : Fintype ↑G₁.edgeSet] [inst_1 : Fintype ↑G₂.edgeSet],
G₁.edgeFinset ⊆ G₂.edgeFinset ↔ G₁ ≤ G₂- Defined in
- Mathlib.Combinatorics.SimpleGraph.Finite
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 61 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Set.coe_toFinsetproof · cited by 51
- SimpleGraph.edgeSetEmbeddingproof · cited by 8
Cited by2
Results whose statement or proof uses this declaration.
- SimpleGraph.edgeFinset_monoproof · cited by 3
- SimpleGraph.IsExtremal.le_iff_eqproof · cited by 1