![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > curry2val | Structured version Visualization version GIF version |
Description: The value of a curried function with a constant second argument. (Contributed by NM, 16-Dec-2008.) |
Ref | Expression |
---|---|
curry2.1 | ⊢ 𝐺 = (𝐹 ∘ ◡(1st ↾ (V × {𝐶}))) |
Ref | Expression |
---|---|
curry2val | ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐵) → (𝐺‘𝐷) = (𝐷𝐹𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | curry2.1 | . . . 4 ⊢ 𝐺 = (𝐹 ∘ ◡(1st ↾ (V × {𝐶}))) | |
2 | 1 | curry2 8120 | . . 3 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐵) → 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))) |
3 | 2 | fveq1d 6902 | . 2 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐵) → (𝐺‘𝐷) = ((𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))‘𝐷)) |
4 | eqid 2725 | . . . . . . . 8 ⊢ (𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶)) = (𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶)) | |
5 | 4 | fvmptndm 7039 | . . . . . . 7 ⊢ (¬ 𝐷 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))‘𝐷) = ∅) |
6 | 5 | adantl 480 | . . . . . 6 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ ¬ 𝐷 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))‘𝐷) = ∅) |
7 | fndm 6662 | . . . . . . 7 ⊢ (𝐹 Fn (𝐴 × 𝐵) → dom 𝐹 = (𝐴 × 𝐵)) | |
8 | simpl 481 | . . . . . . . 8 ⊢ ((𝐷 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → 𝐷 ∈ 𝐴) | |
9 | 8 | con3i 154 | . . . . . . 7 ⊢ (¬ 𝐷 ∈ 𝐴 → ¬ (𝐷 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)) |
10 | ndmovg 7608 | . . . . . . 7 ⊢ ((dom 𝐹 = (𝐴 × 𝐵) ∧ ¬ (𝐷 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵)) → (𝐷𝐹𝐶) = ∅) | |
11 | 7, 9, 10 | syl2an 594 | . . . . . 6 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ ¬ 𝐷 ∈ 𝐴) → (𝐷𝐹𝐶) = ∅) |
12 | 6, 11 | eqtr4d 2768 | . . . . 5 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ ¬ 𝐷 ∈ 𝐴) → ((𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))‘𝐷) = (𝐷𝐹𝐶)) |
13 | 12 | ex 411 | . . . 4 ⊢ (𝐹 Fn (𝐴 × 𝐵) → (¬ 𝐷 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))‘𝐷) = (𝐷𝐹𝐶))) |
14 | 13 | adantr 479 | . . 3 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐵) → (¬ 𝐷 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))‘𝐷) = (𝐷𝐹𝐶))) |
15 | oveq1 7430 | . . . 4 ⊢ (𝑥 = 𝐷 → (𝑥𝐹𝐶) = (𝐷𝐹𝐶)) | |
16 | ovex 7456 | . . . 4 ⊢ (𝐷𝐹𝐶) ∈ V | |
17 | 15, 4, 16 | fvmpt 7008 | . . 3 ⊢ (𝐷 ∈ 𝐴 → ((𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))‘𝐷) = (𝐷𝐹𝐶)) |
18 | 14, 17 | pm2.61d2 181 | . 2 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐵) → ((𝑥 ∈ 𝐴 ↦ (𝑥𝐹𝐶))‘𝐷) = (𝐷𝐹𝐶)) |
19 | 3, 18 | eqtrd 2765 | 1 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐵) → (𝐺‘𝐷) = (𝐷𝐹𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 Vcvv 3461 ∅c0 4324 {csn 4632 ↦ cmpt 5235 × cxp 5679 ◡ccnv 5680 dom cdm 5681 ↾ cres 5683 ∘ ccom 5685 Fn wfn 6548 ‘cfv 6553 (class class class)co 7423 1st c1st 8000 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-sep 5303 ax-nul 5310 ax-pr 5432 ax-un 7745 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2930 df-ral 3051 df-rex 3060 df-rab 3419 df-v 3463 df-sbc 3776 df-csb 3892 df-dif 3949 df-un 3951 df-in 3953 df-ss 3963 df-nul 4325 df-if 4533 df-sn 4633 df-pr 4635 df-op 4639 df-uni 4913 df-iun 5002 df-br 5153 df-opab 5215 df-mpt 5236 df-id 5579 df-xp 5687 df-rel 5688 df-cnv 5689 df-co 5690 df-dm 5691 df-rn 5692 df-res 5693 df-ima 5694 df-iota 6505 df-fun 6555 df-fn 6556 df-f 6557 df-f1 6558 df-fo 6559 df-f1o 6560 df-fv 6561 df-ov 7426 df-1st 8002 df-2nd 8003 |
This theorem is referenced by: curry2ima 32611 |
Copyright terms: Public domain | W3C validator |