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

Theorem nabbi 3121
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 3017 . 2 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ¬ {𝑥𝜑} = {𝑥𝜓})
2 exnal 1827 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ¬ ∀𝑥(𝜑𝜓))
3 xor3 386 . . . . 5 (¬ (𝜑𝜓) ↔ (𝜑 ↔ ¬ 𝜓))
43exbii 1848 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
52, 4bitr3i 279 . . 3 (¬ ∀𝑥(𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
6 abbi 2888 . . 3 (∀𝑥(𝜑𝜓) ↔ {𝑥𝜑} = {𝑥𝜓})
75, 6xchnxbi 334 . 2 (¬ {𝑥𝜑} = {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
81, 7bitr2i 278 1 (∃𝑥(𝜑 ↔ ¬ 𝜓) ↔ {𝑥𝜑} ≠ {𝑥𝜓})
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wal 1535   = wceq 1537  wex 1780  {cab 2799  wne 3016
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-ne 3017
This theorem is referenced by:  suppvalbr  7834
  Copyright terms: Public domain W3C validator