Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > fvmptdv2 | GIF version |
Description: Alternate deduction version of fvmpt 5491, suitable for iteration. (Contributed by Mario Carneiro, 7-Jan-2017.) |
Ref | Expression |
---|---|
fvmptdv2.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐷) |
fvmptdv2.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝑉) |
fvmptdv2.3 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
fvmptdv2 | ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → (𝐹‘𝐴) = 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqidd 2138 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐷 ↦ 𝐵) = (𝑥 ∈ 𝐷 ↦ 𝐵)) | |
2 | fvmptdv2.3 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶) | |
3 | fvmptdv2.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐷) | |
4 | elex 2692 | . . . . . 6 ⊢ (𝐴 ∈ 𝐷 → 𝐴 ∈ V) | |
5 | 3, 4 | syl 14 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ V) |
6 | isset 2687 | . . . . 5 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) | |
7 | 5, 6 | sylib 121 | . . . 4 ⊢ (𝜑 → ∃𝑥 𝑥 = 𝐴) |
8 | fvmptdv2.2 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ 𝑉) | |
9 | elex 2692 | . . . . . 6 ⊢ (𝐵 ∈ 𝑉 → 𝐵 ∈ V) | |
10 | 8, 9 | syl 14 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 ∈ V) |
11 | 2, 10 | eqeltrrd 2215 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐶 ∈ V) |
12 | 7, 11 | exlimddv 1870 | . . 3 ⊢ (𝜑 → 𝐶 ∈ V) |
13 | 1, 2, 3, 12 | fvmptd 5495 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) = 𝐶) |
14 | fveq1 5413 | . . 3 ⊢ (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → (𝐹‘𝐴) = ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴)) | |
15 | 14 | eqeq1d 2146 | . 2 ⊢ (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → ((𝐹‘𝐴) = 𝐶 ↔ ((𝑥 ∈ 𝐷 ↦ 𝐵)‘𝐴) = 𝐶)) |
16 | 13, 15 | syl5ibrcom 156 | 1 ⊢ (𝜑 → (𝐹 = (𝑥 ∈ 𝐷 ↦ 𝐵) → (𝐹‘𝐴) = 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1331 ∃wex 1468 ∈ wcel 1480 Vcvv 2681 ↦ cmpt 3984 ‘cfv 5118 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-14 1492 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2119 ax-sep 4041 ax-pow 4093 ax-pr 4126 |
This theorem depends on definitions: df-bi 116 df-3an 964 df-tru 1334 df-nf 1437 df-sb 1736 df-eu 2000 df-mo 2001 df-clab 2124 df-cleq 2130 df-clel 2133 df-nfc 2268 df-ral 2419 df-rex 2420 df-v 2683 df-sbc 2905 df-csb 2999 df-un 3070 df-in 3072 df-ss 3079 df-pw 3507 df-sn 3528 df-pr 3529 df-op 3531 df-uni 3732 df-br 3925 df-opab 3985 df-mpt 3986 df-id 4210 df-xp 4540 df-rel 4541 df-cnv 4542 df-co 4543 df-dm 4544 df-iota 5083 df-fun 5120 df-fv 5126 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |