Theorem nabbib 3060

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

Step	Hyp	Ref	Expression
1		df-ne 2956	. 2 ⊢ ({𝑥 ∣ 𝜑} ≠ {𝑥 ∣ 𝜓} ↔ ¬ {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓})
2		exnal 1859	. . . 4 ⊢ (∃𝑥 ¬ (𝜑 ↔ 𝜓) ↔ ¬ ∀𝑥(𝜑 ↔ 𝜓))
3		xor3 385	. . . . 5 ⊢ (¬ (𝜑 ↔ 𝜓) ↔ (𝜑 ↔ ¬ 𝜓))
4	3	exbii 1880	. . . 4 ⊢ (∃𝑥 ¬ (𝜑 ↔ 𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
5	2, 4	bitr3i 280	. . 3 ⊢ (¬ ∀𝑥(𝜑 ↔ 𝜓) ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
6		abbib 2829	. . 3 ⊢ ({𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓} ↔ ∀𝑥(𝜑 ↔ 𝜓))
7	5, 6	xchnxbir 336	. 2 ⊢ (¬ {𝑥 ∣ 𝜑} = {𝑥 ∣ 𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))
8	1, 7	bitri 278	1 ⊢ ({𝑥 ∣ 𝜑} ≠ {𝑥 ∣ 𝜓} ↔ ∃𝑥(𝜑 ↔ ¬ 𝜓))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209  ∀wal 1567   = wceq 1569  ∃wex 1811  {cab 2738   ≠ wne 2955

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-nf 1816  df-sb 2099  df-clab 2739  df-cleq 2752  df-ne 2956

This theorem is used by:  suppvalbr  8183  suppvalbrOLD  8184