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

Theorem bj-aecomsv 32746
Description: Version of aecoms 2312 with a dv condition, provable from Tarski's FOL. The corresponding version of naecoms 2313 should not be very useful since  -.  A. x x  =  y, DV(x, y) is true when the universe has at least two objects (see bj-dtru 32797). (Contributed by BJ, 31-May-2019.) (Proof modification is discouraged.)
Hypothesis
Ref Expression
bj-aecomsv.1  |-  ( A. x  x  =  y  ->  ph )
Assertion
Ref Expression
bj-aecomsv  |-  ( A. y  y  =  x  ->  ph )
Distinct variable group:    x, y
Allowed substitution hints:    ph( x, y)

Proof of Theorem bj-aecomsv
StepHypRef Expression
1 bj-axc11nv 32745 . 2  |-  ( A. y  y  =  x  ->  A. x  x  =  y )
2 bj-aecomsv.1 . 2  |-  ( A. x  x  =  y  ->  ph )
31, 2syl 17 1  |-  ( A. y  y  =  x  ->  ph )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4   A.wal 1481
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705
This theorem is referenced by:  bj-axc11v  32747
  Copyright terms: Public domain W3C validator