Theorem: Set.subset_multimop_iff_premulitimop_subset (Logic/Modal/LogicSymbol.lean)

State before:
ι : Type u_2
F : Type u_1
inst✝¹ : UnaryModalOperator ι F
inst✝ : DecidableEq F
i : ι
n : ℕ
p q : F
s t : Set F
h : s ⊆ Set.multimop i n t
⊢ Set.premultimop i n s ⊆ t
Tactic:
intro p hp
State after:
ι : Type u_2
F : Type u_1
inst✝¹ : UnaryModalOperator ι F
inst✝ : DecidableEq F
i : ι
n : ℕ
p✝ q : F
s t : Set F
h : s ⊆ Set.multimop i n t
p : F
hp : p ∈ Set.premultimop i n s
⊢ p ∈ t

State before:
ι : Type u_2
F : Type u_1
inst✝¹ : UnaryModalOperator ι F
inst✝ : DecidableEq F
i : ι
n : ℕ
p✝ q : F
s t : Set F
h : s ⊆ Set.multimop i n t
p : F
hp : p ∈ Set.premultimop i n s
⊢ p ∈ t
Tactic:
obtain ⟨_, h₁, h₂⟩ := premultimop_subset h hp
State after:
case intro.intro
ι : Type u_2
F : Type u_1
inst✝¹ : UnaryModalOperator ι F
inst✝ : DecidableEq F
i : ι
n : ℕ
p✝ q : F
s t : Set F
h : s ⊆ Set.multimop i n t
p : F
hp : p ∈ Set.premultimop i n s
w✝ : F
h₁ : w✝ ∈ t
h₂ : (mop i)^[n] w✝ = (mop i)^[n] p
⊢ p ∈ t

State before:
case intro.intro
ι : Type u_2
F : Type u_1
inst✝¹ : UnaryModalOperator ι F
inst✝ : DecidableEq F
i : ι
n : ℕ
p✝ q : F
s t : Set F
h : s ⊆ Set.multimop i n t
p : F
hp : p ∈ Set.premultimop i n s
w✝ : F
h₁ : w✝ ∈ t
h₂ : (mop i)^[n] w✝ = (mop i)^[n] p
⊢ p ∈ t
Tactic:
simp_all
State after:
no goals