Theorem resinsnALT 49348

Description: Restriction to the intersection with a singleton. (Contributed by Zhi Wang, 6-Oct-2025.) (Proof modification is discouraged.) (New usage is discouraged.)

Assertion

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

Proof of Theorem resinsnALT

Step	Hyp	Ref	Expression
1		relres 5970	. . 3 ⊢ Rel (𝐹 ↾ (𝐴 ∩ {𝐵}))
2		reldm0 5883	. . 3 ⊢ (Rel (𝐹 ↾ (𝐴 ∩ {𝐵})) → ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅))
3	1, 2	ax-mp 5	. 2 ⊢ ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅)
4		dmres 5977	. . . 4 ⊢ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ((𝐴 ∩ {𝐵}) ∩ dom 𝐹)
5		incom 4149	. . . 4 ⊢ ((𝐴 ∩ {𝐵}) ∩ dom 𝐹) = (dom 𝐹 ∩ (𝐴 ∩ {𝐵}))
6	4, 5	eqtri 2759	. . 3 ⊢ dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = (dom 𝐹 ∩ (𝐴 ∩ {𝐵}))
7	6	eqeq1i 2741	. 2 ⊢ (dom (𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ (dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = ∅)
8		elin 3905	. . . 4 ⊢ (𝐵 ∈ (dom 𝐹 ∩ 𝐴) ↔ (𝐵 ∈ dom 𝐹 ∧ 𝐵 ∈ 𝐴))
9		ancom 460	. . . 4 ⊢ ((𝐵 ∈ dom 𝐹 ∧ 𝐵 ∈ 𝐴) ↔ (𝐵 ∈ 𝐴 ∧ 𝐵 ∈ dom 𝐹))
10		snssi 4729	. . . . . . . . 9 ⊢ (𝐵 ∈ 𝐴 → {𝐵} ⊆ 𝐴)
11		incom 4149	. . . . . . . . . 10 ⊢ (𝐴 ∩ {𝐵}) = ({𝐵} ∩ 𝐴)
12		dfss2 3907	. . . . . . . . . . 11 ⊢ ({𝐵} ⊆ 𝐴 ↔ ({𝐵} ∩ 𝐴) = {𝐵})
13	12	biimpi 216	. . . . . . . . . 10 ⊢ ({𝐵} ⊆ 𝐴 → ({𝐵} ∩ 𝐴) = {𝐵})
14	11, 13	eqtrid 2783	. . . . . . . . 9 ⊢ ({𝐵} ⊆ 𝐴 → (𝐴 ∩ {𝐵}) = {𝐵})
15	10, 14	syl 17	. . . . . . . 8 ⊢ (𝐵 ∈ 𝐴 → (𝐴 ∩ {𝐵}) = {𝐵})
16	15	ineq2d 4160	. . . . . . 7 ⊢ (𝐵 ∈ 𝐴 → (dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = (dom 𝐹 ∩ {𝐵}))
17	16	eqeq1d 2738	. . . . . 6 ⊢ (𝐵 ∈ 𝐴 → ((dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = ∅ ↔ (dom 𝐹 ∩ {𝐵}) = ∅))
18		disjsn 4655	. . . . . 6 ⊢ ((dom 𝐹 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ dom 𝐹)
19	17, 18	bitrdi 287	. . . . 5 ⊢ (𝐵 ∈ 𝐴 → ((dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = ∅ ↔ ¬ 𝐵 ∈ dom 𝐹))
20		disjsn 4655	. . . . . . . 8 ⊢ ((𝐴 ∩ {𝐵}) = ∅ ↔ ¬ 𝐵 ∈ 𝐴)
21	20	biimpri 228	. . . . . . 7 ⊢ (¬ 𝐵 ∈ 𝐴 → (𝐴 ∩ {𝐵}) = ∅)
22	21	ineq2d 4160	. . . . . 6 ⊢ (¬ 𝐵 ∈ 𝐴 → (dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = (dom 𝐹 ∩ ∅))
23		in0 4335	. . . . . 6 ⊢ (dom 𝐹 ∩ ∅) = ∅
24	22, 23	eqtrdi 2787	. . . . 5 ⊢ (¬ 𝐵 ∈ 𝐴 → (dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = ∅)
25	19, 24	resinsnlem 49346	. . . 4 ⊢ ((𝐵 ∈ 𝐴 ∧ 𝐵 ∈ dom 𝐹) ↔ ¬ (dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = ∅)
26	8, 9, 25	3bitri 297	. . 3 ⊢ (𝐵 ∈ (dom 𝐹 ∩ 𝐴) ↔ ¬ (dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = ∅)
27	26	con2bii 357	. 2 ⊢ ((dom 𝐹 ∩ (𝐴 ∩ {𝐵})) = ∅ ↔ ¬ 𝐵 ∈ (dom 𝐹 ∩ 𝐴))
28	3, 7, 27	3bitri 297	1 ⊢ ((𝐹 ↾ (𝐴 ∩ {𝐵})) = ∅ ↔ ¬ 𝐵 ∈ (dom 𝐹 ∩ 𝐴))

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   = wceq 1542   ∈ wcel 2114   ∩ cin 3888   ⊆ wss 3889  ∅c0 4273  {csn 4567  dom cdm 5631   ↾ cres 5633  Rel wrel 5636

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708  ax-sep 5231  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-br 5086  df-opab 5148  df-xp 5637  df-rel 5638  df-dm 5641  df-res 5643

This theorem is referenced by: (None)