Theorem snres0 6256

Description: Condition for restriction of a singleton to be empty. (Contributed by Scott Fenton, 9-Aug-2024.)

Hypothesis

Ref	Expression
snres0.1	⊢ 𝐵 ∈ V

Assertion

Ref	Expression
snres0	⊢ (({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅ ↔ ¬ 𝐴 ∈ 𝐶)

Proof of Theorem snres0

Step	Hyp	Ref	Expression
1		relres 5964	. . 3 ⊢ Rel ({⟨𝐴, 𝐵⟩} ↾ 𝐶)
2		reldm0 5877	. . 3 ⊢ (Rel ({⟨𝐴, 𝐵⟩} ↾ 𝐶) → (({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅ ↔ dom ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅))
3	1, 2	ax-mp 5	. 2 ⊢ (({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅ ↔ dom ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅)
4		dmres 5971	. . . 4 ⊢ dom ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = (𝐶 ∩ dom {⟨𝐴, 𝐵⟩})
5		snres0.1	. . . . . 6 ⊢ 𝐵 ∈ V
6	5	dmsnop 6174	. . . . 5 ⊢ dom {⟨𝐴, 𝐵⟩} = {𝐴}
7	6	ineq2i 4169	. . . 4 ⊢ (𝐶 ∩ dom {⟨𝐴, 𝐵⟩}) = (𝐶 ∩ {𝐴})
8	4, 7	eqtri 2759	. . 3 ⊢ dom ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = (𝐶 ∩ {𝐴})
9	8	eqeq1i 2741	. 2 ⊢ (dom ({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅ ↔ (𝐶 ∩ {𝐴}) = ∅)
10		disjsn 4668	. 2 ⊢ ((𝐶 ∩ {𝐴}) = ∅ ↔ ¬ 𝐴 ∈ 𝐶)
11	3, 9, 10	3bitri 297	1 ⊢ (({⟨𝐴, 𝐵⟩} ↾ 𝐶) = ∅ ↔ ¬ 𝐴 ∈ 𝐶)

Syntax hints:  ¬ wn 3   ↔ wb 206   = wceq 1541   ∈ wcel 2113  Vcvv 3440   ∩ cin 3900  ∅c0 4285  {csn 4580  ⟨cop 4586  dom cdm 5624   ↾ cres 5626  Rel wrel 5629

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pr 5377

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-sn 4581  df-pr 4583  df-op 4587  df-br 5099  df-opab 5161  df-xp 5630  df-rel 5631  df-dm 5634  df-res 5636

This theorem is referenced by:  noinfbnd2lem1  27698