![]() |
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 5221 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐶 ⊆ 𝐴) → (𝐹 ↾ 𝐶):𝐶⟶𝐵) | |
4 | 1, 2, 3 | syl2anc 404 | . . 3 ⊢ (𝜑 → (𝐹 ↾ 𝐶):𝐶⟶𝐵) |
5 | 4 | feqmptd 5392 | . 2 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = (𝑥 ∈ 𝐶 ↦ ((𝐹 ↾ 𝐶)‘𝑥))) |
6 | fvres 5364 | . . 3 ⊢ (𝑥 ∈ 𝐶 → ((𝐹 ↾ 𝐶)‘𝑥) = (𝐹‘𝑥)) | |
7 | 6 | mpteq2ia 3946 | . 2 ⊢ (𝑥 ∈ 𝐶 ↦ ((𝐹 ↾ 𝐶)‘𝑥)) = (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥)) |
8 | 5, 7 | syl6eq 2143 | 1 ⊢ (𝜑 → (𝐹 ↾ 𝐶) = (𝑥 ∈ 𝐶 ↦ (𝐹‘𝑥))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1296 ⊆ wss 3013 ↦ cmpt 3921 ↾ cres 4469 ⟶wf 5045 ‘cfv 5049 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 668 ax-5 1388 ax-7 1389 ax-gen 1390 ax-ie1 1434 ax-ie2 1435 ax-8 1447 ax-10 1448 ax-11 1449 ax-i12 1450 ax-bndl 1451 ax-4 1452 ax-14 1457 ax-17 1471 ax-i9 1475 ax-ial 1479 ax-i5r 1480 ax-ext 2077 ax-sep 3978 ax-pow 4030 ax-pr 4060 |
This theorem depends on definitions: df-bi 116 df-3an 929 df-tru 1299 df-nf 1402 df-sb 1700 df-eu 1958 df-mo 1959 df-clab 2082 df-cleq 2088 df-clel 2091 df-nfc 2224 df-ral 2375 df-rex 2376 df-v 2635 df-sbc 2855 df-un 3017 df-in 3019 df-ss 3026 df-pw 3451 df-sn 3472 df-pr 3473 df-op 3475 df-uni 3676 df-br 3868 df-opab 3922 df-mpt 3923 df-id 4144 df-xp 4473 df-rel 4474 df-cnv 4475 df-co 4476 df-dm 4477 df-rn 4478 df-res 4479 df-iota 5014 df-fun 5051 df-fn 5052 df-f 5053 df-fv 5057 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |