Theorem feq23i 6699

Description: Equality inference for functions. (Contributed by Paul Chapman, 22-Jun-2011.)

Hypotheses

Ref	Expression
feq23i.1	⊢ 𝐴 = 𝐶
feq23i.2	⊢ 𝐵 = 𝐷

Assertion

Ref	Expression
feq23i	⊢ (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)

Proof of Theorem feq23i

Step	Hyp	Ref	Expression
1		feq23i.1	. 2 ⊢ 𝐴 = 𝐶
2		feq23i.2	. 2 ⊢ 𝐵 = 𝐷
3		feq23 6686	. 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷))
4	1, 2, 3	mp2an 704	1 ⊢ (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)

Syntax hints:   ↔ wb 209   = wceq 1570  ⟶wf 6532

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-9 2153  ax-ext 2735

This theorem depends on definitions:  df-bi 210  df-an 401  df-ex 1810  df-cleq 2755  df-ss 3922  df-fn 6539  df-f 6540

This theorem is referenced by:  ftpg  7153  hashf  14370  funcoppc  17927  cnextfval  24219  uhgr0  29423  lfgredgge2  29474  mbfmvolf  34656  eulerpartlemt  34761  ismgmOLD  38501  elghomOLD  38538  tendoset  41533  pwssplit4  43816  gricushgr  48682  uspgrlimlem2  48754  lincdifsn  49204