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

Theorem nabbib 3042
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 2938 . 2 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ¬ {𝑥𝜑} = {𝑥𝜓})
2 exnal 1823 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ¬ ∀𝑥(𝜑𝜓))
3 xor3 382 . . . . 5 (¬ (𝜑𝜓) ↔ (𝜑 ↔ ¬ 𝜓))
43exbii 1844 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
52, 4bitr3i 277 . . 3 (¬ ∀𝑥(𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
6 abbib 2808 . . 3 ({𝑥𝜑} = {𝑥𝜓} ↔ ∀𝑥(𝜑𝜓))
75, 6xchnxbir 333 . 2 (¬ {𝑥𝜑} = {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
81, 7bitri 275 1 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 206  wal 1534   = wceq 1536  wex 1775  {cab 2711  wne 2937
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-9 2115  ax-10 2138  ax-11 2154  ax-12 2174  ax-ext 2705
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-tru 1539  df-ex 1776  df-nf 1780  df-sb 2062  df-clab 2712  df-cleq 2726  df-ne 2938
This theorem is referenced by:  suppvalbr  8187
  Copyright terms: Public domain W3C validator