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

Theorem eqfnfv2f 7068
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 7064 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 7064 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑧𝐴 (𝐹𝑧) = (𝐺𝑧)))
2 eqfnfv2f.1 . . . . 5 𝑥𝐹
3 nfcv 2908 . . . . 5 𝑥𝑧
42, 3nffv 6930 . . . 4 𝑥(𝐹𝑧)
5 eqfnfv2f.2 . . . . 5 𝑥𝐺
65, 3nffv 6930 . . . 4 𝑥(𝐺𝑧)
74, 6nfeq 2922 . . 3 𝑥(𝐹𝑧) = (𝐺𝑧)
8 nfv 1913 . . 3 𝑧(𝐹𝑥) = (𝐺𝑥)
9 fveq2 6920 . . . 4 (𝑧 = 𝑥 → (𝐹𝑧) = (𝐹𝑥))
10 fveq2 6920 . . . 4 (𝑧 = 𝑥 → (𝐺𝑧) = (𝐺𝑥))
119, 10eqeq12d 2756 . . 3 (𝑧 = 𝑥 → ((𝐹𝑧) = (𝐺𝑧) ↔ (𝐹𝑥) = (𝐺𝑥)))
127, 8, 11cbvralw 3312 . 2 (∀𝑧𝐴 (𝐹𝑧) = (𝐺𝑧) ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))
131, 12bitrdi 287 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1537  wnfc 2893  wral 3067   Fn wfn 6568  cfv 6573
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pr 5447
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-fv 6581
This theorem is referenced by:  aacllem  48895
  Copyright terms: Public domain W3C validator