Theorem: LeanSAT.Model.PropFun.biImpl_bot_left (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