Theorem nalequcoms 1531

Description: A commutation rule for distinct variable specifiers. (Contributed by NM, 2-Jan-2002.) (Revised by Mario Carneiro, 2-Feb-2015.)

Hypothesis

Ref	Expression
nalequcoms.1	⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑)

Assertion

Ref	Expression
nalequcoms	⊢ (¬ ∀𝑦 𝑦 = 𝑥 → 𝜑)

Proof of Theorem nalequcoms

Step	Hyp	Ref	Expression
1		alequcom 1529	. . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑦 𝑦 = 𝑥)
2	1	con3i 633	. 2 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → ¬ ∀𝑥 𝑥 = 𝑦)
3		nalequcoms.1	. 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → 𝜑)
4	2, 3	syl 14	1 ⊢ (¬ ∀𝑦 𝑦 = 𝑥 → 𝜑)

Syntax hints:  ¬ wn 3   → wi 4  ∀wal 1362   = wceq 1364

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-in1 615  ax-in2 616  ax-10 1519

This theorem is referenced by:  nd5  1832