Theorem f1eq2 6097

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

Assertion

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

Proof of Theorem f1eq2

Step	Hyp	Ref	Expression
1		feq2 6027	. . 3 ⊢ (𝐴 = 𝐵 → (𝐹:𝐴⟶𝐶 ↔ 𝐹:𝐵⟶𝐶))
2	1	anbi1d 741	. 2 ⊢ (𝐴 = 𝐵 → ((𝐹:𝐴⟶𝐶 ∧ Fun ◡𝐹) ↔ (𝐹:𝐵⟶𝐶 ∧ Fun ◡𝐹)))
3		df-f1 5893	. 2 ⊢ (𝐹:𝐴–1-1→𝐶 ↔ (𝐹:𝐴⟶𝐶 ∧ Fun ◡𝐹))
4		df-f1 5893	. 2 ⊢ (𝐹:𝐵–1-1→𝐶 ↔ (𝐹:𝐵⟶𝐶 ∧ Fun ◡𝐹))
5	2, 3, 4	3bitr4g 303	1 ⊢ (𝐴 = 𝐵 → (𝐹:𝐴–1-1→𝐶 ↔ 𝐹:𝐵–1-1→𝐶))

Syntax hints:   → wi 4   ↔ wb 196   ∧ wa 384   = wceq 1483  ^◡ccnv 5113  Fun wfun 5882  ⟶wf 5884  –1-1→wf1 5885

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-ext 2602

This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705  df-cleq 2615  df-fn 5891  df-f 5892  df-f1 5893

This theorem is referenced by:  f1oeq2  6128  f1eq123d  6131  f10d  6170  brdomg  7965  marypha1lem  8339  fseqenlem1  8847  dfac12lem2  8966  dfac12lem3  8967  ackbij2  9065  iundom2g  9362  hashf1  13241  istrkg3ld  25360  ausgrusgrb  26060  usgr0  26135  uspgr1e  26136  usgrres  26200  usgrexilem  26336  usgr2pthlem  26659  usgr2pth  26660  matunitlindflem2  33406  eldioph2lem2  37324  fargshiftf1  41377  aacllem  42547