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

Theorem feqmptdf 6986
Description: Deduction form of dffn5f 6987. (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 6739 . 2 (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
3 fnrel 6671 . . . . 5 (𝐹 Fn 𝐴 → Rel 𝐹)
4 feqmptdf.2 . . . . . 6 Ⅎ𝑥𝐹
5 nfcv 2926 . . . . . 6 Ⅎ𝑦𝐹
64, 5dfrel4 6201 . . . . 5 (Rel 𝐹 ↔ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦})
73, 6sylib 221 . . . 4 (𝐹 Fn 𝐴 → 𝐹 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦})
8 feqmptdf.1 . . . . . 6 Ⅎ𝑥𝐴
94, 8nffn 6668 . . . . 5 Ⅎ𝑥 𝐹 Fn 𝐴
10 nfv 1949 . . . . 5 Ⅎ𝑦 𝐹 Fn 𝐴
11 fnbr 6677 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑥𝐹𝑦) → 𝑥 ∈ 𝐴)
1211ex 418 . . . . . . 7 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 → 𝑥 ∈ 𝐴))
1312pm4.71rd 572 . . . . . 6 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦)))
14 eqcom 2770 . . . . . . . 8 (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦)
15 fnbrfvb 6966 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑦 ↔ 𝑥𝐹𝑦))
1614, 15bitrid 286 . . . . . . 7 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦))
1716pm5.32da 590 . . . . . 6 (𝐹 Fn 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦)))
1813, 17bitr4d 285 . . . . 5 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))))
199, 10, 18opabbid 5176 . . . 4 (𝐹 Fn 𝐴 → {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))})
207, 19eqtrd 2798 . . 3 (𝐹 Fn 𝐴 → 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))})
21 df-mpt 5193 . . 3 (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))}
2220, 21eqtr4di 2816 . 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 2147  Ⅎwnfc 2911   class class class wbr 5108  {copab 5173   ↦ cmpt 5192  Rel wrel 5663   Fn wfn 6561  ⟶wf 6562  ‘cfv 6566
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574
This theorem is used by:  esumf1o  34793  feqresmptf  46516  liminfvaluz3  47079  liminfvaluz4  47082  volioofmpt  47277  volicofmpt  47280
  Copyright terms: Public domain W3C validator