HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem necon1ad 1634
Description: Contrapositive deduction for inequality.
Hypothesis
Ref Expression
necon1ad.1 |- (ph -> (-. ps -> A = B))
Assertion
Ref Expression
necon1ad |- (ph -> (A =/= B -> ps))

Proof of Theorem necon1ad
StepHypRef Expression
1 necon1ad.1 . . 3 |- (ph -> (-. ps -> A = B))
21con1d 93 . 2 |- (ph -> (-. A = B -> ps))
3 df-ne 1590 . 2 |- (A =/= B <-> -. A = B)
42, 3syl5ib 206 1 |- (ph -> (A =/= B -> ps))
Colors of variables: wff set class
Syntax hints:  -. wn 2   -> wi 3   = wceq 958   =/= wne 1588
This theorem is referenced by:  onmindif2 3067  aceq5lem4 4748  dfn2 6114  uzwo4OLD 6212  uzwo 6456  lnon0 8454  h1datom 9499  atsseq 10269
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7
This theorem depends on definitions:  df-bi 147  df-ne 1590
Copyright terms: Public domain