Mathbox for Thierry Arnoux < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  curry2ima Structured version   Visualization version   GIF version

Theorem curry2ima 28869
 Description: The image of a curried function with a constant second argument. (Contributed by Thierry Arnoux, 25-Sep-2017.)
Hypothesis
Ref Expression
curry2ima.1 𝐺 = (𝐹(1st ↾ (V × {𝐶})))
Assertion
Ref Expression
curry2ima ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → (𝐺𝐷) = {𝑦 ∣ ∃𝑥𝐷 𝑦 = (𝑥𝐹𝐶)})
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦   𝑥,𝐶,𝑦   𝑥,𝐷,𝑦   𝑥,𝐹,𝑦   𝑥,𝐺,𝑦

Proof of Theorem curry2ima
StepHypRef Expression
1 simp1 1054 . . . . . 6 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → 𝐹 Fn (𝐴 × 𝐵))
2 dffn2 5960 . . . . . 6 (𝐹 Fn (𝐴 × 𝐵) ↔ 𝐹:(𝐴 × 𝐵)⟶V)
31, 2sylib 207 . . . . 5 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → 𝐹:(𝐴 × 𝐵)⟶V)
4 simp2 1055 . . . . 5 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → 𝐶𝐵)
5 curry2ima.1 . . . . . 6 𝐺 = (𝐹(1st ↾ (V × {𝐶})))
65curry2f 7160 . . . . 5 ((𝐹:(𝐴 × 𝐵)⟶V ∧ 𝐶𝐵) → 𝐺:𝐴⟶V)
73, 4, 6syl2anc 691 . . . 4 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → 𝐺:𝐴⟶V)
8 ffun 5961 . . . 4 (𝐺:𝐴⟶V → Fun 𝐺)
97, 8syl 17 . . 3 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → Fun 𝐺)
10 simp3 1056 . . . 4 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → 𝐷𝐴)
11 fdm 5964 . . . . 5 (𝐺:𝐴⟶V → dom 𝐺 = 𝐴)
127, 11syl 17 . . . 4 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → dom 𝐺 = 𝐴)
1310, 12sseqtr4d 3605 . . 3 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → 𝐷 ⊆ dom 𝐺)
14 dfimafn 6155 . . 3 ((Fun 𝐺𝐷 ⊆ dom 𝐺) → (𝐺𝐷) = {𝑦 ∣ ∃𝑥𝐷 (𝐺𝑥) = 𝑦})
159, 13, 14syl2anc 691 . 2 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → (𝐺𝐷) = {𝑦 ∣ ∃𝑥𝐷 (𝐺𝑥) = 𝑦})
165curry2val 7161 . . . . . . 7 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵) → (𝐺𝑥) = (𝑥𝐹𝐶))
17163adant3 1074 . . . . . 6 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → (𝐺𝑥) = (𝑥𝐹𝐶))
1817eqeq1d 2612 . . . . 5 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → ((𝐺𝑥) = 𝑦 ↔ (𝑥𝐹𝐶) = 𝑦))
19 eqcom 2617 . . . . 5 ((𝑥𝐹𝐶) = 𝑦𝑦 = (𝑥𝐹𝐶))
2018, 19syl6bb 275 . . . 4 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → ((𝐺𝑥) = 𝑦𝑦 = (𝑥𝐹𝐶)))
2120rexbidv 3034 . . 3 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → (∃𝑥𝐷 (𝐺𝑥) = 𝑦 ↔ ∃𝑥𝐷 𝑦 = (𝑥𝐹𝐶)))
2221abbidv 2728 . 2 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → {𝑦 ∣ ∃𝑥𝐷 (𝐺𝑥) = 𝑦} = {𝑦 ∣ ∃𝑥𝐷 𝑦 = (𝑥𝐹𝐶)})
2315, 22eqtrd 2644 1 ((𝐹 Fn (𝐴 × 𝐵) ∧ 𝐶𝐵𝐷𝐴) → (𝐺𝐷) = {𝑦 ∣ ∃𝑥𝐷 𝑦 = (𝑥𝐹𝐶)})
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ∧ w3a 1031   = wceq 1475   ∈ wcel 1977  {cab 2596  ∃wrex 2897  Vcvv 3173   ⊆ wss 3540  {csn 4125   × cxp 5036  ◡ccnv 5037  dom cdm 5038   ↾ cres 5040   “ cima 5041   ∘ ccom 5042  Fun wfun 5798   Fn wfn 5799  ⟶wf 5800  ‘cfv 5804  (class class class)co 6549  1st c1st 7057 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847 This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-ov 6552  df-1st 7059  df-2nd 7060 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator