Theorem curry1val 8088

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.

Step	Hyp	Ref	Expression
1		curry1.1	. . . 4 ⊢ 𝐺 = (𝐹 ∘ ◡(2nd ↾ ({𝐶} × V)))
2	1	curry1 8087	. . 3 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → 𝐺 = (𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥)))
3	2	fveq1d 6873	. 2 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → (𝐺‘𝐷) = ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷))
4		eqid 2765	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))
5	4	fvmptndm 7011	. . . . . 6 ⊢ (¬ 𝐷 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = ∅)
6	5	adantl 486	. . . . 5 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) ∧ ¬ 𝐷 ∈ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = ∅)
7		fndm 6628	. . . . . . 7 ⊢ (𝐹 Fn (𝐴 × 𝐵) → dom 𝐹 = (𝐴 × 𝐵))
8	7	adantr 485	. . . . . 6 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → dom 𝐹 = (𝐴 × 𝐵))
9		simpr 489	. . . . . . 7 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐷 ∈ 𝐵)
10	9	con3i 155	. . . . . 6 ⊢ (¬ 𝐷 ∈ 𝐵 → ¬ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))
11		ndmovg 7583	. . . . . 6 ⊢ ((dom 𝐹 = (𝐴 × 𝐵) ∧ ¬ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → (𝐶𝐹𝐷) = ∅)
12	8, 10, 11	syl2an 607	. . . . 5 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) ∧ ¬ 𝐷 ∈ 𝐵) → (𝐶𝐹𝐷) = ∅)
13	6, 12	eqtr4d 2803	. . . 4 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) ∧ ¬ 𝐷 ∈ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
14	13	ex 417	. . 3 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → (¬ 𝐷 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷)))
15		oveq2 7408	. . . 4 ⊢ (𝑥 = 𝐷 → (𝐶𝐹𝑥) = (𝐶𝐹𝐷))
16		ovex 7433	. . . 4 ⊢ (𝐶𝐹𝐷) ∈ V
17	15, 4, 16	fvmpt 6979	. . 3 ⊢ (𝐷 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
18	14, 17	pm2.61d2 183	. 2 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
19	3, 18	eqtrd 2800	1 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → (𝐺‘𝐷) = (𝐶𝐹𝐷))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1563   ∈ wcel 2145  Vcvv 3457  ∅c0 4288  {csn 4585   ↦ cmpt 5186   × cxp 5650  ^◡ccnv 5651  dom cdm 5652   ↾ cres 5654   ∘ ccom 5656   Fn wfn 6520  ‘cfv 6525  (class class class)co 7400  2^nd c2nd 7973

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-sep 5251  ax-nul 5261  ax-pr 5395  ax-un 7722

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-iun 4954  df-br 5106  df-opab 5168  df-mpt 5187  df-id 5547  df-xp 5658  df-rel 5659  df-cnv 5660  df-co 5661  df-dm 5662  df-rn 5663  df-res 5664  df-ima 5665  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-ov 7403  df-1st 7974  df-2nd 7975

This theorem is referenced by:  nvinvfval  30901  hhssabloilem  31522