Theorem fnresdisj 5493

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 5091	. . 3 ⊢ Rel (𝐹 ↾ 𝐵)
2		reldm0 4999	. . 3 ⊢ (Rel (𝐹 ↾ 𝐵) → ((𝐹 ↾ 𝐵) = ∅ ↔ dom (𝐹 ↾ 𝐵) = ∅))
3	1, 2	ax-mp 5	. 2 ⊢ ((𝐹 ↾ 𝐵) = ∅ ↔ dom (𝐹 ↾ 𝐵) = ∅)
4		dmres 5084	. . . . 5 ⊢ dom (𝐹 ↾ 𝐵) = (𝐵 ∩ dom 𝐹)
5		incom 3421	. . . . 5 ⊢ (𝐵 ∩ dom 𝐹) = (dom 𝐹 ∩ 𝐵)
6	4, 5	eqtri 2259	. . . 4 ⊢ dom (𝐹 ↾ 𝐵) = (dom 𝐹 ∩ 𝐵)
7		fndm 5480	. . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
8	7	ineq1d 3431	. . . 4 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∩ 𝐵) = (𝐴 ∩ 𝐵))
9	6, 8	eqtrid 2283	. . 3 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ↾ 𝐵) = (𝐴 ∩ 𝐵))
10	9	eqeq1d 2247	. 2 ⊢ (𝐹 Fn 𝐴 → (dom (𝐹 ↾ 𝐵) = ∅ ↔ (𝐴 ∩ 𝐵) = ∅))
11	3, 10	bitr2id 193	1 ⊢ (𝐹 Fn 𝐴 → ((𝐴 ∩ 𝐵) = ∅ ↔ (𝐹 ↾ 𝐵) = ∅))

This proof depends on syntax axioms:   → wi 4   ↔ wb 105   = wceq 1402   ∩ cin 3219  ∅c0 3520  dom cdm 4774   ↾ cres 4776  Rel wrel 4779   Fn wfn 5372

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-dm 4784  df-res 4786  df-fn 5380

This theorem is used by:  fresaunres2disj  5570  fvsnun2  5913  fseq1p1m1  10501  gsump1  14157