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

Theorem feqmptdf 6958
Description: Deduction form of dffn5f 6959. (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 6712 . 2 (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
3 fnrel 6644 . . . . 5 (𝐹 Fn 𝐴 → Rel 𝐹)
4 feqmptdf.2 . . . . . 6 Ⅎ𝑥𝐹
5 nfcv 2922 . . . . . 6 Ⅎ𝑦𝐹
64, 5dfrel4 6184 . . . . 5 (Rel 𝐹 ↔ 𝐹 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦})
73, 6sylib 221 . . . 4 (𝐹 Fn 𝐴 → 𝐹 = {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦})
8 feqmptdf.1 . . . . . 6 Ⅎ𝑥𝐴
94, 8nffn 6641 . . . . 5 Ⅎ𝑥 𝐹 Fn 𝐴
10 nfv 1946 . . . . 5 Ⅎ𝑦 𝐹 Fn 𝐴
11 fnbr 6650 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑥𝐹𝑦) → 𝑥 ∈ 𝐴)
1211ex 418 . . . . . . 7 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 → 𝑥 ∈ 𝐴))
1312pm4.71rd 572 . . . . . 6 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦)))
14 eqcom 2767 . . . . . . . 8 (𝑦 = (𝐹‘𝑥) ↔ (𝐹‘𝑥) = 𝑦)
15 fnbrfvb 6938 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → ((𝐹‘𝑥) = 𝑦 ↔ 𝑥𝐹𝑦))
1614, 15bitrid 286 . . . . . . 7 ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) ↔ 𝑥𝐹𝑦))
1716pm5.32da 590 . . . . . 6 (𝐹 Fn 𝐴 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥)) ↔ (𝑥 ∈ 𝐴 ∧ 𝑥𝐹𝑦)))
1813, 17bitr4d 285 . . . . 5 (𝐹 Fn 𝐴 → (𝑥𝐹𝑦 ↔ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))))
199, 10, 18opabbid 5169 . . . 4 (𝐹 Fn 𝐴 → {⟨𝑥, 𝑦⟩ ∣ 𝑥𝐹𝑦} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))})
207, 19eqtrd 2795 . . 3 (𝐹 Fn 𝐴 → 𝐹 = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))})
21 df-mpt 5186 . . 3 (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = (𝐹‘𝑥))}
2220, 21eqtr4di 2813 . 2 (𝐹 Fn 𝐴 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
231, 2, 223syl 19 1 (𝜑 → 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1569   ∈ wcel 2144  Ⅎwnfc 2907   class class class wbr 5102  {copab 5166   ↦ cmpt 5185  Rel wrel 5655   Fn wfn 6536  ⟶wf 6537  ‘cfv 6541
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-iota 6496  df-fun 6543  df-fn 6544  df-f 6545  df-fv 6549
This theorem is used by:  esumf1o  34730  feqresmptf  46350  liminfvaluz3  46913  liminfvaluz4  46916  volioofmpt  47111  volicofmpt  47114
  Copyright terms: Public domain W3C validator