Theorem feq23i 6701

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

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

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 1943  ax-6 2000  ax-7 2041  ax-9 2155  ax-ext 2733

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-cleq 2753  df-ss 3916  df-fn 6540  df-f 6541

This theorem is used by:  ftpg  7158  hashf  14475  funcoppc  18043  cnextfval  24374  uhgr0  29644  lfgredgge2  29695  mbfmvolf  34891  eulerpartlemt  34996  ismgmOLD  38764  elghomOLD  38801  tendoset  41796  pwssplit4  44075  gricushgr  48984  uspgrlimlem2  49056  lincdifsn  49505