| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fvmptf | GIF version | ||
| Description: Value of a function given by an ordered-pair class abstraction. This version of fvmptg 5703 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 8-Nov-2005.) (Revised by Mario Carneiro, 15-Oct-2016.) |
| Ref | Expression |
|---|---|
| fvmptf.1 | ⊢ Ⅎ𝑥𝐴 |
| fvmptf.2 | ⊢ Ⅎ𝑥𝐶 |
| fvmptf.3 | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
| fvmptf.4 | ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) |
| Ref | Expression |
|---|---|
| fvmptf | ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑉) → (𝐹‘𝐴) = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elex 2811 | . . 3 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 2 | fvmptf.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 3 | fvmptf.2 | . . . . . 6 ⊢ Ⅎ𝑥𝐶 | |
| 4 | 3 | nfel1 2383 | . . . . 5 ⊢ Ⅎ𝑥 𝐶 ∈ V |
| 5 | fvmptf.4 | . . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) | |
| 6 | nfmpt1 4176 | . . . . . . . 8 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐷 ↦ 𝐵) | |
| 7 | 5, 6 | nfcxfr 2369 | . . . . . . 7 ⊢ Ⅎ𝑥𝐹 |
| 8 | 7, 2 | nffv 5633 | . . . . . 6 ⊢ Ⅎ𝑥(𝐹‘𝐴) |
| 9 | 8, 3 | nfeq 2380 | . . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝐴) = 𝐶 |
| 10 | 4, 9 | nfim 1618 | . . . 4 ⊢ Ⅎ𝑥(𝐶 ∈ V → (𝐹‘𝐴) = 𝐶) |
| 11 | fvmptf.3 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 12 | 11 | eleq1d 2298 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ V ↔ 𝐶 ∈ V)) |
| 13 | fveq2 5623 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴)) | |
| 14 | 13, 11 | eqeq12d 2244 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = 𝐵 ↔ (𝐹‘𝐴) = 𝐶)) |
| 15 | 12, 14 | imbi12d 234 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝐵 ∈ V → (𝐹‘𝑥) = 𝐵) ↔ (𝐶 ∈ V → (𝐹‘𝐴) = 𝐶))) |
| 16 | 5 | fvmpt2 5711 | . . . . 5 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝐵 ∈ V) → (𝐹‘𝑥) = 𝐵) |
| 17 | 16 | ex 115 | . . . 4 ⊢ (𝑥 ∈ 𝐷 → (𝐵 ∈ V → (𝐹‘𝑥) = 𝐵)) |
| 18 | 2, 10, 15, 17 | vtoclgaf 2866 | . . 3 ⊢ (𝐴 ∈ 𝐷 → (𝐶 ∈ V → (𝐹‘𝐴) = 𝐶)) |
| 19 | 1, 18 | syl5 32 | . 2 ⊢ (𝐴 ∈ 𝐷 → (𝐶 ∈ 𝑉 → (𝐹‘𝐴) = 𝐶)) |
| 20 | 19 | imp 124 | 1 ⊢ ((𝐴 ∈ 𝐷 ∧ 𝐶 ∈ 𝑉) → (𝐹‘𝐴) = 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 Ⅎwnfc 2359 Vcvv 2799 ↦ cmpt 4144 ‘cfv 5314 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4201 ax-pow 4257 ax-pr 4292 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-sbc 3029 df-csb 3125 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-uni 3888 df-br 4083 df-opab 4145 df-mpt 4146 df-id 4381 df-xp 4722 df-rel 4723 df-cnv 4724 df-co 4725 df-dm 4726 df-iota 5274 df-fun 5316 df-fv 5322 |
| This theorem is referenced by: fvmptd3 5721 elfvmptrab1 5722 sumrbdclem 11874 fsum3 11884 isumss 11888 prodrbdclem 12068 prodmodclem2a 12073 zproddc 12076 fprodntrivap 12081 prodssdc 12086 pcmpt 12852 |
| Copyright terms: Public domain | W3C validator |