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

Theorem curry1val 8057
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 8056 . . 3 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → 𝐺 = (𝑥𝐵 ↦ (𝐶𝐹𝑥)))
32fveq1d 6844 . 2 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → (𝐺𝐷) = ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷))
4 eqid 2737 . . . . . . 7 (𝑥𝐵 ↦ (𝐶𝐹𝑥)) = (𝑥𝐵 ↦ (𝐶𝐹𝑥))
54fvmptndm 6981 . . . . . 6 𝐷𝐵 → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = ∅)
65adantl 481 . . . . 5 (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) ∧ ¬ 𝐷𝐵) → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = ∅)
7 fndm 6603 . . . . . . 7 (𝐹 Fn (𝐴 × 𝐵) → dom 𝐹 = (𝐴 × 𝐵))
87adantr 480 . . . . . 6 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → dom 𝐹 = (𝐴 × 𝐵))
9 simpr 484 . . . . . . 7 ((𝐶𝐴𝐷𝐵) → 𝐷𝐵)
109con3i 154 . . . . . 6 𝐷𝐵 → ¬ (𝐶𝐴𝐷𝐵))
11 ndmovg 7551 . . . . . 6 ((dom 𝐹 = (𝐴 × 𝐵) ∧ ¬ (𝐶𝐴𝐷𝐵)) → (𝐶𝐹𝐷) = ∅)
128, 10, 11syl2an 597 . . . . 5 (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) ∧ ¬ 𝐷𝐵) → (𝐶𝐹𝐷) = ∅)
136, 12eqtr4d 2775 . . . 4 (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) ∧ ¬ 𝐷𝐵) → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
1413ex 412 . . 3 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → (¬ 𝐷𝐵 → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷)))
15 oveq2 7376 . . . 4 (𝑥 = 𝐷 → (𝐶𝐹𝑥) = (𝐶𝐹𝐷))
16 ovex 7401 . . . 4 (𝐶𝐹𝐷) ∈ V
1715, 4, 16fvmpt 6949 . . 3 (𝐷𝐵 → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
1814, 17pm2.61d2 181 . 2 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → ((𝑥𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
193, 18eqtrd 2772 1 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐴) → (𝐺𝐷) = (𝐶𝐹𝐷))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 395   = wceq 1542  wcel 2114  Vcvv 3442  c0 4287  {csn 4582  cmpt 5181   × cxp 5630  ccnv 5631  dom cdm 5632  cres 5634  ccom 5636   Fn wfn 6495  cfv 6500  (class class class)co 7368  2nd c2nd 7942
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5243  ax-nul 5253  ax-pr 5379  ax-un 7690
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5527  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-1st 7943  df-2nd 7944
This theorem is referenced by:  nvinvfval  30727  hhssabloilem  31348
  Copyright terms: Public domain W3C validator