Theorem: LeanSAT.Model.PropFun.biImpl_top_right (LeanSAT/Model/PropFun.lean)

State before:
ν : Type u_1
φ : PropFun ν
⊢ biImpl φ ⊤ = φ
Tactic:
ext τ
State after:
case a
ν : Type u_1
φ : PropFun ν
τ : PropAssignment ν
⊢ τ ⊨ biImpl φ ⊤ ↔ τ ⊨ φ

State before:
case a
ν : Type u_1
φ : PropFun ν
τ : PropAssignment ν
⊢ τ ⊨ biImpl φ ⊤ ↔ τ ⊨ φ
Tactic:
aesop
State after:
no goals