Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fvtresfn | Structured version Visualization version GIF version |
Description: Functionality of a tuple-restriction function. (Contributed by Stefan O'Rear, 24-Jan-2015.) |
Ref | Expression |
---|---|
fvtresfn.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉)) |
Ref | Expression |
---|---|
fvtresfn | ⊢ (𝑋 ∈ 𝐵 → (𝐹‘𝑋) = (𝑋 ↾ 𝑉)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | resexg 5930 | . 2 ⊢ (𝑋 ∈ 𝐵 → (𝑋 ↾ 𝑉) ∈ V) | |
2 | reseq1 5878 | . . 3 ⊢ (𝑥 = 𝑋 → (𝑥 ↾ 𝑉) = (𝑋 ↾ 𝑉)) | |
3 | fvtresfn.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉)) | |
4 | 2, 3 | fvmptg 6865 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑋 ↾ 𝑉) ∈ V) → (𝐹‘𝑋) = (𝑋 ↾ 𝑉)) |
5 | 1, 4 | mpdan 684 | 1 ⊢ (𝑋 ∈ 𝐵 → (𝐹‘𝑋) = (𝑋 ↾ 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2106 Vcvv 3429 ↦ cmpt 5156 ↾ cres 5586 ‘cfv 6426 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-sep 5221 ax-nul 5228 ax-pr 5350 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3431 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5074 df-opab 5136 df-mpt 5157 df-id 5484 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-res 5596 df-iota 6384 df-fun 6428 df-fv 6434 |
This theorem is referenced by: symgfixf1 19055 symgfixfo 19057 pwssplit1 20331 pwssplit2 20332 pwssplit3 20333 eulerpartgbij 32347 pwssplit4 40922 |
Copyright terms: Public domain | W3C validator |