Theorem resinsn 49709

Description: Restriction to the intersection with a singleton. (Contributed by Zhi Wang, 6-Oct-2025.)

Assertion

Ref	Expression
resinsn	⊢ ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ ¬ 𝐵 ∈ (dom 𝐹 ∩ 𝐴))

Proof of Theorem resinsn

Step	Hyp	Ref	Expression
1		relres 6006	. . 3 ⊢ Rel (𝐹 ↾ (𝐴 ∩ {𝐵}))
2		reldm0 5920	. . 3 ⊢ (Rel (𝐹 ↾ (𝐴 ∩ {𝐵})) → ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅))
3	1, 2	ax-mp 5	. 2 ⊢ ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅)
4		incom 4162	. . . 4 ⊢ ((𝐴 ∩ {𝐵}) ∩ dom 𝐹) = (dom 𝐹 ∩ (𝐴 ∩ {𝐵}))
5		dmres 6013	. . . 4 ⊢ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ((𝐴 ∩ {𝐵}) ∩ dom 𝐹)
6		inass 4180	. . . 4 ⊢ ((dom 𝐹 ∩ 𝐴) ∩ {𝐵}) = (dom 𝐹 ∩ (𝐴 ∩ {𝐵}))
7	4, 5, 6	3eqtr4i 2798	. . 3 ⊢ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ((dom 𝐹 ∩ 𝐴) ∩ {𝐵})
8	7	eqeq1i 2770	. 2 ⊢ (dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ ((dom 𝐹 ∩ 𝐴) ∩ {𝐵}) = ∅)
9		disjsn 4679	. 2 ⊢ (((dom 𝐹 ∩ 𝐴) ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ (dom 𝐹 ∩ 𝐴))
10	3, 8, 9	3bitri 300	1 ⊢ ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ ¬ 𝐵 ∈ (dom 𝐹 ∩ 𝐴))

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   = wceq 1570   ∈ wcel 2146   ∩ cin 3905  ∅c0 4286  {csn 4591  dom cdm 5663   ↾ cres 5665  Rel wrel 5668

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 2148  ax-9 2156  ax-ext 2737  ax-sep 5259  ax-pr 5406

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 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-br 5112  df-opab 5176  df-xp 5669  df-rel 5670  df-dm 5673  df-res 5675

This theorem is used by:  tposres2  49717