| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > fvmptdv | Structured version Visualization version GIF version | ||
| Description: Alternate deduction version of fvmpt 6939, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.) |
| Ref | Expression |
|---|---|
| fvmptd2f.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐷) |
| fvmptd2f.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝑉) |
| fvmptd2f.3 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝐹‘𝐴) = 𝐵 → 𝜓)) |
| Ref | Expression |
|---|---|
| fvmptdv | ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fvmptd2f.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝐷) | |
| 2 | fvmptd2f.2 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝑉) | |
| 3 | fvmptd2f.3 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝐹‘𝐴) = 𝐵 → 𝜓)) | |
| 4 | nfcv 2896 | . 2 ⊢ Ⅎ𝑥𝐹 | |
| 5 | nfv 1915 | . 2 ⊢ Ⅎ𝑥𝜓 | |
| 6 | 1, 2, 3, 4, 5 | fvmptd2f 6955 | 1 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1541 ∈ wcel 2113 ↦ cmpt 5177 ‘cfv 6490 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2706 ax-sep 5239 ax-nul 5249 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2809 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4284 df-if 4478 df-sn 4579 df-pr 4581 df-op 4585 df-uni 4862 df-br 5097 df-opab 5159 df-mpt 5178 df-id 5517 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fv 6498 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |