Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fvmpt3 | 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 2235 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ 𝑉 ↔ 𝐶 ∈ 𝑉)) |
3 | fvmpt3.c | . . 3 ⊢ (𝑥 ∈ 𝐷 → 𝐵 ∈ 𝑉) | |
4 | 2, 3 | vtoclga 2792 | . 2 ⊢ (𝐴 ∈ 𝐷 → 𝐶 ∈ 𝑉) |
5 | fvmpt3.b | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) | |
6 | 1, 5 | fvmptg 5562 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑉) → (𝐹‘𝐴) = 𝐶) |
7 | 4, 6 | mpdan 418 | 1 ⊢ (𝐴 ∈ 𝐷 → (𝐹‘𝐴) = 𝐶) |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1343 ∈ wcel 2136 ↦ cmpt 4043 ‘cfv 5188 |
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-eu 2017 df-mo 2018 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-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-uni 3790 df-br 3983 df-opab 4044 df-mpt 4045 df-id 4271 df-xp 4610 df-rel 4611 df-cnv 4612 df-co 4613 df-dm 4614 df-iota 5153 df-fun 5190 df-fv 5196 |
This theorem is referenced by: fvmpt3i 5566 frec2uzsucd 10336 |
Copyright terms: Public domain | W3C validator |