Metamath Proof Explorer


Theorem speimfwALT

Description: Alternate proof of speimfw (longer compressed proof, but fewer essential steps). (Contributed by NM, 23-Apr-2017) (Proof shortened by Wolf Lammen, 5-Aug-2017) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Hypothesis speimfw.2 ⊢ x = y → φ → ψ
Assertion speimfwALT ⊢ ¬ ∀ x ¬ x = y → ∀ x φ → ∃ x ψ

Proof

Step Hyp Ref Expression
1 speimfw.2 ⊢ x = y → φ → ψ
2 1 eximi ⊢ ∃ x x = y → ∃ x φ → ψ
3 df-ex ⊢ ∃ x x = y ↔ ¬ ∀ x ¬ x = y
4 19.35 ⊢ ∃ x φ → ψ ↔ ∀ x φ → ∃ x ψ
5 2 3 4 3imtr3i ⊢ ¬ ∀ x ¬ x = y → ∀ x φ → ∃ x ψ