Theorem fndifnfp 7175

Description: Express the class of non-fixed points of a function. (Contributed by Stefan O'Rear, 14-Aug-2015.)

Assertion

Ref	Expression
fndifnfp	⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∖ I ) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥})

Distinct variable groups:   𝑥,𝐹   𝑥,𝐴

Proof of Theorem fndifnfp

Step	Hyp	Ref	Expression
1		dffn2 6708	. . . . . . . 8 ⊢ (𝐹 Fn 𝐴 ↔ 𝐹:𝐴⟶V)
2		fssxp 6734	. . . . . . . 8 ⊢ (𝐹:𝐴⟶V → 𝐹 ⊆ (𝐴 × V))
3	1, 2	sylbi 220	. . . . . . 7 ⊢ (𝐹 Fn 𝐴 → 𝐹 ⊆ (𝐴 × V))
4		ssdif0 4329	. . . . . . 7 ⊢ (𝐹 ⊆ (𝐴 × V) ↔ (𝐹 ∖ (𝐴 × V)) = ∅)
5	3, 4	sylib 221	. . . . . 6 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∖ (𝐴 × V)) = ∅)
6	5	uneq2d 4130	. . . . 5 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ∖ I ) ∪ (𝐹 ∖ (𝐴 × V))) = ((𝐹 ∖ I ) ∪ ∅))
7		un0 4358	. . . . 5 ⊢ ((𝐹 ∖ I ) ∪ ∅) = (𝐹 ∖ I )
8	6, 7	eqtr2di 2821	. . . 4 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∖ I ) = ((𝐹 ∖ I ) ∪ (𝐹 ∖ (𝐴 × V))))
9		df-res 5674	. . . . . 6 ⊢ ( I ↾ 𝐴) = ( I ∩ (𝐴 × V))
10	9	difeq2i 4086	. . . . 5 ⊢ (𝐹 ∖ ( I ↾ 𝐴)) = (𝐹 ∖ ( I ∩ (𝐴 × V)))
11		difindi 4253	. . . . 5 ⊢ (𝐹 ∖ ( I ∩ (𝐴 × V))) = ((𝐹 ∖ I ) ∪ (𝐹 ∖ (𝐴 × V)))
12	10, 11	eqtri 2792	. . . 4 ⊢ (𝐹 ∖ ( I ↾ 𝐴)) = ((𝐹 ∖ I ) ∪ (𝐹 ∖ (𝐴 × V)))
13	8, 12	eqtr4di 2822	. . 3 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∖ I ) = (𝐹 ∖ ( I ↾ 𝐴)))
14	13	dmeqd 5896	. 2 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∖ I ) = dom (𝐹 ∖ ( I ↾ 𝐴)))
15		fnresi 6665	. . 3 ⊢ ( I ↾ 𝐴) Fn 𝐴
16		fndmdif 7038	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ( I ↾ 𝐴) Fn 𝐴) → dom (𝐹 ∖ ( I ↾ 𝐴)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ (( I ↾ 𝐴)‘𝑥)})
17	15, 16	mpan2 703	. 2 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∖ ( I ↾ 𝐴)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ (( I ↾ 𝐴)‘𝑥)})
18		fvresi 7172	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → (( I ↾ 𝐴)‘𝑥) = 𝑥)
19	18	neeq2d 3024	. . . 4 ⊢ (𝑥 ∈ 𝐴 → ((𝐹‘𝑥) ≠ (( I ↾ 𝐴)‘𝑥) ↔ (𝐹‘𝑥) ≠ 𝑥))
20	19	rabbiia 3427	. . 3 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ (( I ↾ 𝐴)‘𝑥)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥}
21	20	a1i 11	. 2 ⊢ (𝐹 Fn 𝐴 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ (( I ↾ 𝐴)‘𝑥)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥})
22	14, 17, 21	3eqtrd 2808	1 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∖ I ) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) ≠ 𝑥})

Syntax hints:   → wi 4   = wceq 1567   ∈ wcel 2149   ≠ wne 2964  {crab 3423  Vcvv 3463   ∖ cdif 3910   ∪ cun 3911   ∩ cin 3912   ⊆ wss 3913  ∅c0 4294   I cid 5556   × cxp 5660  dom cdm 5662   ↾ cres 5664   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-12 2219  ax-ext 2741  ax-sep 5261  ax-nul 5271  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-ne 2965  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-br 5114  df-opab 5178  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545

This theorem is referenced by:  fnelnfp  7176  fnnfpeq0  7177  f1omvdcnv  19513  pmtrmvd  19525  pmtrdifellem4  19548  sygbasnfpfi  19581