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

Theorem ax13 2249
Description: Derive ax-13 2246 from ax13v 2247 and Tarski's FOL. This shows that the weakening in ax13v 2247 is still sufficient for a complete system. (Contributed by NM, 21-Dec-2015.) (Proof shortened by Wolf Lammen, 31-Jan-2018.) Reduce axiom usage (Revised by Wolf Lammen, 2-Jun-2021.)
Assertion
Ref Expression
ax13  |-  ( -.  x  =  y  -> 
( y  =  z  ->  A. x  y  =  z ) )

Proof of Theorem ax13
Dummy variable  w is distinct from all other variables.
StepHypRef Expression
1 equvinv 1959 . . . 4  |-  ( y  =  z  <->  E. w
( w  =  y  /\  w  =  z ) )
2 ax13lem1 2248 . . . . . . . . 9  |-  ( -.  x  =  y  -> 
( w  =  y  ->  A. x  w  =  y ) )
32imp 445 . . . . . . . 8  |-  ( ( -.  x  =  y  /\  w  =  y )  ->  A. x  w  =  y )
4 ax13lem1 2248 . . . . . . . . 9  |-  ( -.  x  =  z  -> 
( w  =  z  ->  A. x  w  =  z ) )
54imp 445 . . . . . . . 8  |-  ( ( -.  x  =  z  /\  w  =  z )  ->  A. x  w  =  z )
6 ax7v1 1937 . . . . . . . . . 10  |-  ( w  =  y  ->  (
w  =  z  -> 
y  =  z ) )
76imp 445 . . . . . . . . 9  |-  ( ( w  =  y  /\  w  =  z )  ->  y  =  z )
87alanimi 1744 . . . . . . . 8  |-  ( ( A. x  w  =  y  /\  A. x  w  =  z )  ->  A. x  y  =  z )
93, 5, 8syl2an 494 . . . . . . 7  |-  ( ( ( -.  x  =  y  /\  w  =  y )  /\  ( -.  x  =  z  /\  w  =  z
) )  ->  A. x  y  =  z )
109an4s 869 . . . . . 6  |-  ( ( ( -.  x  =  y  /\  -.  x  =  z )  /\  ( w  =  y  /\  w  =  z
) )  ->  A. x  y  =  z )
1110ex 450 . . . . 5  |-  ( ( -.  x  =  y  /\  -.  x  =  z )  ->  (
( w  =  y  /\  w  =  z )  ->  A. x  y  =  z )
)
1211exlimdv 1861 . . . 4  |-  ( ( -.  x  =  y  /\  -.  x  =  z )  ->  ( E. w ( w  =  y  /\  w  =  z )  ->  A. x  y  =  z )
)
131, 12syl5bi 232 . . 3  |-  ( ( -.  x  =  y  /\  -.  x  =  z )  ->  (
y  =  z  ->  A. x  y  =  z ) )
1413ex 450 . 2  |-  ( -.  x  =  y  -> 
( -.  x  =  z  ->  ( y  =  z  ->  A. x  y  =  z )
) )
15 ax13b 1964 . 2  |-  ( ( -.  x  =  y  ->  ( y  =  z  ->  A. x  y  =  z )
)  <->  ( -.  x  =  y  ->  ( -.  x  =  z  -> 
( y  =  z  ->  A. x  y  =  z ) ) ) )
1614, 15mpbir 221 1  |-  ( -.  x  =  y  -> 
( y  =  z  ->  A. x  y  =  z ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 384   A.wal 1481   E.wex 1704
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  ax-13 2246
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705
This theorem is referenced by:  equvini  2346  sbequi  2375
  Copyright terms: Public domain W3C validator