| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fvmptdf | GIF version | ||
| Description: Alternate deduction version of fvmpt 5249, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.) |
| Ref | Expression |
|---|---|
| fvmptdf.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐷) |
| fvmptdf.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝑉) |
| fvmptdf.3 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝐹‘𝐴) = 𝐵 → 𝜓)) |
| fvmptdf.4 | ⊢ Ⅎ𝑥𝐹 |
| fvmptdf.5 | ⊢ Ⅎ𝑥𝜓 |
| Ref | Expression |
|---|---|
| fvmptdf | ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1421 | . 2 ⊢ Ⅎ𝑥𝜑 | |
| 2 | fvmptdf.4 | . . . 4 ⊢ Ⅎ𝑥𝐹 | |
| 3 | nfmpt1 3850 | . . . 4 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐷 ↦ 𝐵) | |
| 4 | 2, 3 | nfeq 2185 | . . 3 ⊢ Ⅎ𝑥 𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) |
| 5 | fvmptdf.5 | . . 3 ⊢ Ⅎ𝑥𝜓 | |
| 6 | 4, 5 | nfim 1464 | . 2 ⊢ Ⅎ𝑥(𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → 𝜓) |
| 7 | fvmptdf.1 | . . . 4 ⊢ (𝜑 → 𝐴 ∈ 𝐷) | |
| 8 | elex 2566 | . . . 4 ⊢ (𝐴 ∈ 𝐷 → 𝐴 ∈ V) | |
| 9 | 7, 8 | syl 14 | . . 3 ⊢ (𝜑 → 𝐴 ∈ V) |
| 10 | isset 2561 | . . 3 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
| 11 | 9, 10 | sylib 127 | . 2 ⊢ (𝜑 → ∃𝑥 𝑥 = 𝐴) |
| 12 | fveq1 5177 | . . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → (𝐹‘𝐴) = ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴)) | |
| 13 | simpr 103 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝑥 = 𝐴) | |
| 14 | 13 | fveq2d 5182 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝑥) = ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴)) |
| 15 | 7 | adantr 261 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐴 ∈ 𝐷) |
| 16 | 13, 15 | eqeltrd 2114 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝑥 ∈ 𝐷) |
| 17 | fvmptdf.2 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝑉) | |
| 18 | eqid 2040 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐷 ↦ 𝐵) = (𝑥 ∈ 𝐷 ↦ 𝐵) | |
| 19 | 18 | fvmpt2 5254 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝐷 ∧ 𝐵 ∈ 𝑉) → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝑥) = 𝐵) |
| 20 | 16, 17, 19 | syl2anc 391 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝑥) = 𝐵) |
| 21 | 14, 20 | eqtr3d 2074 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) = 𝐵) |
| 22 | 21 | eqeq2d 2051 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝐹‘𝐴) = ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) ↔ (𝐹‘𝐴) = 𝐵)) |
| 23 | fvmptdf.3 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝐹‘𝐴) = 𝐵 → 𝜓)) | |
| 24 | 22, 23 | sylbid 139 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝐹‘𝐴) = ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) → 𝜓)) |
| 25 | 12, 24 | syl5 28 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → 𝜓)) |
| 26 | 1, 6, 11, 25 | exlimdd 1752 | 1 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → 𝜓)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 97 = wceq 1243 Ⅎwnf 1349 ∃wex 1381 ∈ wcel 1393 Ⅎwnfc 2165 Vcvv 2557 ↦ cmpt 3818 ‘cfv 4902 |
| This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-14 1405 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 ax-sep 3875 ax-pow 3927 ax-pr 3944 |
| This theorem depends on definitions: df-bi 110 df-3an 887 df-tru 1246 df-nf 1350 df-sb 1646 df-eu 1903 df-mo 1904 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-rex 2312 df-v 2559 df-sbc 2765 df-csb 2853 df-un 2922 df-in 2924 df-ss 2931 df-pw 3361 df-sn 3381 df-pr 3382 df-op 3384 df-uni 3581 df-br 3765 df-opab 3819 df-mpt 3820 df-id 4030 df-xp 4351 df-rel 4352 df-cnv 4353 df-co 4354 df-dm 4355 df-iota 4867 df-fun 4904 df-fv 4910 |
| This theorem is referenced by: fvmptdv 5259 |
| Copyright terms: Public domain | W3C validator |