@@ -41,17 +41,16 @@ are 0-simplices and edges are 1-simplices.
4141def ofSimpleGraph {ι : Type *} [DecidableEq ι] (G : SimpleGraph ι) :
4242 AbstractSimplicialComplex ι where
4343 faces := ({s : Finset ι | ∃ v, s = {v}}) ∪ Sym2.toFinset '' G.edgeSet
44- empty_notMem := by simp
45- down_closed {s t} hs hts ht := by
46- simp only [Set.mem_union, Set.mem_setOf_eq, Set.mem_image]
44+ isRelLowerSet_faces := by
45+ intro s hs
46+ simp only [Set.mem_union, Set.mem_setOf_eq, Set.mem_image] at hs
4747 rcases hs with ⟨v, rfl⟩ | ⟨e, he, rfl⟩
48- · grind
49- · by_cases hc : t.card ≤ 1
50- · left
51- obtain ⟨x, hx⟩ := ht
52- exact ⟨x, by grind [Finset.eq_singleton_iff_unique_mem, Finset.card_le_one]⟩
53- · right
54- exact ⟨e, he, by grind [Sym2.card_toFinset e, Finset.eq_of_subset_of_card_le]⟩
48+ · simp
49+ · constructor
50+ · exact Finset.nonempty_iff_ne_empty.mpr (Sym2.toFinset_ne_empty e)
51+ · intro b hb_sub hb_nonempty
52+ by_cases h : b.card = 1 <;>
53+ grind [Finset.card_eq_one, Finset.eq_of_subset_of_card_le hb_sub, Sym2.card_toFinset]
5554 singleton_mem := by
5655 simp only [Set.mem_union, Set.mem_setOf_eq, Set.mem_image]
5756 intro v
0 commit comments