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

Theorem eqfnfv 7037
Description: Equality of functions is determined by their values. Special case of Exercise 4 of [TakeutiZaring] p. 28 (with domain equality omitted). (Contributed by NM, 3-Aug-1994.) (Proof shortened by Andrew Salmon, 22-Oct-2011.) (Proof shortened by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
eqfnfv ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺

Proof of Theorem eqfnfv
StepHypRef Expression
1 dffn5 6951 . . 3 (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)))
2 dffn5 6951 . . 3 (𝐺 Fn 𝐴 ↔ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)))
3 eqeq12 2780 . . 3 ((𝐹 = (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) ∧ 𝐺 = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥))) → (𝐹 = 𝐺 ↔ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥))))
41, 2, 3syl2anb 610 . 2 ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ (𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥))))
5 fvex 6906 . . . 4 (𝐹‘𝑥) ∈ V
65rgenw 3083 . . 3 ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V
7 mpteqb 7021 . . 3 (∀𝑥 ∈ 𝐴 (𝐹‘𝑥) ∈ V → ((𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)))
86, 7ax-mp 5 . 2 ((𝑥 ∈ 𝐴 ↦ (𝐹‘𝑥)) = (𝑥 ∈ 𝐴 ↦ (𝐺‘𝑥)) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))
94, 8bitrdi 290 1 ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569   ∈ wcel 2146  ∀wral 3079  Vcvv 3453   ↦ cmpt 5188   Fn wfn 6541  ‘cfv 6546
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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-sep 5251  ax-nul 5262  ax-pr 5394
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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-fv 6554
This theorem is used by:  eqfnfv2  7038  eqfnfvd  7040  eqfnfv2f  7041  fsneq  7042  eqfnun  7044  fvreseq0  7045  fnmptfvd  7048  fndmdifeq0  7051  fneqeql  7053  fnnfpeq0  7190  fprb  7206  fconst2g  7216  cocan1  7306  cocan2  7307  weniso  7371  fsplitfpar  8139  fnsuppres  8219  tfr3  8418  ixpfi2  9350  fipreima  9358  updjud  10025  fseqenlem1  10113  fpwwe2lem7  10732  ofsubeq0  12327  ser0f  14208  hashgval2  14532  hashf1lem1  14610  prodf1f  16073  efcvgfsum  16264  prmreclem2  17107  1arithlem4  17116  1arith  17117  smndex1n0mnd  19123  isgrpinv  19216  dprdf11  20251  frlmplusgvalb  22087  frlmvscavalb  22088  islindf4  22156  psrbagconf1o  22249  pthaus  23969  xkohaus  23984  cnmpt11  23994  cnmpt21  24002  prdsxmetlem  24699  rrxmet  25741  rolle  26322  tdeglem4  26390  resinf1o  26876  dchrelbas2  27576  dchreq  27597  eqeefv  29493  axlowdimlem14  29545  elntg2  29575  nmlno0lem  31407  phoeqi  31471  occllem  31917  dfiop2  32367  hoeq  32374  ho01i  32442  hoeq1  32444  kbpj  32570  nmlnop0iALT  32609  lnopco0i  32618  nlelchi  32675  rnbra  32721  kbass5  32734  hmopidmchi  32765  hmopidmpji  32766  pjssdif2i  32788  pjinvari  32805  bnj1542  35540  bnj580  35596  subfacp1lem3  36068  subfacp1lem5  36070  mrsubff1  36400  msubff1  36442  faclimlem1  36635  rdgprc  36683  broucube  38712  cocanfo  38793  sdclem2  38816  rrnmet  38903  rrnequiv  38909  ltrnid  41332  ltrneq2  41345  tendoeq1  41961  sticksstones1  43336  pw2f1ocnv  44184  caofcan  45447  addrcom  45596  dvnprodlem1  47095  cfsetsnfsetf1  48268  cfsetsnfsetfo  48269  rrx2pnecoorneor  49967  rrx2linest  49993  nateq  50483  dfinito4  50775
  Copyright terms: Public domain W3C validator