Theorem feq23i 6685

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 6672	. 2 ⊢ ((𝐴 = 𝐶 ∧ 𝐵 = 𝐷) → (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷))
4	1, 2, 3	mp2an 692	1 ⊢ (𝐹:𝐴⟶𝐵 ↔ 𝐹:𝐶⟶𝐷)

Syntax hints:   ↔ wb 206   = wceq 1540  ⟶wf 6510

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-9 2119  ax-ext 2702

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1780  df-cleq 2722  df-ss 3934  df-fn 6517  df-f 6518

This theorem is referenced by:  ftpg  7131  hashf  14310  funcoppc  17844  cnextfval  23956  uhgr0  29007  lfgredgge2  29058  mbfmvolf  34264  eulerpartlemt  34369  ismgmOLD  37851  elghomOLD  37888  tendoset  40760  pwssplit4  43085  gricushgr  47921  uspgrlimlem2  47992  lincdifsn  48417