Metamath Proof Explorer


Theorem eliminable3a

Description: A theorem used to prove the base case of the Eliminability Theorem (see section comment). (Contributed by BJ, 19-Oct-2019) (Proof modification is discouraged.) (New usage is discouraged.)

Ref Expression
Assertion eliminable3a x | φ y z z = x | φ z y

Proof

Step Hyp Ref Expression
1 dfclel x | φ y z z = x | φ z y