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

Theorem feqmptdf 6953
Description: Deduction form of dffn5f 6954. (Contributed by Mario Carneiro, 8-Jan-2015.) (Revised by Thierry Arnoux, 10-May-2017.)
Hypotheses
Ref Expression
feqmptdf.1 Ⅎ𝑥𝐴
feqmptdf.2 Ⅎ𝑥𝐹
feqmptdf.3 (𝜑 → 𝐹:𝐴⟶𝐵)
Assertion
Ref Expression
feqmptdf (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))

Proof of Theorem feqmptdf
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 feqmptdf.3 . 2 (𝜑 → 𝐹:𝐴⟶𝐵)
2 ffn 6707 . 2 (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
3 fnrel 6639 . . . . 5 (𝐹 Fn 𝐴 → Rel 𝐹)
4 feqmptdf.2 . . . . . 6 Ⅎ𝑥𝐹
5 nfcv 2923 . . . . . 6 Ⅎ𝑦𝐹
64, 5dfrel4 6183 . . . . 5 (Rel 𝐹 ↔ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦})
73, 6sylib 221 . . . 4 (𝐹 Fn 𝐴 → 𝐹 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦})
8 feqmptdf.1 . . . . . 6 Ⅎ𝑥𝐴
94, 8nffn 6636 . . . . 5 Ⅎ𝑥 𝐹 Fn 𝐴
10 nfv 1947 . . . . 5 Ⅎ𝑦 𝐹 Fn 𝐴
11 fnbr 6645 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑥𝐹𝑦) → 𝑥 ∈ 𝐴)
1211ex 418 . . . . . . 7 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 → 𝑥 ∈ 𝐴))
1312pm4.71rd 572 . . . . . 6 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦)))
14 eqcom 2768 . . . . . . . 8 (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦)
15 fnbrfvb 6933 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑦 ↔ 𝑥𝐹𝑦))
1614, 15bitrid 286 . . . . . . 7 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦))
1716pm5.32da 590 . . . . . 6 (𝐹 Fn 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦)))
1813, 17bitr4d 285 . . . . 5 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))))
199, 10, 18opabbid 5170 . . . 4 (𝐹 Fn 𝐴 → {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))})
207, 19eqtrd 2796 . . 3 (𝐹 Fn 𝐴 → 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))})
21 df-mpt 5187 . . 3 (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))}
2220, 21eqtr4di 2814 . 2 (𝐹 Fn 𝐴 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
231, 2, 223syl 19 1 (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2908   class class class wbr 5103  {copab 5167   ↦ cmpt 5186  Rel wrel 5656   Fn wfn 6532  ⟶wf 6533  ‘cfv 6537
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
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-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-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-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545
This theorem is used by:  esumf1o  34675  feqresmptf  46212  liminfvaluz3  46775  liminfvaluz4  46778  volioofmpt  46973  volicofmpt  46976
  Copyright terms: Public domain W3C validator