Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-aecomsv Structured version   Visualization version   GIF version

Theorem bj-aecomsv 37484
Description: Version of aecoms 2463 with a disjoint variable condition, provable from Tarski's FOL. The corresponding version of naecoms 2464 should not be very useful since ¬ ∀𝑥𝑥 = 𝑦, DV (𝑥, 𝑦) is true when the universe has at least two objects (see dtru 5423). (Contributed by BJ, 31-May-2019.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
bj-aecomsv.1 (∀𝑥 𝑥 = 𝑦𝜑)
Assertion
Ref Expression
bj-aecomsv (∀𝑦 𝑦 = 𝑥𝜑)
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem bj-aecomsv
StepHypRef Expression
1 aevlem 2090 . 2 (∀𝑦 𝑦 = 𝑥 → ∀𝑥 𝑥 = 𝑦)
2 bj-aecomsv.1 . 2 (∀𝑥 𝑥 = 𝑦𝜑)
31, 2syl 18 1 (∀𝑦 𝑦 = 𝑥𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wal 1568
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
This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813
This theorem is used by:  bj-axc11v  37485
  Copyright terms: Public domain W3C validator