Theorem: Set.empty_bind (GMLInit/Data/Set/Basic.lean)

State before:
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
⊢ Set.empty.bind f = Set.empty
Tactic:
apply Set.ext
State after:
case a
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
⊢ ∀ (x : β), x ∈ Set.empty.bind f ↔ x ∈ Set.empty

State before:
case a
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
⊢ ∀ (x : β), x ∈ Set.empty.bind f ↔ x ∈ Set.empty
Tactic:
intro x
State after:
case a
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
⊢ x ∈ Set.empty.bind f ↔ x ∈ Set.empty

State before:
case a
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
⊢ x ∈ Set.empty.bind f ↔ x ∈ Set.empty
Tactic:
constructor
State after:
case a.mp
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
⊢ x ∈ Set.empty.bind f → x ∈ Set.empty

case a.mpr
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
⊢ x ∈ Set.empty → x ∈ Set.empty.bind f

State before:
case a.mp
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
⊢ x ∈ Set.empty.bind f → x ∈ Set.empty
Tactic:
intro ⟨_,_,_⟩
State after:
case a.mp
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
w✝ : α
left✝ : w✝ ∈ Set.empty
right✝ : x ∈ f w✝
⊢ x ∈ Set.empty

State before:
case a.mp
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
w✝ : α
left✝ : w✝ ∈ Set.empty
right✝ : x ∈ f w✝
⊢ x ∈ Set.empty
Tactic:
contradiction
State after:
no goals

State before:
case a.mpr
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
⊢ x ∈ Set.empty → x ∈ Set.empty.bind f
Tactic:
intro _
State after:
case a.mpr
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
a✝ : x ∈ Set.empty
⊢ x ∈ Set.empty.bind f

State before:
case a.mpr
α : Sort u_2
β : Sort u_1
γ : ?m.13789
f : α → Set β
x : β
a✝ : x ∈ Set.empty
⊢ x ∈ Set.empty.bind f
Tactic:
contradiction
State after:
no goals