Theorem curry1val 8105

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 8104	. . 3 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → 𝐺 = (𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥)))
3	2	fveq1d 6879	. 2 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → (𝐺‘𝐷) = ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷))
4		eqid 2761	. . . . . . 7 ⊢ (𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥)) = (𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))
5	4	fvmptndm 7017	. . . . . 6 ⊢ (¬ 𝐷 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = ∅)
6	5	adantl 487	. . . . 5 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) ∧ ¬ 𝐷 ∈ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = ∅)
7		fndm 6634	. . . . . . 7 ⊢ (𝐹 Fn (𝐴 × 𝐵) → dom 𝐹 = (𝐴 × 𝐵))
8	7	adantr 486	. . . . . 6 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → dom 𝐹 = (𝐴 × 𝐵))
9		simpr 490	. . . . . . 7 ⊢ ((𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵) → 𝐷 ∈ 𝐵)
10	9	con3i 155	. . . . . 6 ⊢ (¬ 𝐷 ∈ 𝐵 → ¬ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵))
11		ndmovg 7596	. . . . . 6 ⊢ ((dom 𝐹 = (𝐴 × 𝐵) ∧ ¬ (𝐶 ∈ 𝐴 ∧ 𝐷 ∈ 𝐵)) → (𝐶𝐹𝐷) = ∅)
12	8, 10, 11	syl2an 608	. . . . 5 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) ∧ ¬ 𝐷 ∈ 𝐵) → (𝐶𝐹𝐷) = ∅)
13	6, 12	eqtr4d 2799	. . . 4 ⊢ (((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) ∧ ¬ 𝐷 ∈ 𝐵) → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
14	13	ex 418	. . 3 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → (¬ 𝐷 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷)))
15		oveq2 7420	. . . 4 ⊢ (𝑥 = 𝐷 → (𝐶𝐹𝑥) = (𝐶𝐹𝐷))
16		ovex 7445	. . . 4 ⊢ (𝐶𝐹𝐷) ∈ V
17	15, 4, 16	fvmpt 6985	. . 3 ⊢ (𝐷 ∈ 𝐵 → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
18	14, 17	pm2.61d2 183	. 2 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → ((𝑥 ∈ 𝐵 ↦ (𝐶𝐹𝑥))‘𝐷) = (𝐶𝐹𝐷))
19	3, 18	eqtrd 2796	1 ⊢ ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶 ∈ 𝐴) → (𝐺‘𝐷) = (𝐶𝐹𝐷))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Vcvv 3451  ∅c0 4279  {csn 4584   ↦ cmpt 5186   × cxp 5649  ^◡ccnv 5650  dom cdm 5651   ↾ cres 5653   ∘ ccom 5655   Fn wfn 6526  ‘cfv 6531  (class class class)co 7412  2^nd c2nd 7989

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7740

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-ov 7415  df-1st 7990  df-2nd 7991

This theorem is used by:  nvinvfval  31224  hhssabloilem  31845