Theorem: LO.Semantics.Satisfiable.of_subset (Logic/Logic/Semantics.lean)

State before:
M : Type u_1
F : Type u_2
inst✝ : LogicalConnective F
𝓢 : Semantics F M
T U : Set F
h : Satisfiable M U
ss : T ⊆ U
⊢ Satisfiable M T
Tactic:
rcases h with ⟨𝓜, h⟩
State after:
case intro
M : Type u_1
F : Type u_2
inst✝ : LogicalConnective F
𝓢 : Semantics F M
T U : Set F
ss : T ⊆ U
𝓜 : M
h : 𝓜 ⊧* U
⊢ Satisfiable M T

State before:
case intro
M : Type u_1
F : Type u_2
inst✝ : LogicalConnective F
𝓢 : Semantics F M
T U : Set F
ss : T ⊆ U
𝓜 : M
h : 𝓜 ⊧* U
⊢ Satisfiable M T
Tactic:
exact ⟨𝓜, RealizeSet.of_subset h ss⟩
State after:
no goals