Theorem aecoms 2300

Description: A commutation rule for identical variable specifiers. (Contributed by NM, 10-May-1993.)

Hypothesis

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

Assertion

Ref	Expression
aecoms	⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑)

Proof of Theorem aecoms

Step	Hyp	Ref	Expression
1		aecom 2299	. 2 ⊢ (∀𝑦 𝑦 = 𝑥 ↔ ∀𝑥 𝑥 = 𝑦)
2		aecoms.1	. 2 ⊢ (∀𝑥 𝑥 = 𝑦 → 𝜑)
3	1, 2	sylbi 206	1 ⊢ (∀𝑦 𝑦 = 𝑥 → 𝜑)

Syntax hints:   → wi 4  ∀wal 1473

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-12 2034  ax-13 2234

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701

This theorem is referenced by:  axc11  2302  nd4  9291  axrepnd  9295  axpownd  9302  axregnd  9305  axinfnd  9307  axacndlem5  9312  axacnd  9313  wl-ax11-lem1  32541  wl-ax11-lem3  32543  wl-ax11-lem9  32549  wl-ax11-lem10  32550  e2ebind  37800