Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  equcomi1 Structured version   Visualization version   GIF version

Theorem equcomi1 39734
Description: Proof of equcomi 2050 from equid1 39733, avoiding use of ax-5 1943 (the only use of ax-5 1943 is via ax7 2049, so using ax-7 2041 instead would remove dependency on ax-5 1943). (Contributed by BJ, 8-Jul-2021.) (Proof modification is discouraged.) (New usage is discouraged.)
Assertion
Ref Expression
equcomi1 (𝑥 = 𝑦𝑦 = 𝑥)

Proof of Theorem equcomi1
StepHypRef Expression
1 equid1 39733 . 2 𝑥 = 𝑥
2 ax7 2049 . 2 (𝑥 = 𝑦 → (𝑥 = 𝑥𝑦 = 𝑥))
31, 2mpi 21 1 (𝑥 = 𝑦𝑦 = 𝑥)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-c5 39717  ax-c4 39718  ax-c7 39719  ax-c10 39720  ax-c9 39724
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813
This theorem is used by:  aecom-o  39735
  Copyright terms: Public domain W3C validator