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

State before:
α : Sort u_1
s t u : Set α
⊢ Set.univ.Subset s → s = Set.univ
Tactic:
intro hs
State after:
α : Sort u_1
s t u : Set α
hs : Set.univ.Subset s
⊢ s = Set.univ

State before:
α : Sort u_1
s t u : Set α
hs : Set.univ.Subset s
⊢ s = Set.univ
Tactic:
antisymmetry using (.⊆.)
State after:
case a
α : Sort u_1
s t u : Set α
hs : Set.univ.Subset s
⊢ s.Subset Set.univ

case a
α : Sort u_1
s t u : Set α
hs : Set.univ.Subset s
⊢ Set.univ.Subset s

State before:
case a
α : Sort u_1
s t u : Set α
hs : Set.univ.Subset s
⊢ s.Subset Set.univ
Tactic:
exact subset_univ s
State after:
no goals

State before:
case a
α : Sort u_1
s t u : Set α
hs : Set.univ.Subset s
⊢ Set.univ.Subset s
Tactic:
exact hs
State after:
no goals