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 31934
Description: Version of aecoms 2300 with a dv condition, provable from Tarski's FOL. The corresponding version of naecoms 2301 should not be very useful since ¬ ∀𝑥𝑥 = 𝑦, DV(x, y) is true when the universe has at least two objects (see bj-dtru 31985). (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 bj-axc11nv 31933 . 2 (∀𝑦 𝑦 = 𝑥 → ∀𝑥 𝑥 = 𝑦)
2 bj-aecomsv.1 . 2 (∀𝑥 𝑥 = 𝑦𝜑)
31, 2syl 17 1 (∀𝑦 𝑦 = 𝑥𝜑)
Colors of variables: wff setvar class
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
This theorem depends on definitions:  df-bi 196  df-an 385  df-ex 1696
This theorem is referenced by:  bj-axc11v  31935
  Copyright terms: Public domain W3C validator