Theorem nelb 3238

Description: A definition of ¬ 𝐴 ∈ 𝐵. (Contributed by Thierry Arnoux, 20-Nov-2023.) (Proof shortened by SN, 23-Jan-2024.) (Proof shortened by Wolf Lammen, 3-Nov-2024.)

Assertion

Ref	Expression
nelb	⊢ (¬ 𝐴 ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝑥 ≠ 𝐴)

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵

Proof of Theorem nelb

Step	Hyp	Ref	Expression
1		df-ne 2958	. . . 4 ⊢ (𝑥 ≠ 𝐴 ↔ ¬ 𝑥 = 𝐴)
2	1	ralbii 3108	. . 3 ⊢ (∀𝑥 ∈ 𝐵 𝑥 ≠ 𝐴 ↔ ∀𝑥 ∈ 𝐵 ¬ 𝑥 = 𝐴)
3		ralnex 3088	. . 3 ⊢ (∀𝑥 ∈ 𝐵 ¬ 𝑥 = 𝐴 ↔ ¬ ∃𝑥 ∈ 𝐵 𝑥 = 𝐴)
4	2, 3	bitr2i 278	. 2 ⊢ (¬ ∃𝑥 ∈ 𝐵 𝑥 = 𝐴 ↔ ∀𝑥 ∈ 𝐵 𝑥 ≠ 𝐴)
5		risset 3237	. 2 ⊢ (𝐴 ∈ 𝐵 ↔ ∃𝑥 ∈ 𝐵 𝑥 = 𝐴)
6	4, 5	xchnxbir 335	1 ⊢ (¬ 𝐴 ∈ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝑥 ≠ 𝐴)

Syntax hints:  ¬ wn 3   ↔ wb 208   = wceq 1560   ∈ wcel 2142   ≠ wne 2957  ∀wral 3076  ∃wrex 3086

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144

This theorem depends on definitions:  df-bi 209  df-an 400  df-ex 1800  df-clel 2837  df-ne 2958  df-ral 3077  df-rex 3087

This theorem is referenced by:  dfdif3  4071  inpr0  32731