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

Theorem feq1d 3630
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 3626 . 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 958  -->wf 3184
This theorem is referenced by:  fssres2 3650  fconst 3664  fressnfv 3844  curry1f 4105  xpmapenlem4 4505  ser1ft 6329  grpdivf 8081  grplactf1o 8094  nvmf 8262  imsdf 8316  ipf 8362  0oo 8445  hoaddclt 9679  homulclt 9680  hosubclt 9694  brafnt 9866  kbopt 9872
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-br 2625  df-opab 2672  df-id 2841  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-fun 3198  df-fn 3199  df-f 3200
Copyright terms: Public domain