Theorem: Set.inter_subset_right (GMLInit/Data/Set/Subset.lean)

State before:
α : Sort u_1
s✝ t✝ u s t : Set α
⊢ (s.inter t).Subset t
Tactic:
intro x ⟨_,ht⟩
State after:
α : Sort u_1
s✝ t✝ u s t : Set α
x : α
left✝ : x ∈ s
ht : x ∈ t
⊢ x ∈ t

State before:
α : Sort u_1
s✝ t✝ u s t : Set α
x : α
left✝ : x ∈ s
ht : x ∈ t
⊢ x ∈ t
Tactic:
exact ht
State after:
no goals