Theorem nelbrim 48150

Description: If a set is related to another set by the negated membership relation, then it is not a member of the other set. The other direction of the implication is not generally true, because if 𝐴 is a proper class, then ¬ 𝐴 ∈ 𝐵 would be true, but not 𝐴 _∉ 𝐵. (Contributed by AV, 26-Dec-2021.)

Assertion

Ref	Expression
nelbrim	⊢ (𝐴 _∉ 𝐵 → ¬ 𝐴 ∈ 𝐵)

Proof of Theorem nelbrim

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		df-nelbr 48147	. . . 4 ⊢ _∉ = {⟨𝑥, 𝑦⟩ ∣ ¬ 𝑥 ∈ 𝑦}
2	1	relopabiv 5805	. . 3 ⊢ Rel _∉
3	2	brrelex12i 5714	. 2 ⊢ (𝐴 _∉ 𝐵 → (𝐴 ∈ V ∧ 𝐵 ∈ V))
4		nelbr 48149	. . 3 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 _∉ 𝐵 ↔ ¬ 𝐴 ∈ 𝐵))
5	4	biimpd 232	. 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 _∉ 𝐵 → ¬ 𝐴 ∈ 𝐵))
6	3, 5	mpcom 39	1 ⊢ (𝐴 _∉ 𝐵 → ¬ 𝐴 ∈ 𝐵)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∈ wcel 2145  Vcvv 3453   class class class wbr 5107   _∉ cnelbr 48146

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-xp 5665  df-rel 5666  df-nelbr 48147

This theorem is used by:  nelbrnelim  48152