![]() |
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 5862 | . 2 ⊢ (𝑋 ∈ 𝐵 → (𝑋 ↾ 𝑉) ∈ V) | |
2 | reseq1 5810 | . . 3 ⊢ (𝑥 = 𝑋 → (𝑥 ↾ 𝑉) = (𝑋 ↾ 𝑉)) | |
3 | fvtresfn.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ (𝑥 ↾ 𝑉)) | |
4 | 2, 3 | fvmptg 6750 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ (𝑋 ↾ 𝑉) ∈ V) → (𝐹‘𝑋) = (𝑋 ↾ 𝑉)) |
5 | 1, 4 | mpdan 687 | 1 ⊢ (𝑋 ∈ 𝐵 → (𝐹‘𝑋) = (𝑋 ↾ 𝑉)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2112 Vcvv 3407 ↦ cmpt 5105 ↾ cres 5519 ‘cfv 6328 |
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 1912 ax-6 1971 ax-7 2016 ax-8 2114 ax-9 2122 ax-10 2143 ax-11 2159 ax-12 2176 ax-ext 2730 ax-sep 5162 ax-nul 5169 ax-pr 5291 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-3an 1087 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2071 df-mo 2558 df-eu 2589 df-clab 2737 df-cleq 2751 df-clel 2831 df-nfc 2899 df-ral 3073 df-rex 3074 df-rab 3077 df-v 3409 df-sbc 3694 df-dif 3857 df-un 3859 df-in 3861 df-ss 3871 df-nul 4222 df-if 4414 df-sn 4516 df-pr 4518 df-op 4522 df-uni 4792 df-br 5026 df-opab 5088 df-mpt 5106 df-id 5423 df-xp 5523 df-rel 5524 df-cnv 5525 df-co 5526 df-dm 5527 df-res 5529 df-iota 6287 df-fun 6330 df-fv 6336 |
This theorem is referenced by: symgfixf1 18617 symgfixfo 18619 pwssplit1 19884 pwssplit2 19885 pwssplit3 19886 eulerpartgbij 31843 pwssplit4 40391 |
Copyright terms: Public domain | W3C validator |