Theorem: Set.insert_inter_right (GMLInit/Data/Set/Insert.lean)

State before:
α : Sort u_1
a : α
s t : Set α
⊢ s.inter (t.insert a) = (s.inter (Set.pure a)).union (s.inter t)
Tactic:
rw [inter_distrib_left]
State after:
no goals

State before:
α : Sort u_1
a : α
s t : Set α
⊢ (s.inter (Set.pure a)).union (s.inter t) = (Set.pureIf a (a ∈ s)).union (s.inter t)
Tactic:
rw [inter_pure]
State after:
no goals