Theorem f1eq3 6802

Description: Equality theorem for one-to-one functions. (Contributed by NM, 10-Feb-1997.)

Assertion

Ref	Expression
f1eq3	⊢ (𝐴 = 𝐵 → (𝐹:𝐶–1-1→𝐴 ↔ 𝐹:𝐶–1-1→𝐵))

Proof of Theorem f1eq3

Step	Hyp	Ref	Expression
1		feq3 6719	. . 3 ⊢ (𝐴 = 𝐵 → (𝐹:𝐶⟶𝐴 ↔ 𝐹:𝐶⟶𝐵))
2	1	anbi1d 631	. 2 ⊢ (𝐴 = 𝐵 → ((𝐹:𝐶⟶𝐴 ∧ Fun ◡𝐹) ↔ (𝐹:𝐶⟶𝐵 ∧ Fun ◡𝐹)))
3		df-f1 6568	. 2 ⊢ (𝐹:𝐶–1-1→𝐴 ↔ (𝐹:𝐶⟶𝐴 ∧ Fun ◡𝐹))
4		df-f1 6568	. 2 ⊢ (𝐹:𝐶–1-1→𝐵 ↔ (𝐹:𝐶⟶𝐵 ∧ Fun ◡𝐹))
5	2, 3, 4	3bitr4g 314	1 ⊢ (𝐴 = 𝐵 → (𝐹:𝐶–1-1→𝐴 ↔ 𝐹:𝐶–1-1→𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537  ^◡ccnv 5688  Fun wfun 6557  ⟶wf 6559  –1-1→wf1 6560

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-9 2116  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1777  df-cleq 2727  df-ss 3980  df-f 6567  df-f1 6568

This theorem is referenced by:  f1oeq3  6839  f1eq123d  6841  tposf12  8275  brdom2g  8995  brdomgOLD  8997  1sdom2dom  9281  pwfseq  10702  f1linds  21863  isusgrs  29188  usgrstrrepe  29267  usgrexilem  29472  tocycval  33111  diaf1oN  41113  f1cof1b  47027