ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  eqfnfv2 GIF version

Theorem eqfnfv2 5807
Description: Equality of functions is determined by their values. Exercise 4 of [TakeutiZaring] p. 28. (Contributed by NM, 3-Aug-1994.) (Revised by Mario Carneiro, 31-Aug-2015.)
Assertion
Ref Expression
eqfnfv2 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐹   𝑥,𝐺
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem eqfnfv2
StepHypRef Expression
1 dmeq 4981 . . . 4 (𝐹 = 𝐺 → dom 𝐹 = dom 𝐺)
2 fndm 5480 . . . . 5 (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
3 fndm 5480 . . . . 5 (𝐺 Fn 𝐵 → dom 𝐺 = 𝐵)
42, 3eqeqan12d 2254 . . . 4 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (dom 𝐹 = dom 𝐺𝐴 = 𝐵))
51, 4imbitrid 154 . . 3 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (𝐹 = 𝐺𝐴 = 𝐵))
65pm4.71rd 398 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐵𝐹 = 𝐺)))
7 fneq2 5470 . . . . . 6 (𝐴 = 𝐵 → (𝐺 Fn 𝐴𝐺 Fn 𝐵))
87biimparc 299 . . . . 5 ((𝐺 Fn 𝐵𝐴 = 𝐵) → 𝐺 Fn 𝐴)
9 eqfnfv 5806 . . . . 5 ((𝐹 Fn 𝐴𝐺 Fn 𝐴) → (𝐹 = 𝐺 ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
108, 9sylan2 286 . . . 4 ((𝐹 Fn 𝐴 ∧ (𝐺 Fn 𝐵𝐴 = 𝐵)) → (𝐹 = 𝐺 ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
1110anassrs 404 . . 3 (((𝐹 Fn 𝐴𝐺 Fn 𝐵) ∧ 𝐴 = 𝐵) → (𝐹 = 𝐺 ↔ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥)))
1211pm5.32da 456 . 2 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → ((𝐴 = 𝐵𝐹 = 𝐺) ↔ (𝐴 = 𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))))
136, 12bitrd 188 1 ((𝐹 Fn 𝐴𝐺 Fn 𝐵) → (𝐹 = 𝐺 ↔ (𝐴 = 𝐵 ∧ ∀𝑥𝐴 (𝐹𝑥) = (𝐺𝑥))))
Colors of variables:    wff set class
This proof depends on syntax axioms:  wi 4  wa 104  wb 105   = wceq 1402  wral 2528  dom cdm 4774   Fn wfn 5372  cfv 5377
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-sbc 3052  df-csb 3148  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385
This theorem is used by:  eqfnfv3  5808  eqfunfv  5811  eqfnov  6195  2ffzeq  10548  eqwrd  11345
  Copyright terms: Public domain W3C validator