| 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 5752 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 2824 | . . 3 ⊢ (𝐶 ∈ 𝑉 → 𝐶 ∈ V) | |
| 2 | fvmptf.1 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 3 | fvmptf.2 | . . . . . 6 ⊢ Ⅎ𝑥𝐶 | |
| 4 | 3 | nfel1 2395 | . . . . 5 ⊢ Ⅎ𝑥 𝐶 ∈ V |
| 5 | fvmptf.4 | . . . . . . . 8 ⊢ 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) | |
| 6 | nfmpt1 4202 | . . . . . . . 8 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐷 ↦ 𝐵) | |
| 7 | 5, 6 | nfcxfr 2381 | . . . . . . 7 ⊢ Ⅎ𝑥𝐹 |
| 8 | 7, 2 | nffv 5679 | . . . . . 6 ⊢ Ⅎ𝑥(𝐹‘𝐴) |
| 9 | 8, 3 | nfeq 2392 | . . . . 5 ⊢ Ⅎ𝑥(𝐹‘𝐴) = 𝐶 |
| 10 | 4, 9 | nfim 1621 | . . . 4 ⊢ Ⅎ𝑥(𝐶 ∈ V → (𝐹‘𝐴) = 𝐶) |
| 11 | fvmptf.3 | . . . . . 6 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 12 | 11 | eleq1d 2301 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝐵 ∈ V ↔ 𝐶 ∈ V)) |
| 13 | fveq2 5669 | . . . . . 6 ⊢ (𝑥 = 𝐴 → (𝐹‘𝑥) = (𝐹‘𝐴)) | |
| 14 | 13, 11 | eqeq12d 2247 | . . . . 5 ⊢ (𝑥 = 𝐴 → ((𝐹‘𝑥) = 𝐵 ↔ (𝐹‘𝐴) = 𝐶)) |
| 15 | 12, 14 | imbi12d 234 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝐵 ∈ V → (𝐹‘𝑥) = 𝐵) ↔ (𝐶 ∈ V → (𝐹‘𝐴) = 𝐶))) |
| 16 | 5 | fvmpt2 5760 | . . . . 5 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝐵 ∈ V) → (𝐹‘𝑥) = 𝐵) |
| 17 | 16 | ex 115 | . . . 4 ⊢ (𝑥 ∈ 𝐷 → (𝐵 ∈ V → (𝐹‘𝑥) = 𝐵)) |
| 18 | 2, 10, 15, 17 | vtoclgaf 2879 | . . 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 1398 ∈ wcel 2203 Ⅎwnfc 2371 Vcvv 2812 ↦ cmpt 4170 ‘cfv 5351 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2206 ax-ext 2214 ax-sep 4227 ax-pow 4286 ax-pr 4321 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ral 2525 df-rex 2526 df-v 2814 df-sbc 3042 df-csb 3138 df-un 3214 df-in 3216 df-ss 3223 df-pw 3670 df-sn 3694 df-pr 3695 df-op 3697 df-uni 3914 df-br 4109 df-opab 4171 df-mpt 4172 df-id 4413 df-xp 4754 df-rel 4755 df-cnv 4756 df-co 4757 df-dm 4758 df-iota 5311 df-fun 5353 df-fv 5359 |
| This theorem is referenced by: fvmptd3 5770 elfvmptrab1 5771 sumrbdclem 12059 fsum3 12069 isumss 12073 prodrbdclem 12253 prodmodclem2a 12258 zproddc 12261 fprodntrivap 12266 prodssdc 12271 pcmpt 13037 |
| Copyright terms: Public domain | W3C validator |