Theorem fnresdisj 6659

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 6006	. . 3 ⊢ Rel (𝐹 ↾ 𝐵)
2		reldm0 5920	. . 3 ⊢ (Rel (𝐹 ↾ 𝐵) → ((𝐹 ↾ 𝐵) = ∅ ↔ dom (𝐹 ↾ 𝐵) = ∅))
3	1, 2	ax-mp 5	. 2 ⊢ ((𝐹 ↾ 𝐵) = ∅ ↔ dom (𝐹 ↾ 𝐵) = ∅)
4		dmres 6013	. . . . 5 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
5		incom 4162	. . . . 5 ⊢ (𝐵 ∩ dom 𝐹) = (dom 𝐹 ∩ 𝐵)
6	4, 5	eqtri 2788	. . . 4 ⊢ dom (𝐹 ↾ 𝐵) = (dom 𝐹 ∩ 𝐵)
7		fndm 6642	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
8	7	ineq1d 4172	. . . 4 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∩ 𝐵) = (𝐴 ∩ 𝐵))
9	6, 8	eqtrid 2812	. . 3 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ↾ 𝐵) = (𝐴 ∩ 𝐵))
10	9	eqeq1d 2767	. 2 ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ↾ 𝐵) = ∅ ↔ (𝐴 ∩ 𝐵) = ∅))
11	3, 10	bitr2id 287	1 ⊢ (𝐹 Fn 𝐴 → ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐹 ↾ 𝐵) = ∅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   = wceq 1570   ∩ cin 3905  ∅c0 4286  dom cdm 5663   ↾ cres 5665  Rel wrel 5668   Fn wfn 6535

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  df-fn 6543

This theorem is used by:  funressn  7162  fvsnun2  7187  dif1enlem  9151  axdc3lem4  10452  fseq1p1m1  13643  hashgval  14387  hashinf  14389  pwssplit1  21230  mplmonmul  22237  wwlksm1edg  30297  psrmonmul  34004  eulerpartlemt  34826  poimirlem3  38331  pwssplit4  43874  isubgr0uhgr  48696