Metamath Proof Explorer


Theorem wl-sbal1

Description: A theorem used in elimination of disjoint variable restriction on x and y by replacing it with a distinctor -. A. x x = z . (Contributed by NM, 15-May-1993) Proof is based on wl-sbalnae now. See also sbal1 . (Revised by Wolf Lammen, 25-Jul-2019) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion wl-sbal1 ⊢ ¬ ∀ x x = z → z y ∀ x φ ↔ ∀ x z y φ

Proof

Step Hyp Ref Expression
1 naev ⊢ ¬ ∀ x x = z → ¬ ∀ x x = y
2 wl-sbalnae ⊢ ¬ ∀ x x = y ∧ ¬ ∀ x x = z → z y ∀ x φ ↔ ∀ x z y φ
3 1 2 mpancom ⊢ ¬ ∀ x x = z → z y ∀ x φ ↔ ∀ x z y φ