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

Theorem nabbib 3051
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 2947 . 2 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ¬ {𝑥𝜑} = {𝑥𝜓})
2 exnal 1825 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ¬ ∀𝑥(𝜑𝜓))
3 xor3 382 . . . . 5 (¬ (𝜑𝜓) ↔ (𝜑 ↔ ¬ 𝜓))
43exbii 1846 . . . 4 (∃𝑥 ¬ (𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
52, 4bitr3i 277 . . 3 (¬ ∀𝑥(𝜑𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
6 abbib 2814 . . 3 ({𝑥𝜑} = {𝑥𝜓} ↔ ∀𝑥(𝜑𝜓))
75, 6xchnxbir 333 . 2 (¬ {𝑥𝜑} = {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
81, 7bitri 275 1 ({𝑥𝜑} ≠ {𝑥𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wb 206  wal 1535   = wceq 1537  wex 1777  {cab 2717  wne 2946
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-tru 1540  df-ex 1778  df-nf 1782  df-sb 2065  df-clab 2718  df-cleq 2732  df-ne 2947
This theorem is referenced by:  suppvalbr  8205
  Copyright terms: Public domain W3C validator