Theorem fnresdisj 6662

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 6004	. . . . 5 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
5		incom 4105	. . . . 5 ⊢ (𝐵 ∩ dom 𝐹) = (dom 𝐹 ∩ 𝐵)
6	4, 5	eqtri 2783	. . . 4 ⊢ dom (𝐹 ↾ 𝐵) = (dom 𝐹 ∩ 𝐵)
7		fndm 6645	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
8	7	ineq1d 4115	. . . 4 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∩ 𝐵) = (𝐴 ∩ 𝐵))
9	6, 8	eqtrid 2807	. . 3 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ↾ 𝐵) = (𝐴 ∩ 𝐵))
10	9	eqeq1d 2762	. 2 ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ↾ 𝐵) = ∅ ↔ (𝐴 ∩ 𝐵) = ∅))
11	3, 10	bitr2id 287	1 ⊢ (𝐹 Fn 𝐴 → ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐹 ↾ 𝐵) = ∅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1569   ∩ cin 4088  ∅c0 4277  dom cdm 5650   ↾ cres 5652  Rel wrel 5655   Fn wfn 6536

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-dm 5660  df-res 5662  df-fn 6544

This theorem is used by:  funressn  7166  fvsnun2  7190  dif1enlem  9180  axdc3lem4  10536  fseq1p1m1  13737  hashgval  14482  hashinf  14484  pwssplit1  21341  mplmonmul  22352  wwlksm1edg  30477  psrmonmul  34230  eulerpartlemt  35051  poimirlem3  38648  pwssplit4  44198  isubgr0uhgr  49078