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

Theorem nabbib 3059
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 2957 . 2 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ¬ {𝑥𝜑} = {𝑥𝜓})
2 exnal 1846 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ¬ ∀𝑥(𝜑𝜓))
3 xor3 384 . . . . 5 (¬ (𝜑𝜓) ↔ (𝜑 ↔ ¬ 𝜓))
43exbii 1867 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
52, 4bitr3i 279 . . 3 (¬ ∀𝑥(𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
6 abbib 2830 . . 3 ({𝑥𝜑} = {𝑥𝜓} ↔ ∀𝑥(𝜑𝜓))
75, 6xchnxbir 335 . 2 (¬ {𝑥𝜑} = {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
81, 7bitri 277 1 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 208  wal 1557   = wceq 1559  wex 1798  {cab 2739  wne 2956
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-tru 1562  df-ex 1799  df-nf 1803  df-sb 2090  df-clab 2740  df-cleq 2753  df-ne 2957
This theorem is referenced by:  suppvalbr  8139
  Copyright terms: Public domain W3C validator