MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  aecom Structured version   Visualization version   GIF version

Theorem aecom 2465
Description: Commutation law for identical variable specifiers. Both sides of the biconditional are true when 𝑥 and 𝑦 are substituted with the same variable. Usage of this theorem is discouraged because it depends on ax-13 2410. (Contributed by NM, 10-May-1993.) Change to a biconditional. (Revised by BJ, 26-Sep-2019.) (New usage is discouraged.)
Assertion
Ref Expression
aecom (∀𝑥 𝑥 = 𝑦 ↔ ∀𝑦 𝑦 = 𝑥)

Proof of Theorem aecom
StepHypRef Expression
1 axc11n 2464 . 2 (∀𝑥 𝑥 = 𝑦 → ∀𝑦 𝑦 = 𝑥)
2 axc11n 2464 . 2 (∀𝑦 𝑦 = 𝑥 → ∀𝑥 𝑥 = 𝑦)
31, 2impbii 212 1 (∀𝑥 𝑥 = 𝑦 ↔ ∀𝑦 𝑦 = 𝑥)
Colors of variables: wff setvar class
Syntax hints:  wb 209  wal 1565
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-10 2182  ax-12 2219  ax-13 2410
This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1807  df-nf 1811
This theorem is referenced by:  aecoms  2466  naecoms  2467  wl-nfae1  38069
  Copyright terms: Public domain W3C validator