MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  curry1val Structured version   Visualization version   GIF version

Theorem curry1val 8051
Description: The value of a curried function with a constant first argument. (Contributed by NM, 28-Mar-2008.) (Revised by Mario Carneiro, 26-Apr-2015.)
Hypothesis
Ref Expression
curry1.1 𝐺 = (𝐹(2nd ↾ ({𝐶} × V)))
Assertion
Ref Expression
curry1val ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → (𝐺𝐷) = (𝐶𝐹𝐷))

Proof of Theorem curry1val
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 curry1.1 . . . 4 𝐺 = (𝐹(2nd ↾ ({𝐶} × V)))
21curry1 8050 . . 3 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → 𝐺 = (𝑥𝐵 ↦ (𝐶𝐹𝑥)))
32fveq1d 6836 . 2 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → (𝐺𝐷) = ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷))
4 eqid 2740 . . . . . . 7 (𝑥𝐵 ↦ (𝐶𝐹𝑥)) = (𝑥𝐵 ↦ (𝐶𝐹𝑥))
54fvmptndm 6974 . . . . . 6 𝐷𝐵 → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = ∅)
65adantl 482 . . . . 5 (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) ∧ ¬ 𝐷𝐵) → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = ∅)
7 fndm 6595 . . . . . . 7 (𝐹 Fn (𝐴 × 𝐵) → dom 𝐹 = (𝐴 × 𝐵))
87adantr 481 . . . . . 6 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → dom 𝐹 = (𝐴 × 𝐵))
9 simpr 485 . . . . . . 7 ((𝐶𝐴𝐷𝐵) → 𝐷𝐵)
109con3i 154 . . . . . 6 𝐷𝐵 → ¬ (𝐶𝐴𝐷𝐵))
11 ndmovg 7546 . . . . . 6 ((dom 𝐹 = (𝐴 × 𝐵) ∧ ¬ (𝐶𝐴𝐷𝐵)) → (𝐶𝐹𝐷) = ∅)
128, 10, 11syl2an 602 . . . . 5 (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) ∧ ¬ 𝐷𝐵) → (𝐶𝐹𝐷) = ∅)
136, 12eqtr4d 2778 . . . 4 (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) ∧ ¬ 𝐷𝐵) → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
1413ex 413 . . 3 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → (¬ 𝐷𝐵 → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷)))
15 oveq2 7371 . . . 4 (𝑥 = 𝐷 → (𝐶𝐹𝑥) = (𝐶𝐹𝐷))
16 ovex 7396 . . . 4 (𝐶𝐹𝐷) ∈ V
1715, 4, 16fvmpt 6942 . . 3 (𝐷𝐵 → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
1814, 17pm2.61d2 182 . 2 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
193, 18eqtrd 2775 1 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → (𝐺𝐷) = (𝐶𝐹𝐷))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396   = wceq 1547  wcel 2119  Vcvv 3432  c0 4268  {csn 4562  cmpt 5160   × cxp 5623  ccnv 5624  dom cdm 5625  cres 5627  ccom 5629   Fn wfn 6487  cfv 6492  (class class class)co 7363  2nd c2nd 7937
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-sep 5225  ax-nul 5235  ax-pr 5369  ax-un 7685
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7366  df-1st 7938  df-2nd 7939
This theorem is referenced by:  nvinvfval  30736  hhssabloilem  31357
  Copyright terms: Public domain W3C validator