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

Theorem feq1d 3616
Description: Equality deduction for mappings.
Hypothesis
Ref Expression
feq1d.1 |- (ph -> F = G)
Assertion
Ref Expression
feq1d |- (ph -> (F:A-->B <-> G:A-->B))

Proof of Theorem feq1d
StepHypRef Expression
1 feq1d.1 . 2 |- (ph -> F = G)
2 feq1 3612 . 2 |- (F = G -> (F:A-->B <-> G:A-->B))
31, 2syl 10 1 |- (ph -> (F:A-->B <-> G:A-->B))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   = wceq 954  -->wf 3173
This theorem is referenced by:  fssres2 3635  fconst 3649  fressnfv 3829  curry1f 4089  xpmapenlem4 4485  ser1ft 6273  grpdivf 8035  grplactf1o 8049  nvmf 8218  imsdf 8271  ipf 8313  0oo 8394  hoaddclt 9624  homulclt 9625  hosubclt 9639  brafnt 9810  kbopt 9816
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-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-br 2615  df-opab 2662  df-id 2830  df-rel 3180  df-cnv 3181  df-co 3182  df-dm 3183  df-rn 3184  df-fun 3187  df-fn 3188  df-f 3189
Copyright terms: Public domain