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

Theorem eqfnfv2f 7038
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 7034 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 7034 . 2 ((𝐹 Fn 𝐴 ∧ 𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑧 ∈ 𝐴 (𝐹‘𝑧) = (𝐺‘𝑧)))
2 eqfnfv2f.1 . . . . 5 Ⅎ𝑥𝐹
3 nfcv 2922 . . . . 5 Ⅎ𝑥𝑧
42, 3nffv 6900 . . . 4 Ⅎ𝑥(𝐹‘𝑧)
5 eqfnfv2f.2 . . . . 5 Ⅎ𝑥𝐺
65, 3nffv 6900 . . . 4 Ⅎ𝑥(𝐺‘𝑧)
74, 6nfeq 2935 . . 3 Ⅎ𝑥(𝐹‘𝑧) = (𝐺‘𝑧)
8 nfv 1946 . . 3 Ⅎ𝑧(𝐹‘𝑥) = (𝐺‘𝑥)
9 fveq2 6890 . . . 4 (𝑧 = 𝑥 → (𝐹‘𝑧) = (𝐹‘𝑥))
10 fveq2 6890 . . . 4 (𝑧 = 𝑥 → (𝐺‘𝑧) = (𝐺‘𝑥))
119, 10eqeq12d 2776 . . 3 (𝑧 = 𝑥 → ((𝐹‘𝑧) = (𝐺‘𝑧) ↔ (𝐹‘𝑥) = (𝐺‘𝑥)))
127, 8, 11cbvralw 3304 . 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 1569  Ⅎwnfc 2907  ∀wral 3076   Fn wfn 6538  ‘cfv 6543
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 5391
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-sbc 3739  df-csb 3848  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 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-fv 6551
This theorem is used by:  aacllem  51122
  Copyright terms: Public domain W3C validator