Theorem aecoms 2457

Description: A commutation rule for identical variable specifiers. Usage of this theorem is discouraged because it depends on ax-13 2401. (Contributed by NM, 10-May-1993.) (New usage is discouraged.)

Hypothesis

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

Assertion

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

Proof of Theorem aecoms

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

This proof depends on syntax axioms:   → wi 4  ∀wal 1567

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-10 2177  ax-12 2212  ax-13 2401

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1812  df-nf 1816

This theorem is used by:  axc11  2459  nd4  10678  axrepnd  10682  axpownd  10689  axregnd  10692  axinfnd  10694  axacndlem5  10699  axacnd  10700  e2ebind  45639