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

Theorem nabbi 2884
Description: Not equivalent wff's correspond to not equal class abstractions. (Contributed by AV, 7-Apr-2019.) (Proof shortened by Wolf Lammen, 25-Nov-2019.)
Assertion
Ref Expression
nabbi (∃𝑥(𝜑 ↔ ¬ 𝜓) ↔ {𝑥𝜑} ≠ {𝑥𝜓})

Proof of Theorem nabbi
StepHypRef Expression
1 df-ne 2782 . 2 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ¬ {𝑥𝜑} = {𝑥𝜓})
2 exnal 1744 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ¬ ∀𝑥(𝜑𝜓))
3 xor3 371 . . . . 5 (¬ (𝜑𝜓) ↔ (𝜑 ↔ ¬ 𝜓))
43exbii 1764 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
52, 4bitr3i 265 . . 3 (¬ ∀𝑥(𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
6 abbi 2724 . . 3 (∀𝑥(𝜑𝜓) ↔ {𝑥𝜑} = {𝑥𝜓})
75, 6xchnxbi 321 . 2 (¬ {𝑥𝜑} = {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
81, 7bitr2i 264 1 (∃𝑥(𝜑 ↔ ¬ 𝜓) ↔ {𝑥𝜑} ≠ {𝑥𝜓})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 195  wal 1473   = wceq 1475  wex 1695  {cab 2596  wne 2780
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  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-ne 2782
This theorem is referenced by:  suppvalbr  7186
  Copyright terms: Public domain W3C validator