Theorem fnresdisj 6657

Description: A function restricted to a class disjoint with its domain is empty. (Contributed by NM, 23-Sep-2004.)

Assertion

Ref	Expression
fnresdisj	⊢ (𝐹 Fn 𝐴 → ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐹 ↾ 𝐵) = ∅))

Proof of Theorem fnresdisj

Step	Hyp	Ref	Expression
1		relres 5996	. . 3 ⊢ Rel (𝐹 ↾ 𝐵)
2		reldm0 5910	. . 3 ⊢ (Rel (𝐹 ↾ 𝐵) → ((𝐹 ↾ 𝐵) = ∅ ↔ dom (𝐹 ↾ 𝐵) = ∅))
3	1, 2	ax-mp 5	. 2 ⊢ ((𝐹 ↾ 𝐵) = ∅ ↔ dom (𝐹 ↾ 𝐵) = ∅)
4		dmres 6003	. . . . 5 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
5		incom 4155	. . . . 5 ⊢ (𝐵 ∩ dom 𝐹) = (dom 𝐹 ∩ 𝐵)
6	4, 5	eqtri 2784	. . . 4 ⊢ dom (𝐹 ↾ 𝐵) = (dom 𝐹 ∩ 𝐵)
7		fndm 6640	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
8	7	ineq1d 4165	. . . 4 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∩ 𝐵) = (𝐴 ∩ 𝐵))
9	6, 8	eqtrid 2808	. . 3 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ↾ 𝐵) = (𝐴 ∩ 𝐵))
10	9	eqeq1d 2763	. 2 ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ↾ 𝐵) = ∅ ↔ (𝐴 ∩ 𝐵) = ∅))
11	3, 10	bitr2id 287	1 ⊢ (𝐹 Fn 𝐴 → ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐹 ↾ 𝐵) = ∅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∩ cin 3898  ∅c0 4279  dom cdm 5651   ↾ cres 5653  Rel wrel 5656   Fn wfn 6532

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 2733  ax-sep 5249  ax-pr 5391

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 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-xp 5657  df-rel 5658  df-dm 5661  df-res 5663  df-fn 6540

This theorem is used by:  funressn  7161  fvsnun2  7186  dif1enlem  9168  axdc3lem4  10524  fseq1p1m1  13725  hashgval  14470  hashinf  14472  pwssplit1  21327  mplmonmul  22338  wwlksm1edg  30463  psrmonmul  34175  eulerpartlemt  34996  poimirlem3  38521  pwssplit4  44075  isubgr0uhgr  48940