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

Theorem eqfnfv2f 6987
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 6983 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 6983 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑧𝐴 (𝐹𝑧) = (𝐺𝑧)))
2 eqfnfv2f.1 . . . . 5 𝑥𝐹
3 nfcv 2898 . . . . 5 𝑥𝑧
42, 3nffv 6850 . . . 4 𝑥(𝐹𝑧)
5 eqfnfv2f.2 . . . . 5 𝑥𝐺
65, 3nffv 6850 . . . 4 𝑥(𝐺𝑧)
74, 6nfeq 2912 . . 3 𝑥(𝐹𝑧) = (𝐺𝑧)
8 nfv 1916 . . 3 𝑧(𝐹𝑥) = (𝐺𝑥)
9 fveq2 6840 . . . 4 (𝑧 = 𝑥 → (𝐹𝑧) = (𝐹𝑥))
10 fveq2 6840 . . . 4 (𝑧 = 𝑥 → (𝐺𝑧) = (𝐺𝑥))
119, 10eqeq12d 2752 . . 3 (𝑧 = 𝑥 → ((𝐹𝑧) = (𝐺𝑧) ↔ (𝐹𝑥) = (𝐺𝑥)))
127, 8, 11cbvralw 3279 . 2 (∀𝑧𝐴 (𝐹𝑧) = (𝐺𝑧) ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))
131, 12bitrdi 287 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wnfc 2883  wral 3051   Fn wfn 6493  cfv 6498
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-fv 6506
This theorem is referenced by:  aacllem  50276
  Copyright terms: Public domain W3C validator