Theorem feq23i 6733

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

This proof depends on syntax axioms:   ↔ wb 209   = wceq 1570  ⟶wf 6562

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-9 2157  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2755  df-ss 3901  df-fn 6569  df-f 6570

This theorem is used by:  ftpg  7192  hashf  14523  funcoppc  18100  cnextfval  24436  uhgr0  29708  lfgredgge2  29759  mbfmvolf  35009  eulerpartlemt  35114  ismgmOLD  39050  elghomOLD  39087  tendoset  42082  pwssplit4  44357  gricushgr  49288  uspgrlimlem2  49360  lincdifsn  49867