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

Theorem eqfnfv2f 7064
Description: Equality of functions is determined by their values. Special case of Exercise 4 of [TakeutiZaring] p. 28 (with domain equality omitted). This version of eqfnfv 7060 uses bound-variable hypotheses instead of distinct variable conditions. (Contributed by NM, 29-Jan-2004.)
Hypotheses
Ref Expression
eqfnfv2f.1 Ⅎ𝑥𝐹
eqfnfv2f.2 Ⅎ𝑥𝐺
Assertion
Ref Expression
eqfnfv2f ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)))
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝐹(𝑥)   𝐺(𝑥)

Proof of Theorem eqfnfv2f
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqfnfv 7060 . 2 ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
2 eqfnfv2f.1 . . . . 5 Ⅎ𝑥𝐹
3 nfcv 2926 . . . . 5 Ⅎ𝑥𝑧
42, 3nffv 6926 . . . 4 Ⅎ𝑥(𝐹‘𝑧)
5 eqfnfv2f.2 . . . . 5 Ⅎ𝑥𝐺
65, 3nffv 6926 . . . 4 Ⅎ𝑥(𝐺‘𝑧)
74, 6nfeq 2939 . . 3 Ⅎ𝑥(𝐹‘𝑧) = (𝐺‘𝑧)
8 nfv 1949 . . 3 Ⅎ𝑧(𝐹‘𝑥) = (𝐺‘𝑥)
9 fveq2 6916 . . . 4 (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
10 fveq2 6916 . . . 4 (𝑧 = 𝑥 → (𝐺‘𝑧) = (𝐺‘𝑥))
119, 10eqeq12d 2779 . . 3 (𝑧 = 𝑥 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑥) = (𝐺‘𝑥)))
127, 8, 11cbvralw 3308 . 2 (∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧) ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥))
131, 12bitrdi 290 1 ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥 ∈ 𝐴 (𝐹‘𝑥) = (𝐺‘𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  Ⅎwnfc 2911  ∀wral 3080   Fn wfn 6561  ‘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-sbc 3743  df-csb 3852  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-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-fv 6574
This theorem is used by:  aacllem  51367
  Copyright terms: Public domain W3C validator