Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > feqresmpt | GIF version |
Description: Express a restricted function as a mapping. (Contributed by Mario Carneiro, 18-May-2016.) |
Ref | Expression |
---|---|
feqmptd.1 | ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) |
feqresmpt.2 | ⊢ (𝜑 → 𝐶 ⊆ 𝐴) |
Ref | Expression |
---|---|
feqresmpt | ⊢ (𝜑 → (𝐹 ↾ 𝐶) = (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | feqmptd.1 | . . . 4 ⊢ (𝜑 → 𝐹:𝐴⟶𝐵) | |
2 | feqresmpt.2 | . . . 4 ⊢ (𝜑 → 𝐶 ⊆ 𝐴) | |
3 | fssres 5357 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) | |
4 | 1, 2, 3 | syl2anc 409 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶):𝐶⟶𝐵) |
5 | 4 | feqmptd 5533 | . 2 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = (𝑥 ∈ 𝐶 ↦ ((𝐹 ↾ 𝐶)‘𝑥))) |
6 | fvres 5504 | . . 3 ⊢ (𝑥 ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) | |
7 | 6 | mpteq2ia 4062 | . 2 ⊢ (𝑥 ∈ 𝐶 ↦ ((𝐹 ↾ 𝐶)‘𝑥)) = (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) |
8 | 5, 7 | eqtrdi 2213 | 1 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1342 ⊆ wss 3111 ↦ cmpt 4037 ↾ cres 4600 ⟶wf 5178 ‘cfv 5182 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-bndl 1496 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 ax-i5r 1522 ax-14 2138 ax-ext 2146 ax-sep 4094 ax-pow 4147 ax-pr 4181 |
This theorem depends on definitions: df-bi 116 df-3an 969 df-tru 1345 df-nf 1448 df-sb 1750 df-eu 2016 df-mo 2017 df-clab 2151 df-cleq 2157 df-clel 2160 df-nfc 2295 df-ral 2447 df-rex 2448 df-v 2723 df-sbc 2947 df-un 3115 df-in 3117 df-ss 3124 df-pw 3555 df-sn 3576 df-pr 3577 df-op 3579 df-uni 3784 df-br 3977 df-opab 4038 df-mpt 4039 df-id 4265 df-xp 4604 df-rel 4605 df-cnv 4606 df-co 4607 df-dm 4608 df-rn 4609 df-res 4610 df-iota 5147 df-fun 5184 df-fn 5185 df-f 5186 df-fv 5190 |
This theorem is referenced by: dvmulxxbr 13207 |
Copyright terms: Public domain | W3C validator |