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

Theorem fninfp 7153
Description: Express the class of fixed points of a function. (Contributed by Stefan O'Rear, 1-Feb-2015.)
Assertion
Ref Expression
fninfp (𝐹 Fn 𝐴 → dom (𝐹 ∩ I ) = {𝑥𝐴 ∣ (𝐹𝑥) = 𝑥})
Distinct variable groups:   𝑥,𝐹   𝑥,𝐴

Proof of Theorem fninfp
StepHypRef Expression
1 fnresdm 6635 . . . . 5 (𝐹 Fn 𝐴 → (𝐹𝐴) = 𝐹)
21ineq1d 4169 . . . 4 (𝐹 Fn 𝐴 → ((𝐹𝐴) ∩ I ) = (𝐹 ∩ I ))
3 inres 5979 . . . . . 6 ( I ∩ (𝐹𝐴)) = (( I ∩ 𝐹) ↾ 𝐴)
4 incom 4159 . . . . . . 7 ( I ∩ 𝐹) = (𝐹 ∩ I )
54reseq1i 5957 . . . . . 6 (( I ∩ 𝐹) ↾ 𝐴) = ((𝐹 ∩ I ) ↾ 𝐴)
63, 5eqtri 2784 . . . . 5 ( I ∩ (𝐹𝐴)) = ((𝐹 ∩ I ) ↾ 𝐴)
7 incom 4159 . . . . 5 ((𝐹𝐴) ∩ I ) = ( I ∩ (𝐹𝐴))
8 inres 5979 . . . . 5 (𝐹 ∩ ( I ↾ 𝐴)) = ((𝐹 ∩ I ) ↾ 𝐴)
96, 7, 83eqtr4i 2794 . . . 4 ((𝐹𝐴) ∩ I ) = (𝐹 ∩ ( I ↾ 𝐴))
102, 9eqtr3di 2811 . . 3 (𝐹 Fn 𝐴 → (𝐹 ∩ I ) = (𝐹 ∩ ( I ↾ 𝐴)))
1110dmeqd 5877 . 2 (𝐹 Fn 𝐴 → dom (𝐹 ∩ I ) = dom (𝐹 ∩ ( I ↾ 𝐴)))
12 fnresi 6645 . . 3 ( I ↾ 𝐴) Fn 𝐴
13 fndmin 7021 . . 3 ((𝐹 Fn 𝐴 ∧ ( I ↾ 𝐴) Fn 𝐴) → dom (𝐹 ∩ ( I ↾ 𝐴)) = {𝑥𝐴 ∣ (𝐹𝑥) = (( I ↾ 𝐴)‘𝑥)})
1412, 13mpan2 701 . 2 (𝐹 Fn 𝐴 → dom (𝐹 ∩ ( I ↾ 𝐴)) = {𝑥𝐴 ∣ (𝐹𝑥) = (( I ↾ 𝐴)‘𝑥)})
15 fvresi 7152 . . . . 5 (𝑥𝐴 → (( I ↾ 𝐴)‘𝑥) = 𝑥)
1615eqeq2d 2772 . . . 4 (𝑥𝐴 → ((𝐹𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ (𝐹𝑥) = 𝑥))
1716rabbiia 3417 . . 3 {𝑥𝐴 ∣ (𝐹𝑥) = (( I ↾ 𝐴)‘𝑥)} = {𝑥𝐴 ∣ (𝐹𝑥) = 𝑥}
1817a1i 11 . 2 (𝐹 Fn 𝐴 → {𝑥𝐴 ∣ (𝐹𝑥) = (( I ↾ 𝐴)‘𝑥)} = {𝑥𝐴 ∣ (𝐹𝑥) = 𝑥})
1911, 14, 183eqtrd 2800 1 (𝐹 Fn 𝐴 → dom (𝐹 ∩ I ) = {𝑥𝐴 ∣ (𝐹𝑥) = 𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1559  wcel 2141  {crab 3413  cin 3901   I cid 5537  dom cdm 5643  cres 5645   Fn wfn 6511  cfv 6516
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4284  df-if 4478  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-br 5098  df-opab 5160  df-mpt 5179  df-id 5538  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-res 5655  df-iota 6472  df-fun 6518  df-fn 6519  df-fv 6524
This theorem is referenced by:  fnelfp  7154
  Copyright terms: Public domain W3C validator