| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fninfp | Structured version Visualization version GIF version | ||
| Description: Express the class of fixed points of a function. (Contributed by Stefan O'Rear, 1-Feb-2015.) |
| Ref | Expression |
|---|---|
| fninfp | ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∩ I ) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = 𝑥}) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnresdm 6658 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹) | |
| 2 | 1 | ineq1d 4172 | . . . 4 ⊢ (𝐹 Fn 𝐴 → ((𝐹 ↾ 𝐴) ∩ I ) = (𝐹 ∩ I )) |
| 3 | inres 5998 | . . . . . 6 ⊢ ( I ∩ (𝐹 ↾ 𝐴)) = (( I ∩ 𝐹) ↾ 𝐴) | |
| 4 | incom 4162 | . . . . . . 7 ⊢ ( I ∩ 𝐹) = (𝐹 ∩ I ) | |
| 5 | 4 | reseq1i 5976 | . . . . . 6 ⊢ (( I ∩ 𝐹) ↾ 𝐴) = ((𝐹 ∩ I ) ↾ 𝐴) |
| 6 | 3, 5 | eqtri 2788 | . . . . 5 ⊢ ( I ∩ (𝐹 ↾ 𝐴)) = ((𝐹 ∩ I ) ↾ 𝐴) |
| 7 | incom 4162 | . . . . 5 ⊢ ((𝐹 ↾ 𝐴) ∩ I ) = ( I ∩ (𝐹 ↾ 𝐴)) | |
| 8 | inres 5998 | . . . . 5 ⊢ (𝐹 ∩ ( I ↾ 𝐴)) = ((𝐹 ∩ I ) ↾ 𝐴) | |
| 9 | 6, 7, 8 | 3eqtr4i 2798 | . . . 4 ⊢ ((𝐹 ↾ 𝐴) ∩ I ) = (𝐹 ∩ ( I ↾ 𝐴)) |
| 10 | 2, 9 | eqtr3di 2815 | . . 3 ⊢ (𝐹 Fn 𝐴 → (𝐹 ∩ I ) = (𝐹 ∩ ( I ↾ 𝐴))) |
| 11 | 10 | dmeqd 5897 | . 2 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∩ I ) = dom (𝐹 ∩ ( I ↾ 𝐴))) |
| 12 | fnresi 6668 | . . 3 ⊢ ( I ↾ 𝐴) Fn 𝐴 | |
| 13 | fndmin 7044 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ( I ↾ 𝐴) Fn 𝐴) → dom (𝐹 ∩ ( I ↾ 𝐴)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥)}) | |
| 14 | 12, 13 | mpan2 704 | . 2 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∩ ( I ↾ 𝐴)) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥)}) |
| 15 | fvresi 7175 | . . . . 5 ⊢ (𝑥 ∈ 𝐴 → (( I ↾ 𝐴)‘𝑥) = 𝑥) | |
| 16 | 15 | eqeq2d 2776 | . . . 4 ⊢ (𝑥 ∈ 𝐴 → ((𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥) ↔ (𝐹‘𝑥) = 𝑥)) |
| 17 | 16 | rabbiia 3422 | . . 3 ⊢ {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = 𝑥} |
| 18 | 17 | a1i 11 | . 2 ⊢ (𝐹 Fn 𝐴 → {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = (( I ↾ 𝐴)‘𝑥)} = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = 𝑥}) |
| 19 | 11, 14, 18 | 3eqtrd 2804 | 1 ⊢ (𝐹 Fn 𝐴 → dom (𝐹 ∩ I ) = {𝑥 ∈ 𝐴 ∣ (𝐹‘𝑥) = 𝑥}) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2146 {crab 3418 ∩ cin 3905 I cid 5557 dom cdm 5663 ↾ cres 5665 Fn wfn 6535 ‘cfv 6540 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pr 5406 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-br 5112 df-opab 5176 df-mpt 5195 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-res 5675 df-iota 6496 df-fun 6542 df-fn 6543 df-fv 6548 |
| This theorem is used by: fnelfp 7177 |
| Copyright terms: Public domain | W3C validator |