HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
GIF version

Theorem eqfnfv 3788
Description: Equality of functions is determined by their values. Exercise 4 of [TakeutiZaring] p. 28.
Assertion
Ref Expression
eqfnfv ((F Fn AG Fn B) → (F = G ↔ (A = B ⋀ ∀xA (Fx) = (Gx))))
Distinct variable groups:   x,A   x,F   x,G

Proof of Theorem eqfnfv
StepHypRef Expression
1 eqeq12 1484 . . . . 5 ((dom F = A ⋀ dom G = B) → (dom F = dom GA = B))
2 dmeq 3306 . . . . 5 (F = G → dom F = dom G)
31, 2syl5bi 208 . . . 4 ((dom F = A ⋀ dom G = B) → (F = GA = B))
4 fndm 3579 . . . 4 (F Fn A → dom F = A)
5 fndm 3579 . . . 4 (G Fn B → dom G = B)
63, 4, 5syl2an 454 . . 3 ((F Fn AG Fn B) → (F = GA = B))
7 fveq1 3714 . . . . . 6 (F = G → (Fx) = (Gx))
87a1d 12 . . . . 5 (F = G → (xA → (Fx) = (Gx)))
98r19.21aiv 1710 . . . 4 (F = G → ∀xA (Fx) = (Gx))
109a1i 8 . . 3 ((F Fn AG Fn B) → (F = G → ∀xA (Fx) = (Gx)))
116, 10jcad 599 . 2 ((F Fn AG Fn B) → (F = G → (A = B ⋀ ∀xA (Fx) = (Gx))))
12 visset 1809 . . . . . . . . . . . . . . . . 17 yV
1312fnopfvb 3745 . . . . . . . . . . . . . . . 16 ((F Fn AxA) → ((Fx) = y ↔ ⟨x, y⟩ ∈ F))
1413adantlr 393 . . . . . . . . . . . . . . 15 (((F Fn AG Fn A) ⋀ xA) → ((Fx) = y ↔ ⟨x, y⟩ ∈ F))
1512fnopfvb 3745 . . . . . . . . . . . . . . . 16 ((G Fn AxA) → ((Gx) = y ↔ ⟨x, y⟩ ∈ G))
1615adantll 392 . . . . . . . . . . . . . . 15 (((F Fn AG Fn A) ⋀ xA) → ((Gx) = y ↔ ⟨x, y⟩ ∈ G))
1714, 16bibi12d 628 . . . . . . . . . . . . . 14 (((F Fn AG Fn A) ⋀ xA) → (((Fx) = y ↔ (Gx) = y) ↔ (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
18 eqeq1 1478 . . . . . . . . . . . . . 14 ((Fx) = (Gx) → ((Fx) = y ↔ (Gx) = y))
1917, 18syl5bi 208 . . . . . . . . . . . . 13 (((F Fn AG Fn A) ⋀ xA) → ((Fx) = (Gx) → (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
2019ex 373 . . . . . . . . . . . 12 ((F Fn AG Fn A) → (xA → ((Fx) = (Gx) → (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G))))
2120a2d 13 . . . . . . . . . . 11 ((F Fn AG Fn A) → ((xA → (Fx) = (Gx)) → (xA → (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G))))
2221com3r 35 . . . . . . . . . 10 (xA → ((F Fn AG Fn A) → ((xA → (Fx) = (Gx)) → (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G))))
234eleq2d 1538 . . . . . . . . . . . . . 14 (F Fn A → (x ∈ dom FxA))
24 visset 1809 . . . . . . . . . . . . . . 15 xV
2524opeldm 3309 . . . . . . . . . . . . . 14 (⟨x, y⟩ ∈ Fx ∈ dom F)
2623, 25syl5bi 208 . . . . . . . . . . . . 13 (F Fn A → (⟨x, y⟩ ∈ FxA))
2726con3d 95 . . . . . . . . . . . 12 (F Fn A → (¬ xA → ¬ ⟨x, y⟩ ∈ F))
28 fndm 3579 . . . . . . . . . . . . . . 15 (G Fn A → dom G = A)
2928eleq2d 1538 . . . . . . . . . . . . . 14 (G Fn A → (x ∈ dom GxA))
3024opeldm 3309 . . . . . . . . . . . . . 14 (⟨x, y⟩ ∈ Gx ∈ dom G)
3129, 30syl5bi 208 . . . . . . . . . . . . 13 (G Fn A → (⟨x, y⟩ ∈ GxA))
3231con3d 95 . . . . . . . . . . . 12 (G Fn A → (¬ xA → ¬ ⟨x, y⟩ ∈ G))
3327, 32anim12ii 558 . . . . . . . . . . 11 ((F Fn AG Fn A) → (¬ xA → (¬ ⟨x, y⟩ ∈ F ⋀ ¬ ⟨x, y⟩ ∈ G)))
34 pm5.21 676 . . . . . . . . . . . 12 ((¬ ⟨x, y⟩ ∈ F ⋀ ¬ ⟨x, y⟩ ∈ G) → (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G))
3534a1d 12 . . . . . . . . . . 11 ((¬ ⟨x, y⟩ ∈ F ⋀ ¬ ⟨x, y⟩ ∈ G) → ((xA → (Fx) = (Gx)) → (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
3633, 35syl6com 53 . . . . . . . . . 10 xA → ((F Fn AG Fn A) → ((xA → (Fx) = (Gx)) → (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G))))
3722, 36pm2.61i 126 . . . . . . . . 9 ((F Fn AG Fn A) → ((xA → (Fx) = (Gx)) → (⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
383719.21adv 1286 . . . . . . . 8 ((F Fn AG Fn A) → ((xA → (Fx) = (Gx)) → ∀y(⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
393819.20dv 1287 . . . . . . 7 ((F Fn AG Fn A) → (∀x(xA → (Fx) = (Gx)) → ∀xy(⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
40 df-ral 1646 . . . . . . 7 (∀xA (Fx) = (Gx) ↔ ∀x(xA → (Fx) = (Gx)))
4139, 40syl5ib 206 . . . . . 6 ((F Fn AG Fn A) → (∀xA (Fx) = (Gx) → ∀xy(⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
42 eqrel 3245 . . . . . . 7 ((Rel F ⋀ Rel G) → (F = G ↔ ∀xy(⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
43 fnrel 3578 . . . . . . 7 (F Fn A → Rel F)
44 fnrel 3578 . . . . . . 7 (G Fn A → Rel G)
4542, 43, 44syl2an 454 . . . . . 6 ((F Fn AG Fn A) → (F = G ↔ ∀xy(⟨x, y⟩ ∈ F ↔ ⟨x, y⟩ ∈ G)))
4641, 45sylibrd 204 . . . . 5 ((F Fn AG Fn A) → (∀xA (Fx) = (Gx) → F = G))
47 fneq2 3575 . . . . . 6 (A = B → (G Fn AG Fn B))
4847biimparc 419 . . . . 5 ((G Fn BA = B) → G Fn A)
4946, 48sylan2 451 . . . 4 ((F Fn A ⋀ (G Fn BA = B)) → (∀xA (Fx) = (Gx) → F = G))
5049exp32 377 . . 3 (F Fn A → (G Fn B → (A = B → (∀xA (Fx) = (Gx) → F = G))))
5150imp4b 365 . 2 ((F Fn AG Fn B) → ((A = B ⋀ ∀xA (Fx) = (Gx)) → F = G))
5211, 51impbid 515 1 ((F Fn AG Fn B) → (F = G ↔ (A = B ⋀ ∀xA (Fx) = (Gx))))
Colors of variables: wff set class
Syntax hints:  ¬ wn 2   → wi 3   ↔ wb 146   ⋀ wa 223  ∀wal 952   = wceq 954   ∈ wcel 956  ∀wral 1642  ⟨cop 2407  dom cdm 3165  Rel wrel 3170   Fn wfn 3172   ‘cfv 3177
This theorem is referenced by:  eqfnfvf 3789  fvreseq 3790  fconst2g 3836  tfr3 3917  eqfnoprval 4007  curry1 4088  df1st2 4116  df2nd2 4117  mapenlem2 4476  seq1res 6272  seq1shftid 6301  seq1seqz 6481  seq1seq0 6485  seqzeq 6495  seqzres 6500  seqzres2 6501  invfval 8213  sspn 8342  nmlno0lem 8398  phoeqi 8462  sinco 8605  cosco 8606  shftefif1olem 8680  dfiop2 9619  hoeqt 9626  ho01 9694  hoeq1t 9696  kbpjt 9819  nmlnop0ALT 9858  lnopco0 9867  lnopcon 9901  lnfncon 9928  hmopidmpj 10018  pjssdif2 10040  pjinvar 10057  cayleylem2 10344
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-ral 1646  df-rex 1647  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-uni 2499  df-br 2615  df-opab 2662  df-id 2830  df-xp 3179  df-rel 3180  df-cnv 3181  df-co 3182  df-dm 3183  df-rn 3184  df-res 3185  df-ima 3186  df-fun 3187  df-fn 3188  df-fv 3193
Copyright terms: Public domain