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

Theorem fninfp 7172
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 6654 . . . . 5 (𝐹 Fn 𝐴 → (𝐹𝐴) = 𝐹)
21ineq1d 4172 . . . 4 (𝐹 Fn 𝐴 → ((𝐹𝐴) ∩ I ) = (𝐹 ∩ I ))
3 inres 5996 . . . . . 6 ( I ∩ (𝐹𝐴)) = (( I ∩ 𝐹) ↾ 𝐴)
4 incom 4162 . . . . . . 7 ( I ∩ 𝐹) = (𝐹 ∩ I )
54reseq1i 5974 . . . . . 6 (( I ∩ 𝐹) ↾ 𝐴) = ((𝐹 ∩ I ) ↾ 𝐴)
63, 5eqtri 2786 . . . . 5 ( I ∩ (𝐹𝐴)) = ((𝐹 ∩ I ) ↾ 𝐴)
7 incom 4162 . . . . 5 ((𝐹𝐴) ∩ I ) = ( I ∩ (𝐹𝐴))
8 inres 5996 . . . . 5 (𝐹 ∩ ( I ↾ 𝐴)) = ((𝐹 ∩ I ) ↾ 𝐴)
96, 7, 83eqtr4i 2796 . . . 4 ((𝐹𝐴) ∩ I ) = (𝐹 ∩ ( I ↾ 𝐴))
102, 9eqtr3di 2813 . . 3 (𝐹 Fn 𝐴 → (𝐹 ∩ I ) = (𝐹 ∩ ( I ↾ 𝐴)))
1110dmeqd 5895 . 2 (𝐹 Fn 𝐴 → dom (𝐹 ∩ I ) = dom (𝐹 ∩ ( I ↾ 𝐴)))
12 fnresi 6664 . . 3 ( I ↾ 𝐴) Fn 𝐴
13 fndmin 7040 . . 3 ((𝐹 Fn 𝐴 ∧ ( I ↾ 𝐴) Fn 𝐴) → dom (𝐹 ∩ ( I ↾ 𝐴)) = {𝑥𝐴 ∣ (𝐹𝑥) = (( I ↾ 𝐴)‘𝑥)})
1412, 13mpan2 703 . 2 (𝐹 Fn 𝐴 → dom (𝐹 ∩ ( I ↾ 𝐴)) = {𝑥𝐴 ∣ (𝐹𝑥) = (( I ↾ 𝐴)‘𝑥)})
15 fvresi 7171 . . . . 5 (𝑥𝐴 → (( I ↾ 𝐴)‘𝑥) = 𝑥)
1615eqeq2d 2774 . . . 4 (𝑥𝐴 → ((𝐹𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ (𝐹𝑥) = 𝑥))
1716rabbiia 3420 . . 3 {𝑥𝐴 ∣ (𝐹𝑥) = (( I ↾ 𝐴)‘𝑥)} = {𝑥𝐴 ∣ (𝐹𝑥) = 𝑥}
1817a1i 11 . 2 (𝐹 Fn 𝐴 → {𝑥𝐴 ∣ (𝐹𝑥) = (( I ↾ 𝐴)‘𝑥)} = {𝑥𝐴 ∣ (𝐹𝑥) = 𝑥})
1911, 14, 183eqtrd 2802 1 (𝐹 Fn 𝐴 → dom (𝐹 ∩ I ) = {𝑥𝐴 ∣ (𝐹𝑥) = 𝑥})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1570  wcel 2143  {crab 3416  cin 3904   I cid 5555  dom cdm 5661  cres 5663   Fn wfn 6531  cfv 6536
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-mpt 5193  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-res 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-fv 6544
This theorem is referenced by:  fnelfp  7173
  Copyright terms: Public domain W3C validator