| 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 2307 | . . 3 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ 𝑉 ↔ 𝐶 ∈ 𝑉)) |
| 3 | fvmpt3.c | . . 3 ⊢ (𝑥 ∈ 𝐷 → 𝐵 ∈ 𝑉) | |
| 4 | 2, 3 | vtoclga 2889 | . 2 ⊢ (𝐴 ∈ 𝐷 → 𝐶 ∈ 𝑉) |
| 5 | fvmpt3.b | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) | |
| 6 | 1, 5 | fvmptg 5775 | . 2 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑉) → (𝐹‘𝐴) = 𝐶) |
| 7 | 4, 6 | mpdan 425 | 1 ⊢ (𝐴 ∈ 𝐷 → (𝐹‘𝐴) = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1402 ∈ wcel 2209 ↦ cmpt 4187 ‘cfv 5372 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-14 2212 ax-ext 2220 ax-sep 4244 ax-pow 4306 ax-pr 4341 |
| This theorem depends on definitions: df-bi 117 df-3an 1011 df-tru 1405 df-nf 1514 df-sb 1816 df-eu 2089 df-mo 2090 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-rex 2534 df-v 2823 df-sbc 3052 df-un 3224 df-in 3226 df-ss 3233 df-pw 3687 df-sn 3711 df-pr 3712 df-op 3714 df-uni 3931 df-br 4126 df-opab 4188 df-mpt 4189 df-id 4433 df-xp 4775 df-rel 4776 df-cnv 4777 df-co 4778 df-dm 4779 df-iota 5332 df-fun 5374 df-fv 5380 |
| This theorem is referenced by: fvmpt3i 5779 frec2uzsucd 10816 |
| Copyright terms: Public domain | W3C validator |