MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fndifnfp Structured version   Visualization version   GIF version

Theorem fndifnfp 7170
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
StepHypRef Expression
1 dffn2 6713 . . . . . . . 8 (𝐹 Fn 𝐴𝐹:𝐴⟶V)
2 fssxp 6739 . . . . . . . 8 (𝐹:𝐴⟶V → 𝐹 ⊆ (𝐴 × V))
31, 2sylbi 216 . . . . . . 7 (𝐹 Fn 𝐴𝐹 ⊆ (𝐴 × V))
4 ssdif0 4358 . . . . . . 7 (𝐹 ⊆ (𝐴 × V) ↔ (𝐹 ∖ (𝐴 × V)) = ∅)
53, 4sylib 217 . . . . . 6 (𝐹 Fn 𝐴 → (𝐹 ∖ (𝐴 × V)) = ∅)
65uneq2d 4158 . . . . 5 (𝐹 Fn 𝐴 → ((𝐹 ∖ I ) ∪ (𝐹 ∖ (𝐴 × V))) = ((𝐹 ∖ I ) ∪ ∅))
7 un0 4385 . . . . 5 ((𝐹 ∖ I ) ∪ ∅) = (𝐹 ∖ I )
86, 7eqtr2di 2783 . . . 4 (𝐹 Fn 𝐴 → (𝐹 ∖ I ) = ((𝐹 ∖ I ) ∪ (𝐹 ∖ (𝐴 × V))))
9 df-res 5681 . . . . . 6 ( I ↾ 𝐴) = ( I ∩ (𝐴 × V))
109difeq2i 4114 . . . . 5 (𝐹 ∖ ( I ↾ 𝐴)) = (𝐹 ∖ ( I ∩ (𝐴 × V)))
11 difindi 4276 . . . . 5 (𝐹 ∖ ( I ∩ (𝐴 × V))) = ((𝐹 ∖ I ) ∪ (𝐹 ∖ (𝐴 × V)))
1210, 11eqtri 2754 . . . 4 (𝐹 ∖ ( I ↾ 𝐴)) = ((𝐹 ∖ I ) ∪ (𝐹 ∖ (𝐴 × V)))
138, 12eqtr4di 2784 . . 3 (𝐹 Fn 𝐴 → (𝐹 ∖ I ) = (𝐹 ∖ ( I ↾ 𝐴)))
1413dmeqd 5899 . 2 (𝐹 Fn 𝐴 → dom (𝐹 ∖ I ) = dom (𝐹 ∖ ( I ↾ 𝐴)))
15 fnresi 6673 . . 3 ( I ↾ 𝐴) Fn 𝐴
16 fndmdif 7037 . . 3 ((𝐹 Fn 𝐴 ∧ ( I ↾ 𝐴) Fn 𝐴) → dom (𝐹 ∖ ( I ↾ 𝐴)) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (( I ↾ 𝐴)‘𝑥)})
1715, 16mpan2 688 . 2 (𝐹 Fn 𝐴 → dom (𝐹 ∖ ( I ↾ 𝐴)) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ (( I ↾ 𝐴)‘𝑥)})
18 fvresi 7167 . . . . 5 (𝑥𝐴 → (( I ↾ 𝐴)‘𝑥) = 𝑥)
1918neeq2d 2995 . . . 4 (𝑥𝐴 → ((𝐹𝑥) ≠ (( I ↾ 𝐴)‘𝑥) ↔ (𝐹𝑥) ≠ 𝑥))
2019rabbiia 3430 . . 3 {𝑥𝐴 ∣ (𝐹𝑥) ≠ (( I ↾ 𝐴)‘𝑥)} = {𝑥𝐴 ∣ (𝐹𝑥) ≠ 𝑥}
2120a1i 11 . 2 (𝐹 Fn 𝐴 → {𝑥𝐴 ∣ (𝐹𝑥) ≠ (( I ↾ 𝐴)‘𝑥)} = {𝑥𝐴 ∣ (𝐹𝑥) ≠ 𝑥})
2214, 17, 213eqtrd 2770 1 (𝐹 Fn 𝐴 → dom (𝐹 ∖ I ) = {𝑥𝐴 ∣ (𝐹𝑥) ≠ 𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  wcel 2098  wne 2934  {crab 3426  Vcvv 3468  cdif 3940  cun 3941  cin 3942  wss 3943  c0 4317   I cid 5566   × cxp 5667  dom cdm 5669  cres 5671   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 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pr 5420
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-iota 6489  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545
This theorem is referenced by:  fnelnfp  7171  fnnfpeq0  7172  f1omvdcnv  19364  pmtrmvd  19376  pmtrdifellem4  19399  sygbasnfpfi  19432
  Copyright terms: Public domain W3C validator