![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fvmpt3 | Structured version Visualization version GIF version |
Description: Value of a function given in maps-to notation, with a slightly different sethood condition. (Contributed by Stefan O'Rear, 30-Jan-2015.) |
Ref | Expression |
---|---|
fvmpt3.a | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
fvmpt3.b | ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) |
fvmpt3.c | ⊢ (𝑥 ∈ 𝐷 → 𝐵 ∈ 𝑉) |
Ref | Expression |
---|---|
fvmpt3 | ⊢ (𝐴 ∈ 𝐷 → (𝐹‘𝐴) = 𝐶) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvmpt3.a | . . . 4 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
2 | 1 | eleq1d 2816 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ 𝑉 ↔ 𝐶 ∈ 𝑉)) |
3 | fvmpt3.c | . . 3 ⊢ (𝑥 ∈ 𝐷 → 𝐵 ∈ 𝑉) | |
4 | 2, 3 | vtoclga 3565 | . 2 ⊢ (𝐴 ∈ 𝐷 → 𝐶 ∈ 𝑉) |
5 | fvmpt3.b | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) | |
6 | 1, 5 | fvmptg 6995 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑉) → (𝐹‘𝐴) = 𝐶) |
7 | 4, 6 | mpdan 683 | 1 ⊢ (𝐴 ∈ 𝐷 → (𝐹‘𝐴) = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 ∈ wcel 2104 ↦ cmpt 5230 ‘cfv 6542 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ral 3060 df-rex 3069 df-rab 3431 df-v 3474 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-iota 6494 df-fun 6544 df-fv 6550 |
This theorem is referenced by: fvmpt3i 7002 harval 9557 mrcfval 17556 elmptrab 23551 frlmsnic 41412 wallispi 45084 1arymaptfv 47413 2arymaptfv 47424 |
Copyright terms: Public domain | W3C validator |