Theorems · Theorem · combinatorics
SimpleGraph.addCayley_erase_zero
∀ {M : Type u_1} (s : Set M) [inst : AddZeroClass M], SimpleGraph.addCayley (s \ {0}) = SimpleGraph.addCayley s- Defined in
- Mathlib.Combinatorics.SimpleGraph.Cayley
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 62 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- AddZeroClass
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites13
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- SimpleGraphstatement and proof · cited by 3,072
- add_zeroproof · cited by 2,707
- AddZeroClassstatement and proof · cited by 1,237
- Set.mem_singleton_iffproof · cited by 172
- SimpleGraph.extproof · cited by 59
- Set.mem_inter_iffproof · cited by 50
- Set.mem_sdiffproof · cited by 31
- Set.sdiff_union_interproof · cited by 19
- SimpleGraph.addCayleystatement and proof · cited by 15
- SimpleGraph.addCayley_adj'proof · cited by 4
- SimpleGraph.addCayley_unionproof · cited by 1
Cited by3
Results whose statement or proof uses this declaration.
- SimpleGraph.addCayley_insert_zeroproof · cited by 0
- SimpleGraph.addCayley_compl_singleton_zeroproof · cited by 0
- SimpleGraph.addCayley_singleton_zeroproof · cited by 0