ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  equidqe Unicode version

Theorem equidqe 1513
Description: equid 1678 with some quantification and negation without using ax-4 1488 or ax-17 1507. (Contributed by NM, 13-Jan-2011.) (Proof shortened by Wolf Lammen, 27-Feb-2014.)
Assertion
Ref Expression
equidqe  |-  -.  A. y  -.  x  =  x

Proof of Theorem equidqe
StepHypRef Expression
1 ax-9 1512 . 2  |-  -.  A. y  -.  y  =  x
2 ax-8 1483 . . . . 5  |-  ( y  =  x  ->  (
y  =  x  ->  x  =  x )
)
32pm2.43i 49 . . . 4  |-  ( y  =  x  ->  x  =  x )
43con3i 622 . . 3  |-  ( -.  x  =  x  ->  -.  y  =  x
)
54alimi 1432 . 2  |-  ( A. y  -.  x  =  x  ->  A. y  -.  y  =  x )
61, 5mto 652 1  |-  -.  A. y  -.  x  =  x
Colors of variables: wff set class
Syntax hints:   -. wn 3   A.wal 1330
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-5 1424  ax-gen 1426  ax-ie2 1471  ax-8 1483  ax-i9 1511
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338
This theorem is referenced by:  ax4sp1  1514
  Copyright terms: Public domain W3C validator