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

Theorem nabbib 3045
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.) Definitial form. (Revised by Wolf Lammen, 5-Mar-2025.)
Assertion
Ref Expression
nabbib ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))

Proof of Theorem nabbib
StepHypRef Expression
1 df-ne 2941 . 2 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ¬ {𝑥𝜑} = {𝑥𝜓})
2 exnal 1829 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ¬ ∀𝑥(𝜑𝜓))
3 xor3 383 . . . . 5 (¬ (𝜑𝜓) ↔ (𝜑 ↔ ¬ 𝜓))
43exbii 1850 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
52, 4bitr3i 276 . . 3 (¬ ∀𝑥(𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
6 abbib 2804 . . 3 ({𝑥𝜑} = {𝑥𝜓} ↔ ∀𝑥(𝜑𝜓))
75, 6xchnxbir 332 . 2 (¬ {𝑥𝜑} = {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
81, 7bitri 274 1 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 205  wal 1539   = wceq 1541  wex 1781  {cab 2709  wne 2940
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-ex 1782  df-nf 1786  df-sb 2068  df-clab 2710  df-cleq 2724  df-ne 2941
This theorem is referenced by:  suppvalbr  8149
  Copyright terms: Public domain W3C validator