Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > resmptf | GIF version |
Description: Restriction of the mapping operation. (Contributed by Thierry Arnoux, 28-Mar-2017.) |
Ref | Expression |
---|---|
resmptf.a | ⊢ Ⅎ𝑥𝐴 |
resmptf.b | ⊢ Ⅎ𝑥𝐵 |
Ref | Expression |
---|---|
resmptf | ⊢ (𝐵 ⊆ 𝐴 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐵) = (𝑥 ∈ 𝐵 ↦ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resmpt 4932 | . 2 ⊢ (𝐵 ⊆ 𝐴 → ((𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐶) ↾ 𝐵) = (𝑦 ∈ 𝐵 ↦ ⦋𝑦 / 𝑥⦌𝐶)) | |
2 | resmptf.a | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
3 | nfcv 2308 | . . . 4 ⊢ Ⅎ𝑦𝐴 | |
4 | nfcv 2308 | . . . 4 ⊢ Ⅎ𝑦𝐶 | |
5 | nfcsb1v 3078 | . . . 4 ⊢ Ⅎ𝑥⦋𝑦 / 𝑥⦌𝐶 | |
6 | csbeq1a 3054 | . . . 4 ⊢ (𝑥 = 𝑦 → 𝐶 = ⦋𝑦 / 𝑥⦌𝐶) | |
7 | 2, 3, 4, 5, 6 | cbvmptf 4076 | . . 3 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐶) |
8 | 7 | reseq1i 4880 | . 2 ⊢ ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐵) = ((𝑦 ∈ 𝐴 ↦ ⦋𝑦 / 𝑥⦌𝐶) ↾ 𝐵) |
9 | resmptf.b | . . 3 ⊢ Ⅎ𝑥𝐵 | |
10 | nfcv 2308 | . . 3 ⊢ Ⅎ𝑦𝐵 | |
11 | 9, 10, 4, 5, 6 | cbvmptf 4076 | . 2 ⊢ (𝑥 ∈ 𝐵 ↦ 𝐶) = (𝑦 ∈ 𝐵 ↦ ⦋𝑦 / 𝑥⦌𝐶) |
12 | 1, 8, 11 | 3eqtr4g 2224 | 1 ⊢ (𝐵 ⊆ 𝐴 → ((𝑥 ∈ 𝐴 ↦ 𝐶) ↾ 𝐵) = (𝑥 ∈ 𝐵 ↦ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1343 Ⅎwnfc 2295 ⦋csb 3045 ⊆ wss 3116 ↦ cmpt 4043 ↾ cres 4606 |
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 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-sbc 2952 df-csb 3046 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-opab 4044 df-mpt 4045 df-xp 4610 df-rel 4611 df-res 4616 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |